Triple
T1859184
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hilbert problems |
E41774
|
entity |
| Predicate | hasPart |
P35
|
FINISHED |
| Object |
Hilbert’s tenth problem
Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
|
E208849
|
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 tenth problem | Statement: [Hilbert problems, hasPart, Hilbert’s tenth problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hilbert’s tenth problem Context triple: [Hilbert problems, hasPart, Hilbert’s tenth problem]
-
A.
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.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Hilbert’s irreducibility theorem
Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
-
D.
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.
-
E.
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.
- 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 tenth problem Triple: [Hilbert problems, hasPart, Hilbert’s tenth problem]
Generated description
Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hilbert’s tenth problem Target entity description: Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
-
A.
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.
-
B.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
C.
Hilbert’s irreducibility theorem
Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
-
D.
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.
-
E.
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.
- F. None of above. chosen
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.