Triple
T3744659
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dijkstra |
E79781
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Dijkstra's shortest path 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's shortest path algorithm | Statement: [Dijkstra, knownFor, Dijkstra's shortest path algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dijkstra's shortest path algorithm Context triple: [Dijkstra, knownFor, Dijkstra's shortest path 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.
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.
-
C.
Viterbi algorithm
The Viterbi algorithm is a dynamic programming method used to find the most likely sequence of hidden states in probabilistic models such as Hidden Markov Models, widely applied in fields like digital communications, speech recognition, and bioinformatics.
-
D.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
E.
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.
- 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_69ad8b115610819095b02007da5ca3cb |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69adcb58c9048190a055d1f4a7e6b699 |
completed | March 8, 2026, 7:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b4db29b2288190932923a6bf1a7e8e |
completed | March 14, 2026, 3:51 a.m. |
Created at: March 8, 2026, 3:34 p.m.