Triple
T7610524
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robin Milner |
E172222
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Calculus of Communicating Systems |
E230808
|
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: Calculus of Communicating Systems | Statement: [Robin Milner, notableWork, Calculus of Communicating Systems]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Calculus of Communicating Systems Context triple: [Robin Milner, notableWork, Calculus of Communicating Systems]
-
A.
CCS (Calculus of Communicating Systems)
chosen
CCS (Calculus of Communicating Systems) is a formal process calculus introduced by Robin Milner for modeling, specifying, and reasoning about concurrent, communicating systems in computer science.
-
B.
π-calculus
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
-
C.
The Calculus of Computation
The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
-
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.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
- 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_69c6994f50808190ba228764bb422417 |
completed | March 27, 2026, 2:50 p.m. |
| NER | Named-entity recognition | batch_69c6fa20ac2c8190ac7ab90b4df406b6 |
completed | March 27, 2026, 9:44 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c868600c7c81909cdeebdb5b2bdaf3 |
completed | March 28, 2026, 11:46 p.m. |
Created at: March 27, 2026, 3:54 p.m.