Triple
T1859151
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Wilhelm Ackermann |
E41773
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | Ackermann function |
E208846
|
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: Ackermann function | Statement: [Wilhelm Ackermann, notableConcept, Ackermann function]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ackermann function Context triple: [Wilhelm Ackermann, notableConcept, Ackermann function]
-
A.
Ackermann function
chosen
The Ackermann function is a classic example of a computable function that grows faster than any primitive recursive function, often used in theoretical computer science to illustrate extreme computational complexity.
-
B.
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.
-
C.
Conway chained arrow notation
Conway chained arrow notation is a mathematical system of hyper-operator-style notation introduced by John Horton Conway to concisely represent extremely large numbers.
-
D.
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.
-
E.
Look-and-say sequence
The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
- 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_69a8864a83848190a4ec02721306c511 |
completed | March 4, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69abb0829f1481908d2b389d20827417 |
completed | March 7, 2026, 4:58 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69adeaddc9188190bd49d6605fd0e812 |
completed | March 8, 2026, 9:32 p.m. |
Created at: March 4, 2026, 7:33 p.m.