Triple
T10055350
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ackermann function |
E208846
|
entity |
| Predicate | alternativeName |
P39
|
FINISHED |
| Object | Ackermann–Péter 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–Péter function | Statement: [Ackermann function, alternativeName, Ackermann–Péter function]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ackermann–Péter function Context triple: [Ackermann function, alternativeName, Ackermann–Péter 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.
Ackermann
Ackermann is a German surname borne by numerous notable individuals across fields such as mathematics, the arts, and public life.
-
C.
Graham's number
Graham's number is an extraordinarily large number that arose in a problem in Ramsey theory and became famous as one of the largest numbers ever used in a serious mathematical proof.
-
D.
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.
-
E.
Feferman–Schütte ordinal
The Feferman–Schütte ordinal is a large countable ordinal that marks the proof-theoretic strength of predicative arithmetic and analysis, serving as a key boundary in ordinal analysis and foundations of mathematics.
- 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_69ca836094408190a36a1ea7e9a86fcd |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cdcfacacd08190abe66f8bb17b92c7 |
completed | April 2, 2026, 2:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d29a49cb208190b56d991a523efbac |
completed | April 5, 2026, 5:22 p.m. |
Created at: March 30, 2026, 8:57 p.m.