Triple
T9566797
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | π-calculus |
E230807
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | mathematical model of concurrency |
C7185
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: mathematical model of concurrency Context triple: [π-calculus, instanceOf, mathematical model of concurrency]
-
A.
logic for concurrent systems
Logic for concurrent systems is a formal framework for specifying and reasoning about the behaviors, interactions, and correctness properties of systems in which multiple processes execute and communicate simultaneously.
-
B.
model of computation
chosen
A model of computation is an abstract mathematical framework that defines how algorithms are represented and executed, specifying the rules, operations, and resources available for performing computations.
-
C.
theoretical computer science conference
A theoretical computer science conference is a formal academic gathering where researchers present, discuss, and critique new results and ideas in areas such as algorithms, complexity theory, cryptography, and formal methods.
-
D.
axiomatic semantics
Axiomatic semantics is a formal method for defining the meaning of programs by specifying logical assertions (preconditions and postconditions) that describe the behavior and correctness of program constructs.
-
E.
cellular automaton
A cellular automaton is a discrete computational model consisting of a grid of cells, each in one of a finite number of states, that evolve over time according to simple local rules based on the states of neighboring cells.
- F. None of above.
Provenance (1 batch)
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. |
Created at: March 30, 2026, 8:04 p.m.