Triple
T7833309
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Lyapunov vector |
E181626
|
entity |
| Predicate | computedBy |
P89
|
FINISHED |
| Object | Benettin algorithm |
E695942
|
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: Benettin algorithm | Statement: [Lyapunov vector, computedBy, Benettin algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Benettin algorithm Context triple: [Lyapunov vector, computedBy, Benettin algorithm]
-
A.
Benettin algorithm
chosen
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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- 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_69ca8284a25c8190a1a20afad30da792 |
completed | March 30, 2026, 2:02 p.m. |
| NER | Named-entity recognition | batch_69cb064a47648190af2ca2b336584a92 |
completed | March 30, 2026, 11:24 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cbdef32d4c8190a2e5c76d2db6c45f |
completed | March 31, 2026, 2:49 p.m. |
Created at: March 30, 2026, 4:45 p.m.