Triple
T1255230
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Church–Turing thesis |
E26972
|
entity |
| Predicate | associatedWith |
P37
|
FINISHED |
| Object |
Stephen Kleene
Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
|
E148433
|
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: Stephen Kleene | Statement: [Church–Turing thesis, associatedWith, Stephen Kleene]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Stephen Kleene Context triple: [Church–Turing thesis, associatedWith, Stephen Kleene]
-
A.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
B.
John von Neumann
John von Neumann was a pioneering 20th-century mathematician and polymath whose foundational work in game theory, computer science, quantum mechanics, and economics profoundly shaped modern science and technology.
-
C.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
D.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
E.
Alan Perlis
Alan Perlis was an American computer scientist and educator renowned for his pioneering work in programming languages and for being the first recipient of the Turing Award.
- 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: Stephen Kleene Triple: [Church–Turing thesis, associatedWith, Stephen Kleene]
Generated description
Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Stephen Kleene Target entity description: Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
-
A.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
B.
John von Neumann
John von Neumann was a pioneering 20th-century mathematician and polymath whose foundational work in game theory, computer science, quantum mechanics, and economics profoundly shaped modern science and technology.
-
C.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
-
D.
Wilhelm Ackermann
Wilhelm Ackermann was a German mathematician known for his work in mathematical logic and the development of the Ackermann function, one of the earliest-discovered examples of a computable but not primitive recursive function.
-
E.
Alan Perlis
Alan Perlis was an American computer scientist and educator renowned for his pioneering work in programming languages and for being the first recipient of the Turing Award.
- 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_69a49487a9c48190ba9b05348fd1b53f |
completed | March 1, 2026, 7:33 p.m. |
| NER | Named-entity recognition | batch_69a4bfa5a4cc819093ed686619b572d8 |
completed | March 1, 2026, 10:37 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69acb2fa8aec8190ad68b9dc87c85cfc |
completed | March 7, 2026, 11:21 p.m. |
| NEDg | Description generation | batch_69acb364f2d88190b20ad87001349562 |
completed | March 7, 2026, 11:23 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69acb3ce7720819095558536e0a978b8 |
completed | March 7, 2026, 11:25 p.m. |
Created at: March 1, 2026, 7:47 p.m.