Triple
T5570689
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fermat number |
E146191
|
entity |
| Predicate | hasSequenceName |
P64874
|
FINISHED |
| Object | Fermat numbers |
E146191
|
NE FINISHED |
How this triple was built (3 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: Fermat numbers | Statement: [Fermat number, hasSequenceName, Fermat numbers]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fermat numbers Context triple: [Fermat number, hasSequenceName, Fermat numbers]
-
A.
Fermat number
chosen
A Fermat number is a special type of integer of the form \(F_n = 2^{2^n} + 1\), studied in number theory for its intriguing properties related to primality and constructible polygons.
-
B.
Fermat polygonal number theorem
The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
-
C.
Fermat's theorem on sums of two squares
Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
-
D.
Bernoulli numbers
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasSequenceName Context triple: [Fermat number, hasSequenceName, Fermat numbers]
-
A.
hasCollectionNamedAfter
Indicates that an entity has a collection (e.g., of works, items, or artifacts) that is named in honor of or after another entity.
-
B.
hasGenericName
Indicates that an entity is associated with a non-brand, generic name that designates its general type or class.
-
C.
hasSuccessorNameConflict
Indicates that an entity’s successor has a name that conflicts (e.g., duplicates or clashes) with another existing or expected name in the system.
-
D.
hasGivenNameUsage
Indicates that an entity is associated with a particular way or context in which its given name is used.
-
E.
hasComponentName
Indicates that an entity includes or is associated with a component identified by a specific name.
- 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_69c008ffed108190a084602227af6157 |
completed | March 22, 2026, 3:21 p.m. |
| NER | Named-entity recognition | batch_69c020502a288190af37f9ebb88fccae |
completed | March 22, 2026, 5:01 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c0284bb71881908c0ac4ea2a302327 |
completed | March 22, 2026, 5:35 p.m. |
| PD | Predicate disambiguation | batch_69c01b12826c8190969a584d0f53aa44 |
completed | March 22, 2026, 4:38 p.m. |
| PDg | Predicate description generation | batch_69c01f4032408190a4f0d2eb21ebd870 |
completed | March 22, 2026, 4:56 p.m. |
Created at: March 22, 2026, 3:37 p.m.