Triple
T18628495
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hamiltonian cycle |
E455347
|
entity |
| Predicate | historicalOrigin |
P1823
|
FINISHED |
| Object | Icosian game of William Rowan Hamilton |
—
|
NE NERFINISHED |
How this triple was built (3 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: Icosian game of William Rowan Hamilton | Statement: [Hamiltonian cycle, historicalOrigin, Icosian game of William Rowan Hamilton]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Icosian game of William Rowan Hamilton Context triple: [Hamiltonian cycle, historicalOrigin, Icosian game of William Rowan Hamilton]
-
A.
Seven Bridges of Königsberg problem
The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
-
B.
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.
-
C.
Kayles
Kayles is a classic impartial combinatorial game in which players alternately remove one or two adjacent pins from a row, with the goal of making the last move.
-
D.
Mathematical Recreations and Essays
Mathematical Recreations and Essays is a classic book of popular mathematics that explores a wide range of mathematical puzzles, curiosities, and historical topics in an accessible style.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Icosian game of William Rowan Hamilton Target entity description: The Icosian game of William Rowan Hamilton is a 19th-century mathematical puzzle based on finding a Hamiltonian cycle on the vertices of a dodecahedron, which helped introduce and popularize the concept of Hamiltonian paths in graph theory.
-
A.
Seven Bridges of Königsberg problem
The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
-
B.
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.
-
C.
Kayles
Kayles is a classic impartial combinatorial game in which players alternately remove one or two adjacent pins from a row, with the goal of making the last move.
-
D.
Mathematical Recreations and Essays
Mathematical Recreations and Essays is a classic book of popular mathematics that explores a wide range of mathematical puzzles, curiosities, and historical topics in an accessible style.
-
E.
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.
- F. None of above. chosen
Provenance (2 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_69d8d38cc7948190a55ea64e5638994e |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e54f063a1c819087e544c64f5cf80f |
completed | April 19, 2026, 9:54 p.m. |
Created at: April 10, 2026, 11:46 a.m.