Triple
T14030521
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Pisano period |
E337574
|
entity |
| Predicate | alsoKnownAs |
P39
|
FINISHED |
| Object | Pisano period modulo n |
E337574
|
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: Pisano period modulo n | Statement: [Pisano period, alsoKnownAs, Pisano period modulo n]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Pisano period modulo n Context triple: [Pisano period, alsoKnownAs, Pisano period modulo n]
-
A.
Pisano period
chosen
The Pisano period is the repeating cycle length of Fibonacci numbers when taken modulo a given integer.
-
B.
Lucas sequences
Lucas sequences are a family of integer sequences defined by the same type of second-order linear recurrence as the Fibonacci numbers but with more general initial conditions, encompassing the Fibonacci sequence as a special case.
-
C.
Euler’s totient function φ(n)
Euler’s totient function φ(n) is a fundamental arithmetic function in number theory that counts the positive integers up to n that are relatively prime to n and plays a key role in topics such as modular arithmetic and cryptography.
-
D.
Gaussian periods
Gaussian periods are special algebraic sums of roots of unity that play a key role in number theory, particularly in constructing regular polygons like the 17-gon with straightedge and compass and in understanding cyclotomic fields.
-
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_69d81c6543a48190bd5ba93d7419e797 |
completed | April 9, 2026, 9:38 p.m. |
| NER | Named-entity recognition | batch_69de2fa9f8248190930954d609dee5f1 |
completed | April 14, 2026, 12:14 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fbc335a474819084c310b10e0ded9a |
completed | May 6, 2026, 10:39 p.m. |
Created at: April 9, 2026, 10:20 p.m.