Triple

T1031135
Position Surface form Disambiguated ID Type / Status
Subject Michael Sipser E22252 entity
Predicate hasWritten P2831 FINISHED
Object Introduction to the Theory of Computation E32458 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: Introduction to the Theory of Computation | Statement: [Michael Sipser, hasWritten, Introduction to the Theory of Computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Introduction to the Theory of Computation
Context triple: [Michael Sipser, hasWritten, Introduction to the Theory of Computation]
  • A. Introduction to the Theory of Computation chosen
    Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
  • B. P, NP, and NP-Completeness: The Basics of Complexity Theory
    "P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
  • C. Introduction to Algorithms
    Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
  • D. Computational Complexity: A Conceptual Perspective
    Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
  • E. Blum complexity measures
    Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
  • 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_69a493d848848190aed4011b34b2e8d3 completed March 1, 2026, 7:30 p.m.
NER Named-entity recognition batch_69a4b810429081908a97014ca740824b completed March 1, 2026, 10:05 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac4c15bb8481909ba68f5807581b18 completed March 7, 2026, 4:02 p.m.
Created at: March 1, 2026, 7:41 p.m.