Triple
T11016081
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Amir Pnueli |
E260368
|
entity |
| Predicate | doctoralThesisTitle |
P1860
|
FINISHED |
| Object |
Decision Problems in the Theory of Automata
"Decision Problems in the Theory of Automata" is the doctoral thesis of computer scientist Amir Pnueli, focusing on foundational questions about the solvability and complexity of problems related to automata theory.
|
E900194
|
NE FINISHED |
How this triple was built (4 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: Decision Problems in the Theory of Automata | Statement: [Amir Pnueli, doctoralThesisTitle, Decision Problems in the Theory of Automata]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Decision Problems in the Theory of Automata Context triple: [Amir Pnueli, doctoralThesisTitle, Decision Problems in the Theory of Automata]
-
A.
Finite Automata and Their Decision Problems
"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.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Decision Problems in the Theory of Automata Triple: [Amir Pnueli, doctoralThesisTitle, Decision Problems in the Theory of Automata]
Generated description
"Decision Problems in the Theory of Automata" is the doctoral thesis of computer scientist Amir Pnueli, focusing on foundational questions about the solvability and complexity of problems related to automata theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Decision Problems in the Theory of Automata Target entity description: "Decision Problems in the Theory of Automata" is the doctoral thesis of computer scientist Amir Pnueli, focusing on foundational questions about the solvability and complexity of problems related to automata theory.
-
A.
Finite Automata and Their Decision Problems
"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.
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.
- F. None of above. chosen
Provenance (5 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. |
| NEDg | Description generation | batch_69e37ab6ca788190ac41f9494ad9a47f |
completed | April 18, 2026, 12:36 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69e37c9439fc8190a69cfb1a13da4c19 |
completed | April 18, 2026, 12:44 p.m. |
Created at: April 8, 2026, 9:25 p.m.