Triple
T11215105
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dehn invariant |
E265415
|
entity |
| Predicate | solves |
P14252
|
FINISHED |
| Object | Hilbert's third problem |
E911228
|
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: Hilbert's third problem | Statement: [Dehn invariant, solves, Hilbert's third problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hilbert's third problem Context triple: [Dehn invariant, solves, Hilbert's third problem]
-
A.
Hilbert's third problem
chosen
Hilbert's third problem is one of David Hilbert’s famous list of 23 problems, asking whether every polyhedron of a given volume is equidecomposable with any other of the same volume, a question that led to the development of the Dehn invariant and the discovery of counterexamples.
-
B.
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.
-
C.
Dehn invariant
The Dehn invariant is a mathematical quantity in geometry that helps determine whether two polyhedra are scissors-congruent, playing a key role in the solution of Hilbert’s third problem.
-
D.
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.
-
E.
Banach–Tarski paradox
The Banach–Tarski paradox is a theorem in set-theoretic geometry stating that a solid ball in 3‑dimensional space can be decomposed into finitely many non-measurable pieces and reassembled into two identical copies of the original ball, highlighting counterintuitive consequences of the axiom of choice.
- 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_69d6aac59460819089b9848b27f57848 |
completed | April 8, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69d7e8e8eef48190932a85784ce15c86 |
completed | April 9, 2026, 5:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e4ad1c57908190a5c65ea4738722e3 |
completed | April 19, 2026, 10:23 a.m. |
Created at: April 8, 2026, 9:30 p.m.