Triple

T13507193
Position Surface form Disambiguated ID Type / Status
Subject Fibonacci heap E321043 entity
Predicate usedInAlgorithm P25490 FINISHED
Object Dijkstra's shortest path algorithm
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.
 E1045595 NE FINISHED

How this triple was built (4 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: [Fibonacci heap, usedInAlgorithm, 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: [Fibonacci heap, usedInAlgorithm, Dijkstra's shortest path algorithm]
  • A. 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.
  • B. 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.
  • 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. Graph Algorithms (book)
    "Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
  • E. 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.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Dijkstra's shortest path algorithm
Triple: [Fibonacci heap, usedInAlgorithm, Dijkstra's shortest path algorithm]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Dijkstra's shortest path algorithm
Target entity description: 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.
  • A. 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.
  • B. 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.
  • 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. Graph Algorithms (book)
    "Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
  • E. 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.
  • F. None of above. chosen

Provenance (5 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_69d807629d6c8190998f1b9bb12d2ed0 completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbbe99ddc08190a8d79107c8e176fa completed April 12, 2026, 3:47 p.m.
NED1 Entity disambiguation (via context triple) batch_69f7548e51b881909a3384812556bc3d completed May 3, 2026, 1:58 p.m.
NEDg Description generation batch_69f757108e088190aeec031eccc9aca3 completed May 3, 2026, 2:09 p.m.
NED2 Entity disambiguation (via description) batch_69f757e7322c8190b0e36e8373d42ac4 completed May 3, 2026, 2:12 p.m.
Created at: April 9, 2026, 9:43 p.m.