Triple
T1031138
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Introduction to the Theory of Computation |
E22252
|
entity |
| Predicate | author |
P4
|
FINISHED |
| Object | Michael Sipser |
E22252
|
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: Michael Sipser | Statement: [Introduction to the Theory of Computation, author, Michael Sipser]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Michael Sipser Context triple: [Introduction to the Theory of Computation, author, Michael Sipser]
-
A.
Michael Sipser
chosen
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
E.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
- 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_69a493d848848190aed4011b34b2e8d3 |
completed | March 1, 2026, 7:30 p.m. |
| NER | Named-entity recognition | batch_69a4b810429081908a97014ca740824b |
completed | March 1, 2026, 10:05 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ac429675bc8190b2467ac86c41c3b5 |
completed | March 7, 2026, 3:21 p.m. |
Created at: March 1, 2026, 7:41 p.m.