Triple
T326995
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David Hilbert |
E6540
|
entity |
| Predicate | notableIdea |
P4
|
FINISHED |
| Object | Hilbert’s program in proof theory |
E41775
|
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 program in proof theory | Statement: [David Hilbert, notableIdea, Hilbert’s program in proof theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hilbert’s program in proof theory Context triple: [David Hilbert, notableIdea, Hilbert’s program in proof theory]
-
A.
Hilbert’s program
chosen
Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
-
B.
Frege’s system in "Grundgesetze der Arithmetik"
Frege’s system in "Grundgesetze der Arithmetik" is a foundational logical framework for arithmetic based on second-order logic and Basic Law V, whose inconsistency—revealed by Russell’s paradox—marked a turning point in the development of modern logic and set theory.
-
C.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
D.
The Mathematical Analysis of Logic
The Mathematical Analysis of Logic is George Boole’s pioneering 1847 work that laid the foundations of symbolic logic and helped initiate the algebraic treatment of logical reasoning.
-
E.
Principia Mathematica
Principia Mathematica is a landmark three-volume work in mathematical logic and the foundations of mathematics, co-authored by Bertrand Russell and Alfred North Whitehead, which aimed to derive all mathematical truths from a formal system of symbolic logic.
- 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_69a2e7933d6c8190bb2592ad13286ef2 |
completed | Feb. 28, 2026, 1:03 p.m. |
| NER | Named-entity recognition | batch_69a2ea974d8481908c7d84f72a7728b6 |
completed | Feb. 28, 2026, 1:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a3d241f924819087dedd32d7b6cc2b |
completed | March 1, 2026, 5:44 a.m. |
Created at: Feb. 28, 2026, 1:08 p.m.