Triple
T10018658
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Michael O. Rabin |
E199558
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Finite Automata and Their Decision Problems |
E755394
|
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: Finite Automata and Their Decision Problems | Statement: [Michael O. Rabin, notableWork, Finite Automata and Their Decision Problems]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Finite Automata and Their Decision Problems Context triple: [Michael O. Rabin, notableWork, Finite Automata and Their Decision Problems]
-
A.
Finite Automata and Their Decision Problems
chosen
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
-
B.
Elements of the Theory of Computation
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.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
D.
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
-
E.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
- 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_69ca8315a1a08190ab310f25620f362b |
completed | March 30, 2026, 2:05 p.m. |
| NER | Named-entity recognition | batch_69cdcd4de1588190a89ed575cff0b8c9 |
completed | April 2, 2026, 1:58 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d26aaa38188190aed8c18eccd8a79d |
completed | April 5, 2026, 1:59 p.m. |
Created at: March 30, 2026, 8:53 p.m.