Triple
T13529838
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | S. Rao Kosaraju |
E323101
|
entity |
| Predicate | inspiredWork |
P1994
|
FINISHED |
| Object | Sharir's algorithm for strongly connected components |
E1045495
|
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: Sharir's algorithm for strongly connected components | Statement: [S. Rao Kosaraju, inspiredWork, Sharir's algorithm for strongly connected components]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Sharir's algorithm for strongly connected components Context triple: [S. Rao Kosaraju, inspiredWork, Sharir's algorithm for strongly connected components]
-
A.
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.
-
B.
Lipton–Tarjan separator theorem
The Lipton–Tarjan separator theorem is a fundamental result in graph theory that shows any planar graph can be efficiently divided into roughly equal parts by removing only a relatively small set of vertices, enabling faster algorithms for many computational problems.
-
C.
Kosaraju's algorithm
chosen
Kosaraju's algorithm is a graph traversal method used to efficiently find all strongly connected components in a directed graph.
-
D.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
E.
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.
- 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_69d80766a21881909f21a1b7421d3b8a |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbafba2c308190873efd15dfe26358 |
completed | April 12, 2026, 2:44 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f75d95ce008190a915fe5865c38ee5 |
completed | May 3, 2026, 2:37 p.m. |
Created at: April 9, 2026, 9:44 p.m.