Triple

T10709442
Position Surface form Disambiguated ID Type / Status
Subject Oded Maler E252492 entity
Predicate coAuthorOf P2389 FINISHED
Object On reachability of hybrid automata
"On reachability of hybrid automata" is a foundational research paper in formal verification and hybrid systems theory that investigates algorithmic methods for determining whether certain states can be reached in systems combining discrete and continuous dynamics.
E881564 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: On reachability of hybrid automata | Statement: [Oded Maler, coAuthorOf, On reachability of hybrid automata]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: On reachability of hybrid automata
Context triple: [Oded Maler, coAuthorOf, On reachability of hybrid automata]
  • A. From timed automata to hybrid systems
    "From timed automata to hybrid systems" is a scholarly work that explores the extension of timed automata models to more general hybrid systems, integrating discrete and continuous dynamics in system verification and modeling.
  • B. 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.
  • C. As soon as possible: Time optimal control for timed automata
    "As soon as possible: Time optimal control for timed automata" is a research paper in formal methods and control theory that studies how to synthesize strategies achieving time-optimal behavior in systems modeled by timed automata.
  • D. 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.
  • E. 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.
  • 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: On reachability of hybrid automata
Triple: [Oded Maler, coAuthorOf, On reachability of hybrid automata]
Generated description
"On reachability of hybrid automata" is a foundational research paper in formal verification and hybrid systems theory that investigates algorithmic methods for determining whether certain states can be reached in systems combining discrete and continuous dynamics.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: On reachability of hybrid automata
Target entity description: "On reachability of hybrid automata" is a foundational research paper in formal verification and hybrid systems theory that investigates algorithmic methods for determining whether certain states can be reached in systems combining discrete and continuous dynamics.
  • A. From timed automata to hybrid systems
    "From timed automata to hybrid systems" is a scholarly work that explores the extension of timed automata models to more general hybrid systems, integrating discrete and continuous dynamics in system verification and modeling.
  • B. 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.
  • C. As soon as possible: Time optimal control for timed automata
    "As soon as possible: Time optimal control for timed automata" is a research paper in formal methods and control theory that studies how to synthesize strategies achieving time-optimal behavior in systems modeled by timed automata.
  • D. 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.
  • E. 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.
  • 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_69d6aa5cbabc8190973e683950d89faf completed April 8, 2026, 7:19 p.m.
NER Named-entity recognition batch_69d6fe515b1081909532a20b61ff6cf0 completed April 9, 2026, 1:18 a.m.
NED1 Entity disambiguation (via context triple) batch_69dbad1ac3948190a97ab52fa9d962ad completed April 12, 2026, 2:32 p.m.
NEDg Description generation batch_69dbaeb211088190a9118c71918584e5 completed April 12, 2026, 2:39 p.m.
NED2 Entity disambiguation (via description) batch_69dbaf7c999c819097a8cdf5bd82f648 completed April 12, 2026, 2:43 p.m.
Created at: April 8, 2026, 9:13 p.m.