Triple
T18491561
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Euclidean geometry |
E451827
|
entity |
| Predicate | formalizedBy |
P8407
|
FINISHED |
| Object | Hilbert's axioms |
—
|
NE NERFINISHED |
How this triple was built (3 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 axioms | Statement: [Euclidean geometry, formalizedBy, Hilbert's axioms]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hilbert's axioms Context triple: [Euclidean geometry, formalizedBy, Hilbert's axioms]
-
A.
Euclid's postulates
Euclid's postulates are the foundational axioms of classical Euclidean geometry, defining basic properties of points, lines, and planes from which the rest of the geometry is logically derived.
-
B.
The Foundations of Geometry
The Foundations of Geometry is a seminal mathematical text by Oswald Veblen that rigorously develops the axiomatic basis of geometry in a modern, logical framework.
-
C.
Playfair's axiom
Playfair's axiom is a reformulation of Euclid’s parallel postulate stating that through a point not on a given line there is exactly one line parallel to the given line, fundamental to Euclidean geometry.
-
D.
Veblen axioms for projective geometry
The Veblen axioms for projective geometry are a foundational set of incidence-based axioms introduced by Oswald Veblen to rigorously formalize the structure of projective spaces.
-
E.
Tarski’s theorem on the completeness of elementary algebra and geometry
Tarski’s theorem on the completeness of elementary algebra and geometry is a foundational result in mathematical logic showing that the first-order theory of real closed fields (capturing elementary algebra and Euclidean geometry) is complete, decidable, and admits quantifier elimination.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hilbert's axioms Target entity description: Hilbert's axioms are a rigorous, foundational set of logical assumptions introduced by David Hilbert to provide a complete and consistent basis for Euclidean geometry.
-
A.
Euclid's postulates
Euclid's postulates are the foundational axioms of classical Euclidean geometry, defining basic properties of points, lines, and planes from which the rest of the geometry is logically derived.
-
B.
The Foundations of Geometry
The Foundations of Geometry is a seminal mathematical text by Oswald Veblen that rigorously develops the axiomatic basis of geometry in a modern, logical framework.
-
C.
Playfair's axiom
Playfair's axiom is a reformulation of Euclid’s parallel postulate stating that through a point not on a given line there is exactly one line parallel to the given line, fundamental to Euclidean geometry.
-
D.
Veblen axioms for projective geometry
The Veblen axioms for projective geometry are a foundational set of incidence-based axioms introduced by Oswald Veblen to rigorously formalize the structure of projective spaces.
-
E.
Tarski’s theorem on the completeness of elementary algebra and geometry
Tarski’s theorem on the completeness of elementary algebra and geometry is a foundational result in mathematical logic showing that the first-order theory of real closed fields (capturing elementary algebra and Euclidean geometry) is complete, decidable, and admits quantifier elimination.
- F. None of above. chosen
Provenance (2 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_69d8d3855d50819097fc8561b0299dd9 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e531dcac3c8190b2ebd129ca7f368d |
completed | April 19, 2026, 7:49 p.m. |
Created at: April 10, 2026, 11:35 a.m.