Triple
T7666865
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Computability Theory |
E173643
|
entity |
| Predicate | hasKeyFigure |
P810
|
FINISHED |
| Object | Stephen Kleene |
E148433
|
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: Stephen Kleene | Statement: [Computability Theory, hasKeyFigure, Stephen Kleene]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Stephen Kleene Context triple: [Computability Theory, hasKeyFigure, Stephen Kleene]
-
A.
Stephen Kleene
chosen
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.
-
B.
Emil Post
Emil Post was a pioneering logician and mathematician whose work on recursive functions, production systems, and undecidability helped lay the foundations of modern computability theory.
-
C.
Dana Scott
Dana Scott is an American logician and mathematician renowned for his foundational work in domain theory, model theory, and the semantics of programming languages, for which he received the Turing Award.
-
D.
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.
-
E.
Ray Solomonoff
Ray Solomonoff was a pioneering mathematician and one of the founders of algorithmic information theory, best known for introducing Solomonoff induction as a formal theory of universal prediction and inductive inference.
- 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_69c699562484819086752091e3164a27 |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c701c1383c8190ab5bf803bd6211a9 |
completed | March 27, 2026, 10:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8ac9527088190b3d7fd0987e66f35 |
completed | March 29, 2026, 4:37 a.m. |
Created at: March 27, 2026, 4 p.m.