Triple
T3111322
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gaspard Monge |
E64956
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Monge problem in optimal transport
The Monge problem in optimal transport is a foundational mathematical formulation that seeks the most efficient way to move mass from one distribution to another, minimizing a given transportation cost.
|
E326555
|
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: Monge problem in optimal transport | Statement: [Gaspard Monge, knownFor, Monge problem in optimal transport]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Monge problem in optimal transport Context triple: [Gaspard Monge, knownFor, Monge problem in optimal transport]
-
A.
Optimal Transport: Old and New
"Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
-
B.
Perelman’s entropy functionals
Perelman’s entropy functionals are analytic quantities introduced by Grigori Perelman to study the behavior and singularities of the Ricci flow, playing a central role in his proof of the Poincaré and geometrization conjectures.
-
C.
Carathéodory’s theorem in convex geometry
Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
-
D.
Méthodes de calcul différentiel absolu et leurs applications
Méthodes de calcul différentiel absolu et leurs applications is a foundational mathematical work that systematically develops the theory of tensor calculus and its applications, laying groundwork later used in general relativity.
-
E.
Grothendieck inequality
The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
- 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: Monge problem in optimal transport Triple: [Gaspard Monge, knownFor, Monge problem in optimal transport]
Generated description
The Monge problem in optimal transport is a foundational mathematical formulation that seeks the most efficient way to move mass from one distribution to another, minimizing a given transportation cost.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Monge problem in optimal transport Target entity description: The Monge problem in optimal transport is a foundational mathematical formulation that seeks the most efficient way to move mass from one distribution to another, minimizing a given transportation cost.
-
A.
Optimal Transport: Old and New
"Optimal Transport: Old and New" is a comprehensive monograph by Cédric Villani that develops the theory of optimal transport and its applications across analysis, geometry, and probability.
-
B.
Perelman’s entropy functionals
Perelman’s entropy functionals are analytic quantities introduced by Grigori Perelman to study the behavior and singularities of the Ricci flow, playing a central role in his proof of the Poincaré and geometrization conjectures.
-
C.
Carathéodory’s theorem in convex geometry
Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
-
D.
Méthodes de calcul différentiel absolu et leurs applications
Méthodes de calcul différentiel absolu et leurs applications is a foundational mathematical work that systematically develops the theory of tensor calculus and its applications, laying groundwork later used in general relativity.
-
E.
Grothendieck inequality
The Grothendieck inequality is a fundamental result in functional analysis and theoretical computer science that bounds certain bilinear forms and has deep implications for Banach space theory, operator theory, and approximation algorithms.
- 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_69ad857eeaf48190b34ebfdaa7a264cf |
completed | March 8, 2026, 2:19 p.m. |
| NER | Named-entity recognition | batch_69ada43954f0819096a96331bf3c53a8 |
completed | March 8, 2026, 4:30 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b20394a8cc8190b114760079f8b0f6 |
completed | March 12, 2026, 12:06 a.m. |
| NEDg | Description generation | batch_69b2043430548190a538c183aef44b44 |
completed | March 12, 2026, 12:09 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b204c812f081908fe5733305123c0e |
completed | March 12, 2026, 12:11 a.m. |
Created at: March 8, 2026, 3:04 p.m.