Triple
T32789315
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Yuri Matiyasevich |
E838583
|
entity |
| Predicate | Matiyasevich’s theorem |
P38252
|
FINISHED |
| Object | states that every recursively enumerable set of natural numbers is Diophantine |
—
|
LITERAL 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: states that every recursively enumerable set of natural numbers is Diophantine | Statement: [Yuri Matiyasevich, Matiyasevich’s theorem, states that every recursively enumerable set of natural numbers is Diophantine]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: Matiyasevich’s theorem Context triple: [Yuri Matiyasevich, Matiyasevich’s theorem, states that every recursively enumerable set of natural numbers is Diophantine]
-
A.
provedUndecidableUsing
Indicates that the undecidability of one problem, theory, or statement was established by applying or reducing it to another specific method, result, or formal system.
-
B.
hasElementaryProof
Indicates that there exists a proof of the statement using only elementary methods, without relying on advanced or sophisticated theories.
-
C.
announcedMillenniumProblems
Indicates that an entity formally proclaimed or made public the set of Millennium Problems.
-
D.
yearFormulatedAsMillenniumProblem
Indicates the year in which a given problem was officially designated as one of the Millennium Prize Problems.
-
E.
hasTheorem
chosen
Indicates that one entity (typically a mathematical theory, field, or work) includes, establishes, or is associated with a particular theorem.
- F. None of above.
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_69f3493b83f48190be335cd42465cecf |
completed | April 30, 2026, 12:21 p.m. |
| NER | Named-entity recognition | batch_69f6ce6d659881909ddcec1d2966e020 |
completed | May 3, 2026, 4:26 a.m. |
| PD | Predicate disambiguation | batch_69f6cc1667a48190b42684f6ec22dae9 |
completed | May 3, 2026, 4:16 a.m. |
Created at: May 1, 2026, 1:14 a.m.