Triple

T3214196
Position Surface form Disambiguated ID Type / Status
Subject Fibonacci sequence E67350 entity
Predicate isUsedInAlgorithm P9818 FINISHED
Object Fibonacci search
Fibonacci search is a divide-and-conquer search algorithm for sorted arrays that uses Fibonacci numbers to determine probe positions instead of midpoints.
E337573 NE FINISHED

How this triple was built (5 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 search | Statement: [Fibonacci sequence, isUsedInAlgorithm, Fibonacci search]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Fibonacci search
Context triple: [Fibonacci sequence, isUsedInAlgorithm, Fibonacci search]
  • A. Fibonacci sequence
    The Fibonacci sequence is an infinite series of numbers where each term is the sum of the two preceding ones, widely used in mathematics, art, and design due to its connection with the golden ratio and natural growth patterns.
  • B. 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.
  • 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. Berlekamp–Massey algorithm
    The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
  • E. Knuth–Morris–Pratt algorithm
    The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.
  • 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 search
Triple: [Fibonacci sequence, isUsedInAlgorithm, Fibonacci search]
Generated description
Fibonacci search is a divide-and-conquer search algorithm for sorted arrays that uses Fibonacci numbers to determine probe positions instead of midpoints.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Fibonacci search
Target entity description: Fibonacci search is a divide-and-conquer search algorithm for sorted arrays that uses Fibonacci numbers to determine probe positions instead of midpoints.
  • A. Fibonacci sequence
    The Fibonacci sequence is an infinite series of numbers where each term is the sum of the two preceding ones, widely used in mathematics, art, and design due to its connection with the golden ratio and natural growth patterns.
  • B. 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.
  • 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. Berlekamp–Massey algorithm
    The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
  • E. Knuth–Morris–Pratt algorithm
    The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.
  • F. None of above. chosen
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: isUsedInAlgorithm
Context triple: [Fibonacci sequence, isUsedInAlgorithm, Fibonacci search]
  • A. isUsedAs
    Indicates that one entity serves a particular function, role, or purpose as another entity.
  • B. areUsedIn
    Indicates that certain entities serve as components, tools, or resources within a particular process, context, or application.
  • C. isUsedToProbe
    Indicates that one entity is employed as a tool or method to investigate, test, or explore the properties, behavior, or state of another entity.
  • D. usedInOperation chosen
    Indicates that something (such as a tool, method, or resource) is employed or applied during the execution of a particular operation or procedure.
  • E. usedInSignatureOf
    Indicates that something (such as a type, parameter, or construct) appears as part of the formal signature of a function, method, or similar callable entity.
  • F. None of above.

Provenance (6 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_69ad858ac36c81909962589cd277d6e2 completed March 8, 2026, 2:19 p.m.
NER Named-entity recognition batch_69adaabd01d48190be0dc610b9987a25 completed March 8, 2026, 4:58 p.m.
NED1 Entity disambiguation (via context triple) batch_69b26237211c81908cddc4e8d42e497e completed March 12, 2026, 6:50 a.m.
NEDg Description generation batch_69b264c54c508190be85da879935e7f4 completed March 12, 2026, 7:01 a.m.
NED2 Entity disambiguation (via description) batch_69b268d60bd0819097194da2e9065947 completed March 12, 2026, 7:18 a.m.
PD Predicate disambiguation batch_69ad9e09b83881908801d79c3d9254f9 completed March 8, 2026, 4:04 p.m.
Created at: March 8, 2026, 3:07 p.m.