Triple

T9809893
Position Surface form Disambiguated ID Type / Status
Subject The Undecidable E238241 entity
Predicate hasPart P35 FINISHED
Object Turing’s paper on computable numbers and the Entscheidungsproblem E13826 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: Turing’s paper on computable numbers and the Entscheidungsproblem | Statement: [The Undecidable, hasPart, Turing’s paper on computable numbers and the Entscheidungsproblem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Turing’s paper on computable numbers and the Entscheidungsproblem
Context triple: [The Undecidable, hasPart, Turing’s paper on computable numbers and the Entscheidungsproblem]
  • A. On Computable Numbers with an Application to the Entscheidungsproblem chosen
    "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.
  • B. Computability and Unsolvability
    Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
  • C. Finite Automata and Their Decision Problems
    "Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
  • D. Computing Machinery and Intelligence
    "Computing Machinery and Intelligence" is Alan Turing’s landmark 1950 paper that introduced the Turing Test and fundamentally shaped the philosophical and technical foundations of artificial intelligence.
  • E. The Undecidable
    The Undecidable is a classic anthology edited by Martin Davis that collects foundational papers on computability, Gödel’s incompleteness theorems, and the limits of formal mathematical systems.
  • 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_69ca84defac48190abc1148804f184c1 completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdb220310c8190a16ca0b746f0ef7a completed April 2, 2026, 12:02 a.m.
NED1 Entity disambiguation (via context triple) batch_69d1cc5b4dd8819088c86946b4eb8a39 completed April 5, 2026, 2:43 a.m.
Created at: March 30, 2026, 8:29 p.m.