Triple

T17035304
Position Surface form Disambiguated ID Type / Status
Subject Tucker decomposition E413306 entity
Predicate relatedTo P37 FINISHED
Object 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.
E1245791 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: CP decomposition | Statement: [Tucker decomposition, relatedTo, CP decomposition]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: CP decomposition
Context triple: [Tucker decomposition, relatedTo, CP decomposition]
  • A. 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.
  • B. 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.
  • C. SVD
    SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
  • D. Schmidt decomposition
    The Schmidt decomposition is a mathematical technique in functional analysis and quantum information theory that expresses a bipartite vector (such as a quantum state) as a sum of orthogonal product states with nonnegative coefficients, revealing its entanglement structure.
  • E. Fitting decomposition
    Fitting decomposition is a fundamental theorem in group theory that expresses a finite group as a product of its largest nilpotent normal subgroup and a complementary subgroup, playing a key role in the structural analysis of groups.
  • 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: CP decomposition
Triple: [Tucker decomposition, relatedTo, CP decomposition]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: CP decomposition
Target entity description: 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.
  • A. 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.
  • B. 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.
  • C. SVD
    SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
  • D. Schmidt decomposition
    The Schmidt decomposition is a mathematical technique in functional analysis and quantum information theory that expresses a bipartite vector (such as a quantum state) as a sum of orthogonal product states with nonnegative coefficients, revealing its entanglement structure.
  • E. Fitting decomposition
    Fitting decomposition is a fundamental theorem in group theory that expresses a finite group as a product of its largest nilpotent normal subgroup and a complementary subgroup, playing a key role in the structural analysis of groups.
  • 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_69d886cd18288190b006abab23f811b7 completed April 10, 2026, 5:12 a.m.
NER Named-entity recognition batch_69e3d8f05824819091d2aa02e5591e26 completed April 18, 2026, 7:18 p.m.
NED1 Entity disambiguation (via context triple) batch_6a011b59ad3c8190914ee6f8c903cbbf completed May 10, 2026, 11:57 p.m.
NEDg Description generation batch_6a011c13076c8190970abfb0e2d3a13c completed May 11, 2026, midnight
NED2 Entity disambiguation (via description) batch_6a011c8afb608190b51c7a4c9ccaa0a5 completed May 11, 2026, 12:02 a.m.
Created at: April 10, 2026, 5:33 a.m.