Triple

T22895431
Position Surface form Disambiguated ID Type / Status
Subject Hero of Alexandria E568160 entity
Predicate notableWork P4 FINISHED
Object Automata
Automata is an ancient Greek treatise by Hero of Alexandria that describes self-operating mechanical devices and early forms of automation.
 E1560598 NE FINISHED

How this triple was built (4 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: Automata | Statement: [Hero of Alexandria, notableWork, Automata]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Automata
Context triple: [Hero of Alexandria, notableWork, Automata]
  • A. Büchi automata
    Büchi automata are a type of ω-automaton used to recognize languages of infinite words, playing a central role in the automata-theoretic approach to model checking and the semantics of linear temporal logic.
  • B. 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.
  • C. Automata Theory
    Automata Theory is a branch of theoretical computer science that studies abstract computational models and the problems they can solve, forming a foundation for formal languages, compilers, and complexity theory.
  • 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. 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.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Automata
Triple: [Hero of Alexandria, notableWork, Automata]
Generated description
Automata is an ancient Greek treatise by Hero of Alexandria that describes self-operating mechanical devices and early forms of automation.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Automata
Target entity description: Automata is an ancient Greek treatise by Hero of Alexandria that describes self-operating mechanical devices and early forms of automation.
  • A. Büchi automata
    Büchi automata are a type of ω-automaton used to recognize languages of infinite words, playing a central role in the automata-theoretic approach to model checking and the semantics of linear temporal logic.
  • B. 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.
  • C. Automata Theory
    Automata Theory is a branch of theoretical computer science that studies abstract computational models and the problems they can solve, forming a foundation for formal languages, compilers, and complexity theory.
  • 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. 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.
  • F. None of above. chosen

Provenance (5 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_69e2458c23ec81908fa2570692c6614f completed April 17, 2026, 2:37 p.m.
NER Named-entity recognition batch_69f1801212808190b6471764d6c0b264 completed April 29, 2026, 3:50 a.m.
NED1 Entity disambiguation (via context triple) batch_6a0bb9c59acc819090353ecaddac1624 completed May 19, 2026, 1:15 a.m.
NEDg Description generation batch_6a0bbbf1fdb4819082a721c75958eaa1 completed May 19, 2026, 1:25 a.m.
NED2 Entity disambiguation (via description) batch_6a0bbcaee9508190aa5c84a8930e15cd completed May 19, 2026, 1:28 a.m.
Created at: April 17, 2026, 3:40 p.m.