Triple
T7743594
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Navier–Stokes existence and smoothness problem |
E175568
|
entity |
| Predicate | listedIn |
P1278
|
FINISHED |
| Object | Clay Millennium Problems |
E32278
|
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: Clay Millennium Problems | Statement: [Navier–Stokes existence and smoothness problem, listedIn, Clay Millennium Problems]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Clay Millennium Problems Context triple: [Navier–Stokes existence and smoothness problem, listedIn, Clay Millennium Problems]
-
A.
Millennium Prize Problem
chosen
The Millennium Prize Problem is one of seven famous unsolved mathematical problems designated by the Clay Mathematics Institute, each carrying a $1 million reward for a correct solution.
-
B.
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.
-
C.
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.
-
D.
P versus NP problem
The P versus NP problem is a central unsolved question in theoretical computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
-
E.
The Great Mathematical Problems
The Great Mathematical Problems is a popular mathematics book by Ian Stewart that explores some of the most famous unsolved and historically significant problems in mathematics for a general audience.
- 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_69c6995f9c60819092e386192bd63c6f |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c70388d58081909aad2c03b4501e78 |
completed | March 27, 2026, 10:24 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8be48d61c8190aba1e5f23d7cb1be |
completed | March 29, 2026, 5:53 a.m. |
Created at: March 27, 2026, 4:07 p.m.