Triple
T18307141
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jerzy Kaczmarz |
E438515
|
entity |
| Predicate | notableFor |
P22
|
FINISHED |
| Object | Kaczmarz method |
—
|
NE NERFINISHED |
How this triple was built (3 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: Kaczmarz method | Statement: [Jerzy Kaczmarz, notableFor, Kaczmarz method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kaczmarz method Context triple: [Jerzy Kaczmarz, notableFor, Kaczmarz method]
-
A.
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.
-
B.
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.
-
C.
Godunov's method
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
-
D.
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.
-
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. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kaczmarz method Target entity description: The Kaczmarz method is an iterative algorithm for solving systems of linear equations by successively projecting onto the solution spaces of individual equations, widely used in numerical analysis and tomography.
-
A.
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.
-
B.
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.
-
C.
Godunov's method
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
-
D.
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.
-
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. chosen
Provenance (2 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_69d8b915e3e881909125d760c15d0c29 |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e5021519a481908a9b6561946f1c65 |
completed | April 19, 2026, 4:25 p.m. |
Created at: April 10, 2026, 10:35 a.m.