Triple
T18791284
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | An Axiomatic Basis for Computer Programming |
E459518
|
entity |
| Predicate | relatedWork |
P37
|
FINISHED |
| Object | Communicating Sequential Processes |
—
|
NE NERFINISHED |
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: Communicating Sequential Processes | Statement: [An Axiomatic Basis for Computer Programming, relatedWork, Communicating Sequential Processes]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Communicating Sequential Processes Context triple: [An Axiomatic Basis for Computer Programming, relatedWork, Communicating Sequential Processes]
-
A.
CSP (Communicating Sequential Processes)
chosen
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.
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.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
D.
The Temporal Logic of Programs
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
E.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8d396f54c8190ba49db31e8743842 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e5978665388190aaefed0ec30a1ff3 |
completed | April 20, 2026, 3:03 a.m. |
Created at: April 10, 2026, 11:53 a.m.