Triple
T4764113
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Seven Bridges of Königsberg problem |
E105766
|
entity |
| Predicate | hasConcept |
P531
|
FINISHED |
| Object | Eulerian path |
E467732
|
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: Eulerian path | Statement: [Seven Bridges of Königsberg problem, hasConcept, Eulerian path]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Eulerian path Context triple: [Seven Bridges of Königsberg problem, hasConcept, Eulerian path]
-
A.
Eulerian trail
chosen
An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
-
B.
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.
-
C.
Hamiltonian cycle concept
The Hamiltonian cycle concept is a fundamental idea in graph theory describing a cycle that visits each vertex of a graph exactly once and returns to the starting point.
-
D.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
E.
Eppstein
Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
- 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_69bd43f14cac819081c7c69803648211 |
completed | March 20, 2026, 12:56 p.m. |
| NER | Named-entity recognition | batch_69bd6530f0648190b76db9964471cfeb |
completed | March 20, 2026, 3:18 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69be43bad99c8190a170baefea057038 |
completed | March 21, 2026, 7:07 a.m. |
Created at: March 20, 2026, 1:21 p.m.