Triple
T1859185
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hilbert problems |
E41774
|
entity |
| Predicate | hasPart |
P35
|
FINISHED |
| Object | Hilbert’s eleventh problem |
E41774
|
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 eleventh problem | Statement: [Hilbert problems, hasPart, Hilbert’s eleventh problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hilbert’s eleventh problem Context triple: [Hilbert problems, hasPart, Hilbert’s eleventh problem]
-
A.
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.
-
B.
Fermat's theorem on sums of two squares
Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
-
C.
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.
-
D.
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.
-
E.
Hilbert’s fourteenth problem
Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
- 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_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_69addf4ecdc08190a264b358d3883f70 |
completed | March 8, 2026, 8:42 p.m. |
Created at: March 4, 2026, 7:33 p.m.