Triple

T1255237
Position Surface form Disambiguated ID Type / Status
Subject Church–Turing thesis E26972 entity
Predicate relatedTo P37 FINISHED
Object Hilbert’s Entscheidungsproblem E87086 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 Entscheidungsproblem | Statement: [Church–Turing thesis, relatedTo, Hilbert’s Entscheidungsproblem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Hilbert’s Entscheidungsproblem
Context triple: [Church–Turing thesis, relatedTo, Hilbert’s Entscheidungsproblem]
  • A. Entscheidungsproblem chosen
    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 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.
  • C. On Computable Numbers with an Application to the Entscheidungsproblem
    "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
  • D. 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.
  • 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_69a49487a9c48190ba9b05348fd1b53f completed March 1, 2026, 7:33 p.m.
NER Named-entity recognition batch_69a4bfa5a4cc819093ed686619b572d8 completed March 1, 2026, 10:37 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac93cb76248190a23acb2e76ecfa8d completed March 7, 2026, 9:08 p.m.
Created at: March 1, 2026, 7:47 p.m.