Triple
T5256296
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Carathéodory’s theorem in convex geometry |
E118706
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Minkowski’s theorem on convex sets
Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
|
E506850
|
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: Minkowski’s theorem on convex sets | Statement: [Carathéodory’s theorem in convex geometry, relatedTo, Minkowski’s theorem on convex sets]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Minkowski’s theorem on convex sets Context triple: [Carathéodory’s theorem in convex geometry, relatedTo, Minkowski’s theorem on convex sets]
-
A.
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.
-
B.
Hermite–Minkowski theorem
The Hermite–Minkowski theorem is a fundamental result in algebraic number theory that gives a finiteness bound on the number of number fields of a given degree and discriminant.
-
C.
Hilbert’s twenty-third problem
Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
-
D.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
E.
Gauss’s remarkable theorem
Gauss’s remarkable theorem is a fundamental result in differential geometry showing that the Gaussian curvature of a surface is an intrinsic property independent of how the surface is embedded in space.
- 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: Minkowski’s theorem on convex sets Triple: [Carathéodory’s theorem in convex geometry, relatedTo, Minkowski’s theorem on convex sets]
Generated description
Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Minkowski’s theorem on convex sets Target entity description: Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
-
A.
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.
-
B.
Hermite–Minkowski theorem
The Hermite–Minkowski theorem is a fundamental result in algebraic number theory that gives a finiteness bound on the number of number fields of a given degree and discriminant.
-
C.
Hilbert’s twenty-third problem
Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
-
D.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
E.
Gauss’s remarkable theorem
Gauss’s remarkable theorem is a fundamental result in differential geometry showing that the Gaussian curvature of a surface is an intrinsic property independent of how the surface is embedded in space.
- 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_69bd446978108190bb5f9c5c23d93f88 |
completed | March 20, 2026, 12:58 p.m. |
| NER | Named-entity recognition | batch_69bd7ba4ecd88190800b5e4eea3abed5 |
completed | March 20, 2026, 4:53 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69befe7a1f448190acfcdfe37c962028 |
completed | March 21, 2026, 8:24 p.m. |
| NEDg | Description generation | batch_69beff55faec8190a75a1b5f339a2c20 |
completed | March 21, 2026, 8:28 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69bf001f0d9c8190a67909a06ea41898 |
completed | March 21, 2026, 8:31 p.m. |
Created at: March 20, 2026, 1:50 p.m.