Triple
T10198008
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gerhard Gentzen |
E238811
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Die Widerspruchsfreiheit der reinen Zahlentheorie |
E761263
|
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: Die Widerspruchsfreiheit der reinen Zahlentheorie | Statement: [Gerhard Gentzen, notableWork, Die Widerspruchsfreiheit der reinen Zahlentheorie]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Die Widerspruchsfreiheit der reinen Zahlentheorie Context triple: [Gerhard Gentzen, notableWork, Die Widerspruchsfreiheit der reinen Zahlentheorie]
-
A.
Recherches sur la théorie de la démonstration
Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
-
B.
Gentzen’s consistency proof for arithmetic
chosen
Gentzen’s consistency proof for arithmetic is a landmark 1930s result in proof theory that established the consistency of Peano arithmetic using transfinite induction up to the ordinal ε₀.
-
C.
Arithmetices principia, nova methodo exposita
Arithmetices principia, nova methodo exposita is Giuseppe Peano’s foundational work in mathematical logic that presents an axiomatization of arithmetic using symbolic notation.
-
D.
Principles of Mathematical Logic
Principles of Mathematical Logic is a foundational work in mathematical logic by David Hilbert and Wilhelm Ackermann that systematically develops the formal underpinnings of logical reasoning and proof theory.
-
E.
Hilbert’s program
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.
- 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_69ca84e1ea088190b38162e43d4cfa8f |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdee3c44408190b09fa41f2d257c04 |
completed | April 2, 2026, 4:19 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d317e4a3308190b6ec4252bc55985d |
completed | April 6, 2026, 2:18 a.m. |
Created at: March 30, 2026, 9:13 p.m.