Triple
T11173121
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kenneth McMillan |
E264333
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Symbolic Model Checking: An Approach to the State Explosion Problem |
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: An Approach to the State Explosion Problem | Statement: [Kenneth McMillan, notableWork, Symbolic Model Checking: An Approach to the State Explosion Problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Symbolic Model Checking: An Approach to the State Explosion Problem Context triple: [Kenneth McMillan, notableWork, Symbolic Model Checking: An Approach to the State Explosion Problem]
-
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.
The Temporal Logic of Programs
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
D.
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.
-
E.
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.
- 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_69d6aa9dafac8190bd90d2c74f661aa7 |
completed | April 8, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69d7e89660208190b1d9e91529f5d246 |
completed | April 9, 2026, 5:57 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e463c03a948190b0f40f657180c9bf |
completed | April 19, 2026, 5:10 a.m. |
Created at: April 8, 2026, 9:29 p.m.