Triple

T6149924
Position Surface form Disambiguated ID Type / Status
Subject James Joseph Sylvester E137173 entity
Predicate notableWork P4 FINISHED
Object 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.
E571006 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: Sylvester sequence | Statement: [James Joseph Sylvester, notableWork, Sylvester sequence]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Sylvester sequence
Context triple: [James Joseph Sylvester, notableWork, Sylvester sequence]
  • A. Ulam sequence
    The Ulam sequence is an integer sequence starting with 1 and 2 in which each subsequent term is the smallest integer that can be written uniquely as the sum of two distinct earlier terms.
  • B. Look-and-say sequence
    The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
  • C. Pisano period
    The Pisano period is the repeating cycle length of Fibonacci numbers when taken modulo a given integer.
  • D. 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.
  • E. 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.
  • 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: Sylvester sequence
Triple: [James Joseph Sylvester, notableWork, Sylvester sequence]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Sylvester sequence
Target entity description: 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.
  • A. Ulam sequence
    The Ulam sequence is an integer sequence starting with 1 and 2 in which each subsequent term is the smallest integer that can be written uniquely as the sum of two distinct earlier terms.
  • B. Look-and-say sequence
    The look-and-say sequence is a famous integer sequence where each term is generated by verbally describing the digits of the previous term, studied for its surprising combinatorial and growth properties.
  • C. Pisano period
    The Pisano period is the repeating cycle length of Fibonacci numbers when taken modulo a given integer.
  • D. 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.
  • E. 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.
  • 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_69c008a2c6308190a56519b22d55d083 completed March 22, 2026, 3:20 p.m.
NER Named-entity recognition batch_69c05ce329648190a03ba0233df841fa completed March 22, 2026, 9:19 p.m.
NED1 Entity disambiguation (via context triple) batch_69c13608944481909e22df6131a06e41 completed March 23, 2026, 12:46 p.m.
NEDg Description generation batch_69c13679dd58819099036d1119fa370b completed March 23, 2026, 12:47 p.m.
NED2 Entity disambiguation (via description) batch_69c1376db6a0819087c0d0aebc2e2b3e completed March 23, 2026, 12:51 p.m.
Created at: March 22, 2026, 4:16 p.m.