Triple
T6938635
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | The Book of Numbers |
E160615
|
entity |
| Predicate | coversTopic |
P380
|
FINISHED |
| Object | Fibonacci numbers |
E67350
|
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: Fibonacci numbers | Statement: [The Book of Numbers, coversTopic, Fibonacci numbers]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fibonacci numbers Context triple: [The Book of Numbers, coversTopic, Fibonacci numbers]
-
A.
Fibonacci sequence
chosen
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.
Zeckendorf
Zeckendorf is a surname most notably associated with American real estate developer William Zeckendorf and his influential role in mid-20th-century urban development.
-
C.
Pisano period
The Pisano period is the repeating cycle length of Fibonacci numbers when taken modulo a given integer.
-
D.
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.
-
E.
Sylvester sequence
The Sylvester sequence is an integer sequence defined recursively where each term is one more than the product of all previous terms, yielding rapidly growing, pairwise coprime numbers closely related to Egyptian fraction representations.
- 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_69c6884f3db4819080ad65da69386206 |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6da62d2f88190968d3fea538a95c9 |
completed | March 27, 2026, 7:28 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c7515509148190b5739cdf8cd7a28a |
completed | March 28, 2026, 3:56 a.m. |
Created at: March 27, 2026, 2:28 p.m.