Triple
T14265435
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Wacław Sierpiński |
E353630
|
entity |
| Predicate | notableIdea |
P4
|
FINISHED |
| Object |
Sierpiński number
A Sierpiński number is an odd positive integer k such that k·2ⁿ + 1 is composite for all natural numbers n, making it central to a famous unsolved problem in number theory.
|
E1090235
|
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: Sierpiński number | Statement: [Wacław Sierpiński, notableIdea, Sierpiński number]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Sierpiński number Context triple: [Wacław Sierpiński, notableIdea, Sierpiński number]
-
A.
Fermat number
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.
Carmichael number
A Carmichael number is a composite integer that nonetheless satisfies Fermat's primality test for all bases coprime to it, making it a classic example of a Fermat pseudoprime.
-
C.
Blum integer
A Blum integer is a special type of composite number formed as the product of two distinct prime numbers each congruent to 3 modulo 4, widely used in cryptography and pseudorandom number generation.
-
D.
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.
-
E.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
- 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: Sierpiński number Triple: [Wacław Sierpiński, notableIdea, Sierpiński number]
Generated description
A Sierpiński number is an odd positive integer k such that k·2ⁿ + 1 is composite for all natural numbers n, making it central to a famous unsolved problem in number theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Sierpiński number Target entity description: A Sierpiński number is an odd positive integer k such that k·2ⁿ + 1 is composite for all natural numbers n, making it central to a famous unsolved problem in number theory.
-
A.
Fermat number
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.
Carmichael number
A Carmichael number is a composite integer that nonetheless satisfies Fermat's primality test for all bases coprime to it, making it a classic example of a Fermat pseudoprime.
-
C.
Blum integer
A Blum integer is a special type of composite number formed as the product of two distinct prime numbers each congruent to 3 modulo 4, widely used in cryptography and pseudorandom number generation.
-
D.
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.
-
E.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
- 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_69d8278c43e08190824146f4632b89a5 |
completed | April 9, 2026, 10:26 p.m. |
| NER | Named-entity recognition | batch_69de6357a8188190ba518a486521052b |
completed | April 14, 2026, 3:55 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fd326551b08190ae8fe220a6422339 |
completed | May 8, 2026, 12:46 a.m. |
| NEDg | Description generation | batch_69fd3417e8e88190b099bfe4ba30f364 |
completed | May 8, 2026, 12:53 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69fd37df3dfc8190a594abb2c14e11bb |
completed | May 8, 2026, 1:09 a.m. |
Created at: April 10, 2026, 1:09 a.m.