Triple

T9566832
Position Surface form Disambiguated ID Type / Status
Subject π-calculus E230807 entity
Predicate influenced P9 FINISHED
Object spi-calculus
Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
 E807609 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: spi-calculus | Statement: [π-calculus, influenced, spi-calculus]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: spi-calculus
Context triple: [π-calculus, influenced, spi-calculus]
  • A. π-calculus
    The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
  • B. 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.
  • 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. Jones calculus
    Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
  • 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. 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: spi-calculus
Triple: [π-calculus, influenced, spi-calculus]
Generated description
Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: spi-calculus
Target entity description: Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
  • A. π-calculus
    The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
  • B. 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.
  • 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. Jones calculus
    Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
  • 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. 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_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.
NEDg Description generation batch_69d153d59844819086a0f50e6a7624b2 completed April 4, 2026, 6:09 p.m.
NED2 Entity disambiguation (via description) batch_69d1546a503c81908edc9588adabc172 completed April 4, 2026, 6:11 p.m.
Created at: March 30, 2026, 8:04 p.m.