Triple

T15860301
Position Surface form Disambiguated ID Type / Status
Subject Schmidt orthogonalization E384564 entity
Predicate relatedTo P37 FINISHED
Object Householder transformation
The Householder transformation is a linear algebra technique that uses reflections to orthogonally transform vectors and matrices, commonly employed in QR decomposition and numerical algorithms.
E1180032 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: Householder transformation | Statement: [Schmidt orthogonalization, relatedTo, Householder transformation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Householder transformation
Context triple: [Schmidt orthogonalization, relatedTo, Householder transformation]
  • A. Schmidt orthogonalization
    Schmidt orthogonalization is a mathematical procedure, also known as the Gram–Schmidt process, that converts a set of linearly independent vectors into an orthonormal set spanning the same subspace.
  • B. 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.
  • C. 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.
  • D. Walsh–Hadamard transform
    The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
  • E. Hermite normal form
    Hermite normal form is a canonical matrix form used in linear algebra and number theory to uniquely represent integer matrices and solve systems of linear Diophantine equations.
  • 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: Householder transformation
Triple: [Schmidt orthogonalization, relatedTo, Householder transformation]
Generated description
The Householder transformation is a linear algebra technique that uses reflections to orthogonally transform vectors and matrices, commonly employed in QR decomposition and numerical algorithms.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Householder transformation
Target entity description: The Householder transformation is a linear algebra technique that uses reflections to orthogonally transform vectors and matrices, commonly employed in QR decomposition and numerical algorithms.
  • A. Schmidt orthogonalization
    Schmidt orthogonalization is a mathematical procedure, also known as the Gram–Schmidt process, that converts a set of linearly independent vectors into an orthonormal set spanning the same subspace.
  • B. 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.
  • C. 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.
  • D. Walsh–Hadamard transform
    The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
  • E. Hermite normal form
    Hermite normal form is a canonical matrix form used in linear algebra and number theory to uniquely represent integer matrices and solve systems of linear Diophantine equations.
  • 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_69d86da422088190aac39e32e6c68429 completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e1555a1f008190bb3f03b0f35ed8a4 completed April 16, 2026, 9:32 p.m.
NED1 Entity disambiguation (via context triple) batch_69ffa14da7ac8190bbef49a1602a76fe completed May 9, 2026, 9:04 p.m.
NEDg Description generation batch_69ffa41b33cc819096553ee33b144d36 completed May 9, 2026, 9:16 p.m.
NED2 Entity disambiguation (via description) batch_69ffa4a168108190b6edf41830aa4cd0 completed May 9, 2026, 9:18 p.m.
Created at: April 10, 2026, 4:50 a.m.