Triple

T7921598
Position Surface form Disambiguated ID Type / Status
Subject Jacobi matrix E183956 entity
Predicate usedIn P98 FINISHED
Object Jacobi eigenvalue algorithm
The Jacobi eigenvalue algorithm is an iterative numerical method for computing all eigenvalues and eigenvectors of a real symmetric matrix by applying a sequence of orthogonal similarity transformations.
E697940 NE FINISHED

How this triple was built (4 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 eigenvalue algorithm | Statement: [Jacobi matrix, usedIn, Jacobi eigenvalue algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Jacobi eigenvalue algorithm
Context triple: [Jacobi matrix, usedIn, Jacobi eigenvalue algorithm]
  • A. 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.
  • B. 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.
  • 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. arpack
    arpack is a numerical software library for efficiently computing a few eigenvalues and eigenvectors of large sparse matrices, commonly used in scientific computing and machine learning.
  • E. Jacobi
    Jacobi is a German surname most famously associated with the 19th-century mathematician Carl Gustav Jacob Jacobi, known for his foundational work in elliptic functions and number theory.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Jacobi eigenvalue algorithm
Triple: [Jacobi matrix, usedIn, Jacobi eigenvalue algorithm]
Generated description
The Jacobi eigenvalue algorithm is an iterative numerical method for computing all eigenvalues and eigenvectors of a real symmetric matrix by applying a sequence of orthogonal similarity transformations.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Jacobi eigenvalue algorithm
Target entity description: The Jacobi eigenvalue algorithm is an iterative numerical method for computing all eigenvalues and eigenvectors of a real symmetric matrix by applying a sequence of orthogonal similarity transformations.
  • A. 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.
  • B. 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.
  • 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. arpack
    arpack is a numerical software library for efficiently computing a few eigenvalues and eigenvectors of large sparse matrices, commonly used in scientific computing and machine learning.
  • E. Jacobi
    Jacobi is a German surname most famously associated with the 19th-century mathematician Carl Gustav Jacob Jacobi, known for his foundational work in elliptic functions and number theory.
  • F. None of above. chosen

Provenance (5 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_69ca828efbe48190bd48482650182e79 completed March 30, 2026, 2:02 p.m.
NER Named-entity recognition batch_69cb3a9499cc8190b6bd81f4625c77ab completed March 31, 2026, 3:08 a.m.
NED1 Entity disambiguation (via context triple) batch_69cb5beea7988190972f7d02881d98f6 completed March 31, 2026, 5:30 a.m.
NEDg Description generation batch_69cb5f222c808190b9ef39896f149278 completed March 31, 2026, 5:44 a.m.
NED2 Entity disambiguation (via description) batch_69cb76c896c08190a67a5b572436f2d9 completed March 31, 2026, 7:24 a.m.
Created at: March 30, 2026, 5:06 p.m.