Triple

T3043247
Position Surface form Disambiguated ID Type / Status
Subject Robert Tarjan E83180 entity
Predicate notableWork P4 FINISHED
Object Fibonacci heap
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
E321043 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: Fibonacci heap | Statement: [Robert Tarjan, notableWork, Fibonacci heap]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Fibonacci heap
Context triple: [Robert Tarjan, notableWork, Fibonacci heap]
  • A. B-tree
    A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
  • B. 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.
  • C. 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.
  • D. 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.
  • E. BST
    BST (British Summer Time) is the daylight saving time observed in the United Kingdom, set one hour ahead of Coordinated Universal Time (UTC+1) during the summer months.
  • 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: Fibonacci heap
Triple: [Robert Tarjan, notableWork, Fibonacci heap]
Generated description
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Fibonacci heap
Target entity description: A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
  • A. B-tree
    A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
  • B. 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.
  • C. 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.
  • D. 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.
  • E. BST
    BST (British Summer Time) is the daylight saving time observed in the United Kingdom, set one hour ahead of Coordinated Universal Time (UTC+1) during the summer months.
  • 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_69ad8b2298908190a7cb4e9bdbf064d0 completed March 8, 2026, 2:43 p.m.
NER Named-entity recognition batch_69ad9b5ec5988190b8b6c95c743c6d1e completed March 8, 2026, 3:53 p.m.
NED1 Entity disambiguation (via context triple) batch_69b1ded35e008190be7dd72aa7537a3b completed March 11, 2026, 9:29 p.m.
NEDg Description generation batch_69b1dfa2fb28819089d7d76d9dc72e06 completed March 11, 2026, 9:33 p.m.
NED2 Entity disambiguation (via description) batch_69b1e0243a848190bce24d035a79fc0a completed March 11, 2026, 9:35 p.m.
Created at: March 8, 2026, 3:01 p.m.