Triple
T890978
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Königsberg |
E19236
|
entity |
| Predicate | famousFor |
P22
|
FINISHED |
| Object |
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.
|
E105766
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a4939d37188190848be3d426ebc9ae |
elicitation | completed |
| NER | batch_69a4ad019e448190ab991e85dc6d7708 |
ner | completed |
| NED1 | batch_69a7c023464481909759c457e87266ab |
ned_source_triple | completed |
| NED2 | batch_69a7c21f163881908f7cb02a68ad1220 |
ned_description | completed |
| NEDg | batch_69a7c1509a8c81909b8cf074e1ce7169 |
nedg | completed |
Created at: March 1, 2026, 7:39 p.m.