Triple
T6832959
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | linear algebra |
E157381
|
entity |
| Predicate | hasKeyOperation |
P1137
|
FINISHED |
| Object | Gaussian elimination |
E29360
|
NE FINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Gaussian elimination | Statement: [linear algebra, hasKeyOperation, Gaussian elimination]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gaussian elimination Context triple: [linear algebra, hasKeyOperation, Gaussian elimination]
-
A.
Gaussian elimination
chosen
Gaussian elimination is a fundamental algorithm in linear algebra used to solve systems of linear equations by systematically transforming matrices into row-echelon form.
-
B.
gauss
The gauss is a unit of magnetic flux density in the centimeter–gram–second (CGS) system, commonly used in physics to measure the strength of magnetic fields.
-
C.
Gauss–Seidel method
The Gauss–Seidel method is an iterative numerical technique used to solve systems of linear equations, particularly in large, sparse problems arising in scientific and engineering computations.
-
D.
LinearAlgebra
LinearAlgebra is Julia’s standard library module providing core functionality for vectors, matrices, and advanced linear algebra operations.
-
E.
Jacobi method
The Jacobi method is an iterative numerical algorithm used to solve systems of linear equations by repeatedly updating each variable using values from the previous iteration.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69c6882c53608190b99aebef079b23bd |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d7ca96008190ba79563c2a9a9b0e |
completed | March 27, 2026, 7:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c723fd50c88190af005fd58ca0aee6 |
completed | March 28, 2026, 12:42 a.m. |
Created at: March 27, 2026, 2:18 p.m.