Triple
T1483698
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Game of Life |
E29416
|
entity |
| Predicate | alsoKnownAs |
P39
|
FINISHED |
| Object | Conway's Game of Life |
E29416
|
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: Conway's Game of Life | Statement: [Game of Life, alsoKnownAs, Conway's Game of Life]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Conway's Game of Life Context triple: [Game of Life, alsoKnownAs, Conway's Game of Life]
-
A.
Game of Life
chosen
Game of Life is a famous cellular automaton devised by mathematician John H. Conway that simulates complex patterns and behaviors using simple grid-based rules.
-
B.
Conway’s Game of Sprouts
Conway’s Game of Sprouts is a pencil-and-paper topological game in which players alternately connect dots with lines under simple rules, leading to rich combinatorial and mathematical analysis.
-
C.
Conway’s soldiers
Conway’s soldiers is a mathematical puzzle and thought experiment in combinatorial game theory that explores how far checkers-like pieces can advance on an infinite grid under specific movement rules.
-
D.
NKS
NKS is the ICAO airline designator used in aviation to identify Spirit Airlines in flight operations and air traffic control.
-
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_69a498da82e08190ba833330d05f380f |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c679714c8190ac53630fb49e19c5 |
completed | March 1, 2026, 11:06 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad15b3a8548190b484a15757aee7b1 |
completed | March 8, 2026, 6:22 a.m. |
Created at: March 1, 2026, 8:12 p.m.