Triple

T17676457
Position Surface form Disambiguated ID Type / Status
Subject Bidiagonal matrix E440653 entity
Predicate isUsedIn P98 FINISHED
Object Golub–Kahan SVD algorithm — 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: Golub–Kahan SVD algorithm | Statement: [Bidiagonal matrix, isUsedIn, Golub–Kahan SVD algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Golub–Kahan SVD algorithm
Context triple: [Bidiagonal matrix, isUsedIn, Golub–Kahan SVD algorithm]
  • A. Bartels–Stewart algorithm
    The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
  • B. 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.
  • C. Lanczos algorithm
    The Lanczos algorithm is an iterative numerical method used to approximate eigenvalues and eigenvectors of large sparse matrices, particularly in scientific computing and numerical linear algebra.
  • D. SVD
    SVD is the abbreviation for the Special Victims Division, a specialized police unit that investigates sensitive crimes such as sexual offenses and crimes against vulnerable victims.
  • E. SVD
    SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
  • 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: Golub–Kahan SVD algorithm
Target entity description: The Golub–Kahan SVD algorithm is a numerical method for computing the singular value decomposition of a matrix by first reducing it to bidiagonal form and then iteratively refining its singular values and vectors.
  • A. Bartels–Stewart algorithm
    The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
  • B. 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.
  • C. Lanczos algorithm
    The Lanczos algorithm is an iterative numerical method used to approximate eigenvalues and eigenvectors of large sparse matrices, particularly in scientific computing and numerical linear algebra.
  • D. SVD
    SVD is the abbreviation for the Special Victims Division, a specialized police unit that investigates sensitive crimes such as sexual offenses and crimes against vulnerable victims.
  • E. SVD
    SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
  • 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_69d8b9e940b081908b862bb0e6e89b0d completed April 10, 2026, 8:50 a.m.
NER Named-entity recognition batch_69e46f6d9ab88190ab0e25eac8b0101c completed April 19, 2026, 6 a.m.
Created at: April 10, 2026, 10:01 a.m.