Triple
T22334482
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RFC 5302 |
E552106
|
entity |
| Predicate | usesAlgorithm |
P89
|
FINISHED |
| Object | Dijkstra algorithm |
—
|
NE NERFINISHED |
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: Dijkstra algorithm | Statement: [RFC 5302, usesAlgorithm, Dijkstra algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dijkstra algorithm Context triple: [RFC 5302, usesAlgorithm, Dijkstra algorithm]
-
A.
Dijkstra's shortest path algorithm
chosen
Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
-
B.
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.
-
C.
Bellman–Ford algorithm
The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.
-
D.
Floyd–Warshall algorithm
The Floyd–Warshall algorithm is a classic dynamic programming method in computer science for efficiently computing shortest paths between all pairs of vertices in a weighted graph, even when negative edge weights are present.
-
E.
Fleury's algorithm
Fleury's algorithm is a classical graph-theoretic procedure for systematically finding an Eulerian trail by repeatedly choosing edges that are not bridges unless necessary.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69e11e482f788190b78d1588fc26d606 |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f1577e35f48190b11789d80182653e |
completed | April 29, 2026, 12:57 a.m. |
Created at: April 16, 2026, 8:43 p.m.