Triple
T1861728
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Alonzo Church |
E34828
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Church numerals |
E26971
|
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: Church numerals | Statement: [Alonzo Church, notableWork, Church numerals]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Church numerals Context triple: [Alonzo Church, notableWork, Church numerals]
-
A.
Gödel numbering
Gödel numbering is a method in mathematical logic that encodes symbols, formulas, and proofs as unique natural numbers, enabling arithmetic to represent and reason about syntactic statements.
-
B.
Curry encoding
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
-
C.
lambda calculus
chosen
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
-
D.
Knuth’s up-arrow notation
Knuth’s up-arrow notation is a mathematical notation introduced by Donald Knuth to concisely represent very large integers using iterated exponentiation and its higher-order generalizations.
-
E.
Church–Turing thesis
The Church–Turing thesis is a foundational principle in computability theory stating that any function that can be effectively computed by an algorithm can be computed by a Turing machine (or equivalently by other formal models of computation).
- 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_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. |
Created at: March 4, 2026, 7:34 p.m.