Triple
T11426275
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Arthur John Robin Gorell Milner |
E270757
|
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: [Arthur John Robin Gorell 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: [Arthur John Robin Gorell 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.
Compositional model checking
Compositional model checking is a formal verification technique that proves system correctness by analyzing components separately and then combining the results, enabling scalable verification of complex systems.
-
D.
concurrency theory
Concurrency theory is a branch of theoretical computer science that studies the behavior, interaction, and formal modeling of systems with multiple components executing simultaneously.
-
E.
spi-calculus
Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
- 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_69d6aadeef688190874bcecd88b3dd9b |
completed | April 8, 2026, 7:22 p.m. |
| NER | Named-entity recognition | batch_69d806c000b88190bfaa646b2dc424b7 |
completed | April 9, 2026, 8:06 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e5b8c8e1988190aba5a2536dbb37cf |
completed | April 20, 2026, 5:25 a.m. |
Created at: April 8, 2026, 9:35 p.m.