Triple
T9838579
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Edmund M. Clarke |
E239162
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Symbolic Model Checking (paper) |
E239161
|
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: Symbolic Model Checking (paper) | Statement: [Edmund M. Clarke, notableWork, Symbolic Model Checking (paper)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Symbolic Model Checking (paper) Context triple: [Edmund M. Clarke, notableWork, Symbolic Model Checking (paper)]
-
A.
Symbolic Model Checking
chosen
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.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
- 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_69ca84e314108190978324a4bdb959f8 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1e429682c8190a94339b96d4081f6 |
completed | April 5, 2026, 4:25 a.m. |
Created at: March 30, 2026, 8:33 p.m.