Triple

T13529894
Position Surface form Disambiguated ID Type / Status
Subject Tarjan's strongly connected components algorithm E323102 entity
Predicate alsoKnownAs P39 FINISHED
Object Tarjan's SCC algorithm E323102 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: Tarjan's SCC algorithm | Statement: [Tarjan's strongly connected components algorithm, alsoKnownAs, Tarjan's SCC algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Tarjan's SCC algorithm
Context triple: [Tarjan's strongly connected components algorithm, alsoKnownAs, Tarjan's SCC algorithm]
  • A. Tarjan's strongly connected components algorithm chosen
    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. union–find data structure
    The union–find data structure is an efficient algorithmic structure that maintains disjoint sets and supports fast union and find operations, widely used in graph algorithms such as Kruskal’s minimum spanning tree.
  • 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. Cristian's algorithm
    Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
  • 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_69f7549fc5f881908691eb62c1f5a5d5 completed May 3, 2026, 1:58 p.m.
Created at: April 9, 2026, 9:44 p.m.