Triple

T9566620
Position Surface form Disambiguated ID Type / Status
Subject Arthur John Robin Gorell Milner E230803 entity
Predicate notableWork P4 FINISHED
Object Calculus of Communicating Systems E230808 NE FINISHED

Named-entity recognition

Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's NE type shown above.

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]

Disambiguation candidates (1 decision)

The exact options the model was shown at each disambiguation step, with the option it chose highlighted — the evidence behind this triple's disambiguated ids.

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. 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)

Stage Batch ID Job type Status
creating batch_69ca847f22188190a56e4a97625bef22 elicitation completed
NER batch_69cd996c0a1081908a8356c454e60f74 ner completed
NED1 batch_69d152b09c808190aff32419f2cbb15f ned_source_triple completed
Created at: March 30, 2026, 8:04 p.m.