Triple

T21953628
Position Surface form Disambiguated ID Type / Status
Subject Iwasawa decomposition E542127 entity
Predicate alsoKnownAs P39 FINISHED
Object KAN decomposition
KAN decomposition is a factorization of a semisimple Lie group into the product of a maximal compact subgroup, a maximal abelian subgroup, and a nilpotent subgroup, fundamental in Lie theory and harmonic analysis.
E1510874 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: KAN decomposition | Statement: [Iwasawa decomposition, alsoKnownAs, KAN decomposition]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: KAN decomposition
Context triple: [Iwasawa decomposition, alsoKnownAs, KAN decomposition]
  • A. CP decomposition
    CP decomposition (CANDECOMP/PARAFAC) is a tensor factorization method that expresses a multi-way array as a sum of rank-one components, widely used for data analysis in fields like signal processing, chemometrics, and machine learning.
  • B. Singular value decomposition
    Singular value decomposition is a fundamental matrix factorization technique that expresses a matrix as the product of two orthogonal (or unitary) matrices and a diagonal matrix of singular values, widely used in numerical analysis, data compression, and dimensionality reduction.
  • C. Schur decomposition
    Schur decomposition is a matrix factorization in linear algebra that expresses a square matrix as a unitary (or orthogonal) matrix times an upper triangular matrix times the inverse of the unitary matrix, revealing its eigenvalues and simplifying many numerical computations.
  • D. Tucker decomposition in multilinear algebra
    Tucker decomposition in multilinear algebra is a form of higher-order principal component analysis that factorizes a tensor into a core tensor multiplied by factor matrices along each mode, enabling dimensionality reduction and structure discovery in multiway data.
  • E. Decomposition
    Decomposition is a short story from David Benioff’s collection "When the Nines Roll Over," exploring themes of decay, change, and the unraveling of personal or artistic integrity.
  • 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: KAN decomposition
Triple: [Iwasawa decomposition, alsoKnownAs, KAN decomposition]
Generated description
KAN decomposition is a factorization of a semisimple Lie group into the product of a maximal compact subgroup, a maximal abelian subgroup, and a nilpotent subgroup, fundamental in Lie theory and harmonic analysis.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: KAN decomposition
Target entity description: KAN decomposition is a factorization of a semisimple Lie group into the product of a maximal compact subgroup, a maximal abelian subgroup, and a nilpotent subgroup, fundamental in Lie theory and harmonic analysis.
  • A. CP decomposition
    CP decomposition (CANDECOMP/PARAFAC) is a tensor factorization method that expresses a multi-way array as a sum of rank-one components, widely used for data analysis in fields like signal processing, chemometrics, and machine learning.
  • B. Singular value decomposition
    Singular value decomposition is a fundamental matrix factorization technique that expresses a matrix as the product of two orthogonal (or unitary) matrices and a diagonal matrix of singular values, widely used in numerical analysis, data compression, and dimensionality reduction.
  • C. Schur decomposition
    Schur decomposition is a matrix factorization in linear algebra that expresses a square matrix as a unitary (or orthogonal) matrix times an upper triangular matrix times the inverse of the unitary matrix, revealing its eigenvalues and simplifying many numerical computations.
  • D. Tucker decomposition in multilinear algebra
    Tucker decomposition in multilinear algebra is a form of higher-order principal component analysis that factorizes a tensor into a core tensor multiplied by factor matrices along each mode, enabling dimensionality reduction and structure discovery in multiway data.
  • E. Decomposition
    Decomposition is a short story from David Benioff’s collection "When the Nines Roll Over," exploring themes of decay, change, and the unraveling of personal or artistic integrity.
  • 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_69e0c47ef0e48190a50e1bcc43f4b3fd completed April 16, 2026, 11:14 a.m.
NER Named-entity recognition batch_69f1243dfb4081909bc7a722843ffea7 completed April 28, 2026, 9:18 p.m.
NED1 Entity disambiguation (via context triple) batch_6a0a670672b481908b92e15245212e64 completed May 18, 2026, 1:10 a.m.
NEDg Description generation batch_6a0a67c29848819080860f13b4c9697b completed May 18, 2026, 1:13 a.m.
NED2 Entity disambiguation (via description) batch_6a0a686a0f208190977890119ffcff79 completed May 18, 2026, 1:16 a.m.
Created at: April 16, 2026, 7:59 p.m.