Triple
T2092419
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Robin Milner |
E32698
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | A 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: A Calculus of Communicating Systems | Statement: [Robin Milner, notableWork, A Calculus of Communicating Systems]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: A Calculus of Communicating Systems Context triple: [Robin Milner, notableWork, A 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.
CSP (Communicating Sequential Processes)
CSP (Communicating Sequential Processes) is a formal model for describing and analyzing concurrent systems based on independent processes that interact solely through message-passing communication.
-
D.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
E.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
- 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_69a885eba0708190999696a45cbec816 |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69abba774ca881909f83cf65ffeb24bb |
completed | March 7, 2026, 5:41 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae305aacc08190904a358fc4207075 |
completed | March 9, 2026, 2:28 a.m. |
Created at: March 4, 2026, 7:43 p.m.