Triple
T17035300
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tucker decomposition |
E413306
|
entity |
| Predicate | alsoKnownAs |
P39
|
FINISHED |
| Object | Tucker factorization |
E413306
|
NE FINISHED |
How this triple was built (2 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: Tucker factorization | Statement: [Tucker decomposition, alsoKnownAs, Tucker factorization]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Tucker factorization Context triple: [Tucker decomposition, alsoKnownAs, Tucker factorization]
-
A.
Tucker decomposition in multilinear algebra
chosen
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.
principle of factor sparsity
The principle of factor sparsity is the idea that in many systems a small number of factors account for most of the effects or outcomes, while the majority of factors have only minor impact.
-
C.
Kailath factorization in linear systems
Kailath factorization in linear systems is a matrix factorization technique used in control and signal processing to efficiently analyze and solve linear dynamical systems.
-
D.
Pisier’s factorization theorems
Pisier’s factorization theorems are fundamental results in functional analysis and operator theory that provide deep factorization properties for linear and multilinear operators on Banach spaces, extending and refining ideas related to Grothendieck-type inequalities.
-
E.
Toeplitz matrices
Toeplitz matrices are structured matrices whose entries are constant along each diagonal, playing a central role in operator theory, numerical analysis, and signal processing.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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. |
Created at: April 10, 2026, 5:33 a.m.