Triple

T1523324
Position Surface form Disambiguated ID Type / Status
Subject Millennium Prize Problem E32278 entity
Predicate hasProblem P9106 FINISHED
Object Navier–Stokes existence and smoothness problem E5106 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: Navier–Stokes existence and smoothness problem | Statement: [Millennium Prize Problem, hasProblem, Navier–Stokes existence and smoothness problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Navier–Stokes existence and smoothness problem
Context triple: [Millennium Prize Problem, hasProblem, Navier–Stokes existence and smoothness problem]
  • A. 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.
  • B. Navier–Stokes equations chosen
    The Navier–Stokes equations are fundamental partial differential equations in fluid mechanics that describe how the velocity field of a fluid evolves under forces like pressure and viscosity.
  • C. Millennium Prize Problem
    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.
  • 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. 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.
  • 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_69a885e9b0ac819093a9806ad0efc82c completed March 4, 2026, 7:20 p.m.
NER Named-entity recognition batch_69aa61dc6ab881908b22aa7a5295bf21 completed March 6, 2026, 5:10 a.m.
NED1 Entity disambiguation (via context triple) batch_69ad294f9e2481909f1d685d7f083c6a completed March 8, 2026, 7:46 a.m.
Created at: March 4, 2026, 7:26 p.m.