Triple
T1859175
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hilbert problems |
E41774
|
entity |
| Predicate | hasPart |
P35
|
FINISHED |
| Object |
Hilbert’s first problem
Hilbert’s first problem is a famous mathematical question posed by David Hilbert in 1900 that asks whether the continuum hypothesis can be proved or disproved from the standard axioms of set theory.
|
E41774
|
NE FINISHED |
How this triple was built (4 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 first problem | Statement: [Hilbert problems, hasPart, Hilbert’s first problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hilbert’s first problem Context triple: [Hilbert problems, hasPart, Hilbert’s first problem]
-
A.
Hilbert problems
The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
-
B.
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.
-
C.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
D.
Poincaré conjecture
The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
-
E.
Kronecker’s finitism
Kronecker’s finitism is a philosophical and mathematical stance asserting that only finite, constructible mathematical objects and proofs are legitimate, rejecting the existence of actual infinities.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Hilbert’s first problem Triple: [Hilbert problems, hasPart, Hilbert’s first problem]
Generated description
Hilbert’s first problem is a famous mathematical question posed by David Hilbert in 1900 that asks whether the continuum hypothesis can be proved or disproved from the standard axioms of set theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hilbert’s first problem Target entity description: Hilbert’s first problem is a famous mathematical question posed by David Hilbert in 1900 that asks whether the continuum hypothesis can be proved or disproved from the standard axioms of set theory.
-
A.
Hilbert problems
chosen
The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
-
B.
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.
-
C.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
-
D.
Poincaré conjecture
The Poincaré conjecture is a landmark problem in topology that characterizes the three-dimensional sphere among three-dimensional manifolds and was famously solved by Grigori Perelman in the early 2000s.
-
E.
Kronecker’s finitism
Kronecker’s finitism is a philosophical and mathematical stance asserting that only finite, constructible mathematical objects and proofs are legitimate, rejecting the existence of actual infinities.
- F. None of above.
Provenance (5 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_69a8864a83848190a4ec02721306c511 |
completed | March 4, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69abb0829f1481908d2b389d20827417 |
completed | March 7, 2026, 4:58 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69add1ce296c819093336cbaa257dfd2 |
completed | March 8, 2026, 7:45 p.m. |
| NEDg | Description generation | batch_69add229de448190826bbb668c7611a0 |
completed | March 8, 2026, 7:46 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69add29e3c50819098ff87d254c25c45 |
completed | March 8, 2026, 7:48 p.m. |
Created at: March 4, 2026, 7:33 p.m.