Triple
T4764112
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Seven Bridges of Königsberg problem |
E105766
|
entity |
| Predicate | hasConcept |
P531
|
FINISHED |
| Object |
Eulerian trail
An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
|
E467732
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69bd43f14cac819081c7c69803648211 |
elicitation | completed |
| NER | batch_69bd6530f0648190b76db9964471cfeb |
ner | completed |
| NED1 | batch_69be3a87741081909380c51ba4efed92 |
ned_source_triple | completed |
| NED2 | batch_69be3dd31c648190bfdac15fb85cfec9 |
ned_description | completed |
| NEDg | batch_69be3d444b888190b2df7433502604ff |
nedg | completed |
Created at: March 20, 2026, 1:21 p.m.