Triple
T1382090
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gaussian elimination |
E29360
|
entity |
| Predicate | numericalVariant |
P4680
|
FINISHED |
| Object | Gaussian elimination with full pivoting |
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 with full pivoting | Statement: [Gaussian elimination, numericalVariant, Gaussian elimination with full pivoting]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gaussian elimination with full pivoting Context triple: [Gaussian elimination, numericalVariant, Gaussian elimination with full pivoting]
-
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–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.
-
C.
Kailath factorization in linear systems
Kailath factorization in linear systems is a matrix factorization technique used in control and signal processing to efficiently analyze and solve linear dynamical systems.
-
D.
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.
-
E.
LinearAlgebra
LinearAlgebra is Julia’s standard library module providing core functionality for vectors, matrices, and advanced linear algebra operations.
- 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_69a498d883a48190bfdca525296ef7ee |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c48ff58c8190aeaf09d3e7cad7c7 |
completed | March 1, 2026, 10:58 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69acde1f08e08190871fd9d539e902c8 |
completed | March 8, 2026, 2:25 a.m. |
Created at: March 1, 2026, 7:59 p.m.