Triple
T7030806
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Diophantine approximation |
E163264
|
entity |
| Predicate | hasKeyResult |
P70725
|
FINISHED |
| Object | Minkowski convex body theorem |
E506850
|
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: Minkowski convex body theorem | Statement: [Diophantine approximation, hasKeyResult, Minkowski convex body theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Minkowski convex body theorem Context triple: [Diophantine approximation, hasKeyResult, Minkowski convex body theorem]
-
A.
Minkowski’s theorem on convex sets
chosen
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.
-
B.
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.
-
C.
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.
-
D.
Helly’s theorem
Helly’s theorem is a fundamental result in convex geometry that gives conditions under which a family of convex sets in Euclidean space has a nonempty common intersection.
-
E.
Krein–Milman theorem
The Krein–Milman theorem is a fundamental result in functional analysis and convex geometry stating that a compact convex set in a locally convex topological vector space is the closed convex hull of its extreme points.
- 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_69c6885d691c81908cf7d31083113886 |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6e20ee1208190811be10a84e7d8a4 |
completed | March 27, 2026, 8:01 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c775980920819081d31b8d2843fb3d |
completed | March 28, 2026, 6:30 a.m. |
Created at: March 27, 2026, 2:35 p.m.