Triple
T5716676
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RFC 1195 |
E126039
|
entity |
| Predicate | uses |
P98
|
FINISHED |
| Object | Dijkstra shortest path first algorithm |
E79781
|
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: Dijkstra shortest path first algorithm | Statement: [RFC 1195, uses, Dijkstra shortest path first algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dijkstra shortest path first algorithm Context triple: [RFC 1195, uses, Dijkstra shortest path first algorithm]
-
A.
Dijkstra
chosen
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.
-
B.
DSA
DSA (Digital Signature Algorithm) is a widely used public-key cryptographic standard designed for creating and verifying digital signatures to ensure data integrity and authentication.
-
C.
Kruskal
Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
-
D.
Tarjan's strongly connected components algorithm
Tarjan's strongly connected components algorithm is a classic linear-time graph algorithm that efficiently identifies all strongly connected components in a directed graph using depth-first search and low-link values.
-
E.
Steiner tree problem
The Steiner tree problem is a classic optimization problem in combinatorial mathematics and computer science that seeks the shortest network of line segments connecting a given set of points, potentially adding extra intermediate points to minimize total length.
- 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_69c0082e3d548190950169847b43043b |
completed | March 22, 2026, 3:18 p.m. |
| NER | Named-entity recognition | batch_69c024ba819c8190bb7d775405dda9d6 |
completed | March 22, 2026, 5:19 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c05a7af5788190827ff8050eb6416d |
completed | March 22, 2026, 9:09 p.m. |
Created at: March 22, 2026, 3:46 p.m.