Triple

T15667156
Position Surface form Disambiguated ID Type / Status
Subject Christos H. Papadimitriou E377214 entity
Predicate notableWork P4 FINISHED
Object Elements of the Theory of Computation E677190 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: Elements of the Theory of Computation | Statement: [Christos H. Papadimitriou, notableWork, Elements of the Theory of Computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Elements of the Theory of Computation
Context triple: [Christos H. Papadimitriou, notableWork, Elements of the Theory of Computation]
  • A. Elements of the Theory of Computation chosen
    Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
  • B. Introduction to the Theory of Computation
    Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
  • C. Automata and Computability (textbook)
    Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
  • D. "Introduction to Automata Theory, Languages, and Computation"
    "Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
  • E. Outline of a Mathematical Theory of Computation
    Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
  • 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_69d85cd2e28481909d4e975bee20872f completed April 10, 2026, 2:13 a.m.
NER Named-entity recognition batch_69e04f1151548190a14607e762686cb1 completed April 16, 2026, 2:53 a.m.
NED1 Entity disambiguation (via context triple) batch_69ff67a22888819092ea521bbad7bcb7 completed May 9, 2026, 4:58 p.m.
Created at: April 10, 2026, 4:16 a.m.