Triple
T6620209
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Pregel River |
E149653
|
entity |
| Predicate | notableFor |
P22
|
FINISHED |
| Object | Seven Bridges of Königsberg problem |
E105766
|
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: Seven Bridges of Königsberg problem | Statement: [Pregel River, notableFor, Seven Bridges of Königsberg problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Seven Bridges of Königsberg problem Context triple: [Pregel River, notableFor, Seven Bridges of Königsberg problem]
-
A.
Seven Bridges of Königsberg problem
chosen
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.
Eulerian trail
An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
-
C.
“Solutio problematis ad geometriam situs pertinentis”
“Solutio problematis ad geometriam situs pertinentis” is Leonhard Euler’s 1736 Latin paper that founded graph theory and topology by solving the Seven Bridges of Königsberg problem.
-
D.
Königsberg
Königsberg was a historic Prussian city on the Baltic Sea, renowned as a major cultural and intellectual center of East Prussia and later known as Kaliningrad.
-
E.
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.
- 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_69c687ed8a9c81908bb671717cb192ef |
completed | March 27, 2026, 1:36 p.m. |
| NER | Named-entity recognition | batch_69c6af7aff44819089da6145e1ef5f76 |
completed | March 27, 2026, 4:25 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c6cbe2bcfc8190a3224c688443edc9 |
completed | March 27, 2026, 6:26 p.m. |
Created at: March 27, 2026, 1:58 p.m.