Triple
T9566880
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CCS |
E230808
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Algebra of Communicating Processes |
E230808
|
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: Algebra of Communicating Processes | Statement: [CCS, relatedTo, Algebra of Communicating Processes]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Algebra of Communicating Processes Context triple: [CCS, relatedTo, Algebra of Communicating Processes]
-
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.
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.
-
D.
concurrency theory
Concurrency theory is a branch of theoretical computer science that studies the behavior, interaction, and formal modeling of systems with multiple components executing simultaneously.
-
E.
Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
"Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs" is a landmark 1977 paper that introduced and advocated for functional programming as an alternative to traditional von Neumann architectures, laying theoretical foundations for modern functional 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_69d16149c7808190b476ec06e9780a03 |
completed | April 4, 2026, 7:06 p.m. |
Created at: March 30, 2026, 8:04 p.m.