Triple

T15791298
Position Surface form Disambiguated ID Type / Status
Subject Pareto principle E382867 entity
Predicate alsoKnownAs P39 FINISHED
Object 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.
E1177336 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: principle of factor sparsity | Statement: [Pareto principle, alsoKnownAs, principle of factor sparsity]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: principle of factor sparsity
Context triple: [Pareto principle, alsoKnownAs, principle of factor sparsity]
  • A. Bayesian Occam factor
    The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
  • B. 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.
  • C. 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.
  • D. Stick-breaking construction for the Indian buffet process
    "Stick-breaking construction for the Indian buffet process" is a research paper by Yee-Whye Teh that introduces a stick-breaking representation for the Indian buffet process, providing a constructive and interpretable way to model infinite latent feature allocations in Bayesian nonparametrics.
  • E. On Mixture and Growth
    "On Mixture and Growth" is a philosophical treatise by Alexander of Aphrodisias that analyzes how physical substances combine and develop within an Aristotelian framework of matter and change.
  • 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: principle of factor sparsity
Triple: [Pareto principle, alsoKnownAs, principle of factor sparsity]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: principle of factor sparsity
Target entity description: 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.
  • A. Bayesian Occam factor
    The Bayesian Occam factor is a term in Bayesian model comparison that automatically penalizes overly complex models by integrating over their larger parameter spaces, thereby implementing Occam’s razor in probabilistic inference.
  • B. 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.
  • C. 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.
  • D. Stick-breaking construction for the Indian buffet process
    "Stick-breaking construction for the Indian buffet process" is a research paper by Yee-Whye Teh that introduces a stick-breaking representation for the Indian buffet process, providing a constructive and interpretable way to model infinite latent feature allocations in Bayesian nonparametrics.
  • E. On Mixture and Growth
    "On Mixture and Growth" is a philosophical treatise by Alexander of Aphrodisias that analyzes how physical substances combine and develop within an Aristotelian framework of matter and change.
  • 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_69d86da16e188190b89af699f1ed0bfe completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e0b4d819c881908bc43a6124a1bb2e completed April 16, 2026, 10:07 a.m.
NED1 Entity disambiguation (via context triple) batch_69ff90a87e3c8190a1c5b13cbfdff54a completed May 9, 2026, 7:53 p.m.
NEDg Description generation batch_69ff949339b88190bd105ffa0c169b54 completed May 9, 2026, 8:09 p.m.
NED2 Entity disambiguation (via description) batch_69ff950e053881908d207f4c172e2ea4 completed May 9, 2026, 8:11 p.m.
Created at: April 10, 2026, 4:48 a.m.