Triple
T1615218
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Carl Gustav Jacob Jacobi |
E34700
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Jacobi method |
E157386
|
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: Jacobi method | Statement: [Carl Gustav Jacob Jacobi, notableWork, Jacobi method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Jacobi method Context triple: [Carl Gustav Jacob Jacobi, notableWork, Jacobi method]
-
A.
Jacobi method
chosen
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.
-
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.
Richardson iteration
Richardson iteration is an early iterative method for solving linear systems and other operator equations, based on repeated relaxation steps to progressively improve an approximate solution.
-
D.
Successive Over-Relaxation
Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
-
E.
Picard iteration
Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
- 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_69a885ffc5ec819091afa325d5f9611c |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69a9099049e0819099763ecb09fb4f57 |
completed | March 5, 2026, 4:41 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad51cd2e54819086924378792eb2e3 |
completed | March 8, 2026, 10:39 a.m. |
Created at: March 4, 2026, 7:28 p.m.