Triple

T7833172
Position Surface form Disambiguated ID Type / Status
Subject Lyapunov exponents E181623 entity
Predicate computedBy P89 FINISHED
Object Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
 E695942 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: Benettin algorithm | Statement: [Lyapunov exponents, computedBy, Benettin algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Benettin algorithm
Context triple: [Lyapunov exponents, computedBy, Benettin algorithm]
  • A. 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.
  • B. Cantor–Zassenhaus algorithm
    The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
  • C. Cooley–Tukey Fast Fourier Transform algorithm
    The Cooley–Tukey Fast Fourier Transform algorithm is a widely used, efficient method for computing the discrete Fourier transform that revolutionized digital signal processing and numerical analysis.
  • 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. Blum–Blum–Shub pseudorandom number generator
    The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
  • 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: Benettin algorithm
Triple: [Lyapunov exponents, computedBy, Benettin algorithm]
Generated description
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Benettin algorithm
Target entity description: The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
  • A. 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.
  • B. Cantor–Zassenhaus algorithm
    The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
  • C. Cooley–Tukey Fast Fourier Transform algorithm
    The Cooley–Tukey Fast Fourier Transform algorithm is a widely used, efficient method for computing the discrete Fourier transform that revolutionized digital signal processing and numerical analysis.
  • 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. Blum–Blum–Shub pseudorandom number generator
    The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
  • 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_69ca8284a25c8190a1a20afad30da792 completed March 30, 2026, 2:02 p.m.
NER Named-entity recognition batch_69cb0648bb308190a34fbcd81ff6fda2 completed March 30, 2026, 11:24 p.m.
NED1 Entity disambiguation (via context triple) batch_69cb5a9b7bb081909d6aa066ee064093 completed March 31, 2026, 5:24 a.m.
NEDg Description generation batch_69cb5ded0284819086c40a379b52a5bd completed March 31, 2026, 5:38 a.m.
NED2 Entity disambiguation (via description) batch_69cb765db28881909ac34071ec6889b3 completed March 31, 2026, 7:23 a.m.
Created at: March 30, 2026, 4:45 p.m.