Triple

T7666080
Position Surface form Disambiguated ID Type / Status
Subject NP-completeness E173625 entity
Predicate centralReference P16051 FINISHED
Object Sipser: 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: Sipser: Introduction to the Theory of Computation | Statement: [NP-completeness, centralReference, Sipser: Introduction to the Theory of Computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Sipser: Introduction to the Theory of Computation
Context triple: [NP-completeness, centralReference, Sipser: 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. Elements of the Theory of Computation
    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.
  • C. "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.
  • D. 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.
  • E. 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.
  • 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_69c699562484819086752091e3164a27 completed March 27, 2026, 2:51 p.m.
NER Named-entity recognition batch_69c708affd048190bf21bcc1796a3c39 completed March 27, 2026, 10:46 p.m.
NED1 Entity disambiguation (via context triple) batch_69c89b1fdccc8190a69b4745dc3b2347 completed March 29, 2026, 3:23 a.m.
Created at: March 27, 2026, 4 p.m.