Triple
T9566845
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | π-calculus |
E230807
|
entity |
| Predicate | notablePublication |
P4
|
FINISHED |
| Object | Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes" |
E230807
|
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: Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes" | Statement: [π-calculus, notablePublication, Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes"]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes" Context triple: [π-calculus, notablePublication, Robin Milner, Joachim Parrow, David Walker: "A Calculus of Mobile Processes"]
-
A.
CCS (Calculus of Communicating Systems)
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
chosen
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
-
C.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
D.
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.
-
E.
Luca Cardelli
Luca Cardelli is an Italian computer scientist known for his influential work in type theory, programming language design, and the development of the Modula-3 and Polyphonic C# languages.
- 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_69ca847f22188190a56e4a97625bef22 |
completed | March 30, 2026, 2:11 p.m. |
| NER | Named-entity recognition | batch_69cd996df4f08190b19bbaefb10a9789 |
completed | April 1, 2026, 10:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d152b09c808190aff32419f2cbb15f |
completed | April 4, 2026, 6:04 p.m. |
Created at: March 30, 2026, 8:04 p.m.