Triple
T9838467
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dexter Kozen |
E239160
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Theory of Computation (textbook) |
E677190
|
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: Theory of Computation (textbook) | Statement: [Dexter Kozen, notableWork, Theory of Computation (textbook)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Theory of Computation (textbook) Context triple: [Dexter Kozen, notableWork, Theory of Computation (textbook)]
-
A.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
B.
Elements of the Theory of Computation
chosen
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
C.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
-
D.
Automata Theory
Automata Theory is a branch of theoretical computer science that studies abstract computational models and the problems they can solve, forming a foundation for formal languages, compilers, and complexity theory.
-
E.
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.
- 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_69ca84e314108190978324a4bdb959f8 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1d5d145ac8190ad10a4328216ef54 |
completed | April 5, 2026, 3:24 a.m. |
Created at: March 30, 2026, 8:33 p.m.