Triple
T2384366
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Zohar Manna |
E46383
|
entity |
| Predicate | authorOf |
P4244
|
FINISHED |
| Object |
Mathematical Theory of Computation
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
|
E260369
|
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: Mathematical Theory of Computation | Statement: [Zohar Manna, authorOf, Mathematical Theory of Computation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Mathematical Theory of Computation Context triple: [Zohar Manna, authorOf, Mathematical Theory of Computation]
-
A.
Theoretical Computer Science
Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
-
B.
Computability Theory
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
-
C.
Mathematics and Computation
"Mathematics and Computation" is a book by Avi Wigderson that explores the deep connections between theoretical computer science and mathematics, emphasizing how computational complexity shapes modern mathematical thought.
-
D.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
E.
Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
- 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: Mathematical Theory of Computation Triple: [Zohar Manna, authorOf, Mathematical Theory of Computation]
Generated description
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Mathematical Theory of Computation Target entity description: Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
-
A.
Theoretical Computer Science
Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
-
B.
Computability Theory
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
-
C.
Mathematics and Computation
"Mathematics and Computation" is a book by Avi Wigderson that explores the deep connections between theoretical computer science and mathematics, emphasizing how computational complexity shapes modern mathematical thought.
-
D.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
E.
Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
- 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_69a88a1554a48190a0180682bcf099be |
completed | March 4, 2026, 7:37 p.m. |
| NER | Named-entity recognition | batch_69abc7bc87d0819090cd9d19d748bcc3 |
completed | March 7, 2026, 6:37 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69aea8bae2ec8190962479832bf7762e |
completed | March 9, 2026, 11:02 a.m. |
| NEDg | Description generation | batch_69aeab4258f88190a7a009d0fa501dd4 |
completed | March 9, 2026, 11:13 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69aeaba59cd08190981af351019b3e81 |
completed | March 9, 2026, 11:14 a.m. |
Created at: March 4, 2026, 7:57 p.m.