Triple

T6082255
Position Surface form Disambiguated ID Type / Status
Subject Jeffrey D. Ullman E135550 entity
Predicate notableWork P4 FINISHED
Object Introduction to Automata Theory, Languages, and Computation E305925 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 Automata Theory, Languages, and Computation | Statement: [Jeffrey D. Ullman, notableWork, Introduction to Automata Theory, Languages, and Computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Introduction to Automata Theory, Languages, and Computation
Context triple: [Jeffrey D. Ullman, notableWork, Introduction to Automata Theory, Languages, and Computation]
  • A. "Introduction to Automata Theory, Languages, and Computation" chosen
    "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.
  • 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. Compilers: Principles, Techniques, and Tools
    Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
  • 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. Chomsky hierarchy
    The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language 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_69c0087ad31c8190ab936e0ff28614b6 completed March 22, 2026, 3:19 p.m.
NER Named-entity recognition batch_69c05774bc948190a446b27e83f7079b completed March 22, 2026, 8:56 p.m.
NED1 Entity disambiguation (via context triple) batch_69c11d57b5f481908d7df374837a486a completed March 23, 2026, 11 a.m.
Created at: March 22, 2026, 4:11 p.m.