Triple
T7278037
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Sprague–Grundy theorem |
E163078
|
entity |
| Predicate | alsoKnownAs |
P39
|
FINISHED |
| Object | Grundy theorem |
E163078
|
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: Grundy theorem | Statement: [Sprague–Grundy theorem, alsoKnownAs, Grundy theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Grundy theorem Context triple: [Sprague–Grundy theorem, alsoKnownAs, Grundy theorem]
-
A.
Sprague–Grundy theorem
chosen
The Sprague–Grundy theorem is a fundamental result in combinatorial game theory that assigns each impartial game position a nonnegative integer (its Grundy value), allowing such games to be analyzed and combined via nim-like addition.
-
B.
Wythoff Nim
Wythoff Nim is a classic impartial combinatorial game involving two piles of tokens, whose optimal play is characterized by positions related to the golden ratio.
-
C.
Hackenbush
Hackenbush is a combinatorial game played on colored line-graphs, famous in recreational mathematics for illustrating concepts in game theory and surreal numbers.
-
D.
Winning Ways for your Mathematical Plays
Winning Ways for your Mathematical Plays is a multi-volume book on combinatorial game theory that popularizes and systematically explores mathematical games and their underlying structures.
-
E.
Conway’s games
Conway’s games are a class of combinatorial games introduced by mathematician John Horton Conway, forming the foundation of surreal numbers and studied for their rich algebraic and strategic 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_69c6885c5964819085b209701769877f |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6eb309a648190a2a2f2cca9ce2f56 |
completed | March 27, 2026, 8:40 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c7e532a7f08190a5c0b1167dc0be44 |
completed | March 28, 2026, 2:26 p.m. |
Created at: March 27, 2026, 2:59 p.m.