Triple
T123963
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Turing machine |
E2505
|
entity |
| Predicate | describedInWork |
P519
|
FINISHED |
| Object |
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.
|
E13826
|
NE FINISHED |
How this triple was built (5 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: On Computable Numbers with an Application to the Entscheidungsproblem | Statement: [Turing machine, describedInWork, On Computable Numbers with an Application to the Entscheidungsproblem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: On Computable Numbers with an Application to the Entscheidungsproblem Context triple: [Turing machine, describedInWork, On Computable Numbers with an Application to the Entscheidungsproblem]
-
A.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
B.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
-
C.
Principia Mathematica
Principia Mathematica is a landmark three-volume work in mathematical logic and the foundations of mathematics, co-authored by Bertrand Russell and Alfred North Whitehead, which aimed to derive all mathematical truths from a formal system of symbolic logic.
-
D.
A Mathematical Theory of Communication
A Mathematical Theory of Communication is Claude Shannon’s landmark 1948 paper that founded information theory by rigorously defining concepts like information, entropy, and channel capacity.
-
E.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
- 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: On Computable Numbers with an Application to the Entscheidungsproblem Triple: [Turing machine, describedInWork, On Computable Numbers with an Application to the Entscheidungsproblem]
Generated description
"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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: On Computable Numbers with an Application to the Entscheidungsproblem Target entity description: "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.
-
A.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
B.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
-
C.
Principia Mathematica
Principia Mathematica is a landmark three-volume work in mathematical logic and the foundations of mathematics, co-authored by Bertrand Russell and Alfred North Whitehead, which aimed to derive all mathematical truths from a formal system of symbolic logic.
-
D.
A Mathematical Theory of Communication
A Mathematical Theory of Communication is Claude Shannon’s landmark 1948 paper that founded information theory by rigorously defining concepts like information, entropy, and channel capacity.
-
E.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
- F. None of above. chosen
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: describedInWork Context triple: [Turing machine, describedInWork, On Computable Numbers with an Application to the Entscheidungsproblem]
-
A.
describedIn
chosen
Indicates that information about an entity is contained or documented within a specified source, such as a text, document, or media.
-
B.
describedByAuthorAs
Indicates that one entity is characterized, labeled, or portrayed in a particular way by an author.
-
C.
describes
Indicates that one entity provides an explanation, representation, or account of another entity or concept.
-
D.
associatedWork
Indicates that there exists a related or connected work (such as a publication, creative piece, or project) that is meaningfully linked to the subject.
-
E.
presentedIn
Indicates that something is shown, displayed, or formally introduced within a particular context, medium, event, or setting.
- F. None of above.
Provenance (6 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_69a251b54ea88190b18281669f59b4c0 |
completed | Feb. 28, 2026, 2:23 a.m. |
| NER | Named-entity recognition | batch_69a2573ce0ac8190b49fb31d3d475bf9 |
completed | Feb. 28, 2026, 2:47 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a2982485348190b2b361aef7b42fc9 |
completed | Feb. 28, 2026, 7:24 a.m. |
| NEDg | Description generation | batch_69a299032e748190b8f91ff2109c40fe |
completed | Feb. 28, 2026, 7:28 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69a29af5cf3c8190a88b5cbabea72cc5 |
completed | Feb. 28, 2026, 7:36 a.m. |
| PD | Predicate disambiguation | batch_69a2564a54948190ba30bee858173b27 |
completed | Feb. 28, 2026, 2:43 a.m. |
Created at: Feb. 28, 2026, 2:27 a.m.