Triple
T1861745
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Alonzo Church |
E34828
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object |
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.
|
E207979
|
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: Dana Scott | Statement: [Alonzo Church, influenced, Dana Scott]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dana Scott Context triple: [Alonzo Church, influenced, Dana Scott]
-
A.
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.
-
B.
Solomon Feferman
Solomon Feferman was an American logician and philosopher of mathematics known for his influential work on proof theory, predicativity, and the foundations and history of mathematical logic.
-
C.
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.
-
D.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
E.
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.
- 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: Dana Scott Triple: [Alonzo Church, influenced, Dana Scott]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Dana Scott Target entity description: 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.
-
A.
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.
-
B.
Solomon Feferman
Solomon Feferman was an American logician and philosopher of mathematics known for his influential work on proof theory, predicativity, and the foundations and history of mathematical logic.
-
C.
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.
-
D.
John Alan Robinson
John Alan Robinson was a pioneering logician and computer scientist best known for introducing the resolution principle, a fundamental method in automated theorem proving and logic programming.
-
E.
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.
- 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_69a88600b2f88190bc09303e68ab517e |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69abb09e714881909cef0f7e77b5b3b9 |
completed | March 7, 2026, 4:59 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69add1d026748190a507872de85c908d |
completed | March 8, 2026, 7:45 p.m. |
| NEDg | Description generation | batch_69add2729498819082f6595c57f545a8 |
completed | March 8, 2026, 7:48 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69add32c32b08190be6624eefa2fa386 |
completed | March 8, 2026, 7:51 p.m. |
Created at: March 4, 2026, 7:34 p.m.