Triple
T11016144
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | The Calculus of Computation |
E260370
|
entity |
| Predicate | hasTitle |
P38
|
FINISHED |
| Object | The Calculus of Computation |
E260370
|
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: The Calculus of Computation | Statement: [The Calculus of Computation, hasTitle, The Calculus of Computation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: The Calculus of Computation Context triple: [The Calculus of Computation, hasTitle, The Calculus of Computation]
-
A.
The Calculus of Computation
chosen
The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
-
B.
Outline of a Mathematical Theory of Computation
Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
-
C.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
D.
Blum–Shub–Smale model of computation
The Blum–Shub–Smale model of computation is a theoretical framework for analyzing algorithms over real numbers, extending classical complexity theory beyond discrete computation.
-
E.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
- 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_69d6aa9687448190b28d353b1b6a610e |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d797a558a08190bdb5779faa9adf05 |
completed | April 9, 2026, 12:12 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e374d371ec8190aba9e77346c6e876 |
completed | April 18, 2026, 12:10 p.m. |
Created at: April 8, 2026, 9:25 p.m.