Triple
T7030635
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Conway’s soldiers |
E163258
|
entity |
| Predicate | variant |
P4680
|
FINISHED |
| Object | Conway’s soldiers on different lattices |
E163258
|
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 soldiers on different lattices | Statement: [Conway’s soldiers, variant, Conway’s soldiers on different lattices]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Conway’s soldiers on different lattices Context triple: [Conway’s soldiers, variant, Conway’s soldiers on different lattices]
-
A.
Conway’s soldiers
chosen
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.
-
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 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
D.
Steinhaus chessboard theorem
The Steinhaus chessboard theorem is a combinatorial result in geometry and topology that gives conditions under which certain colored paths must exist on a checkerboard-like grid.
-
E.
Conway's thrackle conjecture
Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
- 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_69c6885d691c81908cf7d31083113886 |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6e20dbc8c8190a7446290747d8078 |
completed | March 27, 2026, 8:01 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c775980920819081d31b8d2843fb3d |
completed | March 28, 2026, 6:30 a.m. |
Created at: March 27, 2026, 2:35 p.m.