Triple

T2092390
Position Surface form Disambiguated ID Type / Status
Subject Robin Milner E32698 entity
Predicate knownFor P22 FINISHED
Object π-calculus
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
 E230807 NE FINISHED

How this triple was built (4 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 | Statement: [Robin Milner, knownFor, π-calculus]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: π-calculus
Context triple: [Robin Milner, knownFor, π-calculus]
  • A. 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.
  • B. 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.
  • C. lambda calculus
    Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
  • D. Computing with Register Machines
    "Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
  • E. Communication Nets: Stochastic Message Flow and Delay
    "Communication Nets: Stochastic Message Flow and Delay" is a foundational book in queueing theory and computer networking that rigorously analyzes message traffic and delays in communication networks.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: π-calculus
Triple: [Robin Milner, knownFor, π-calculus]
Generated description
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: π-calculus
Target entity description: The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
  • A. 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.
  • B. 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.
  • C. lambda calculus
    Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
  • D. Computing with Register Machines
    "Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
  • E. Communication Nets: Stochastic Message Flow and Delay
    "Communication Nets: Stochastic Message Flow and Delay" is a foundational book in queueing theory and computer networking that rigorously analyzes message traffic and delays in communication networks.
  • F. None of above. chosen

Provenance (5 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_69ae2746fb3481909e0b7fdbd4748245 completed March 9, 2026, 1:49 a.m.
NEDg Description generation batch_69ae2868815881908d6163ab84060ec2 completed March 9, 2026, 1:54 a.m.
NED2 Entity disambiguation (via description) batch_69ae28ce87c8819097e0b5dab045d9a1 completed March 9, 2026, 1:56 a.m.
Created at: March 4, 2026, 7:43 p.m.