Triple

T10197190
Position Surface form Disambiguated ID Type / Status
Subject Thomas A. Henzinger E238791 entity
Predicate knownFor P22 FINISHED
Object hybrid automata
Hybrid automata are mathematical models used in computer science and control theory to describe systems that exhibit both continuous dynamics and discrete transitions, such as embedded or cyber-physical systems.
E846884 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: hybrid automata | Statement: [Thomas A. Henzinger, knownFor, hybrid automata]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: hybrid automata
Context triple: [Thomas A. Henzinger, knownFor, hybrid automata]
  • A. Symbolic Model Checking
    Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
  • B. Model Checking (book)
    "Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
  • C. Temporal Verification of Reactive Systems
    "Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
  • D. PRISM probabilistic model checker
    PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.
  • E. Dynamic Systems and Control Division
    The Dynamic Systems and Control Division is a technical division of the American Society of Mechanical Engineers focused on the modeling, analysis, and control of dynamic engineering systems.
  • 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: hybrid automata
Triple: [Thomas A. Henzinger, knownFor, hybrid automata]
Generated description
Hybrid automata are mathematical models used in computer science and control theory to describe systems that exhibit both continuous dynamics and discrete transitions, such as embedded or cyber-physical systems.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: hybrid automata
Target entity description: Hybrid automata are mathematical models used in computer science and control theory to describe systems that exhibit both continuous dynamics and discrete transitions, such as embedded or cyber-physical systems.
  • A. Symbolic Model Checking
    Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
  • B. Model Checking (book)
    "Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
  • C. Temporal Verification of Reactive Systems
    "Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
  • D. PRISM probabilistic model checker
    PRISM probabilistic model checker is a formal verification tool used to model, analyze, and verify systems that exhibit probabilistic behavior, such as randomized algorithms and communication or security protocols.
  • E. Dynamic Systems and Control Division
    The Dynamic Systems and Control Division is a technical division of the American Society of Mechanical Engineers focused on the modeling, analysis, and control of dynamic engineering systems.
  • 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_69ca84e1ea088190b38162e43d4cfa8f completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdedcaf6688190938d8e56e29493eb completed April 2, 2026, 4:17 a.m.
NED1 Entity disambiguation (via context triple) batch_69d317e4a3308190b6ec4252bc55985d completed April 6, 2026, 2:18 a.m.
NEDg Description generation batch_69d31a2a050081908e5b3a14cf02d227 completed April 6, 2026, 2:27 a.m.
NED2 Entity disambiguation (via description) batch_69d31acf46008190b6bf1b111e13bfe9 completed April 6, 2026, 2:30 a.m.
Created at: March 30, 2026, 9:13 p.m.