Triple
T9634347
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Communication and Concurrency |
E232890
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object | π-calculus |
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: π-calculus | Statement: [Communication and Concurrency, influenced, π-calculus]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: π-calculus Context triple: [Communication and Concurrency, influenced, π-calculus]
-
A.
π-calculus
chosen
The π-calculus is a formal mathematical model for describing and analyzing concurrent, communicating systems, particularly those with dynamic network structures.
-
B.
spi-calculus
Spi-calculus is a process calculus extending π-calculus with cryptographic primitives to formally model and analyze security protocols.
-
C.
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.
-
D.
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.
-
E.
join-calculus
Join-calculus is a process calculus designed for specifying and reasoning about concurrent and distributed systems, emphasizing message-based synchronization and mobility.
- 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_69ca848940cc8190b97cec654cb3bb4a |
completed | March 30, 2026, 2:11 p.m. |
| NER | Named-entity recognition | batch_69cd9b2a0e2c8190ab5aaa223b1e1cde |
completed | April 1, 2026, 10:24 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d18237e2608190a3e7d45231a35efd |
completed | April 4, 2026, 9:27 p.m. |
Created at: March 30, 2026, 8:11 p.m.