Triple
T18479897
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | twin prime conjecture |
E451529
|
entity |
| Predicate | specialCaseOf |
P7025
|
FINISHED |
| Object |
Polignac's conjecture
Polignac's conjecture is an unproven statement in number theory asserting that every even positive integer occurs infinitely often as the difference between consecutive prime numbers.
|
E451529
|
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: Polignac's conjecture | Statement: [twin prime conjecture, specialCaseOf, Polignac's conjecture]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Polignac's conjecture Context triple: [twin prime conjecture, specialCaseOf, Polignac's conjecture]
-
A.
Bunyakovsky conjecture
The Bunyakovsky conjecture is an unproven statement in number theory asserting that certain irreducible integer polynomials with positive leading coefficient take on infinitely many prime values.
-
B.
twin prime conjecture
The twin prime conjecture is an unsolved problem in number theory asserting that there are infinitely many pairs of prime numbers that differ by 2.
-
C.
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.
-
D.
Goldbach conjecture
The Goldbach conjecture is a famous unsolved problem in number theory asserting that every even integer greater than 2 can be expressed as the sum of two prime numbers.
-
E.
Hardy–Littlewood conjectures
The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.
- 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: Polignac's conjecture Triple: [twin prime conjecture, specialCaseOf, Polignac's conjecture]
Generated description
Polignac's conjecture is an unproven statement in number theory asserting that every even positive integer occurs infinitely often as the difference between consecutive prime numbers.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Polignac's conjecture Target entity description: Polignac's conjecture is an unproven statement in number theory asserting that every even positive integer occurs infinitely often as the difference between consecutive prime numbers.
-
A.
Bunyakovsky conjecture
The Bunyakovsky conjecture is an unproven statement in number theory asserting that certain irreducible integer polynomials with positive leading coefficient take on infinitely many prime values.
-
B.
twin prime conjecture
chosen
The twin prime conjecture is an unsolved problem in number theory asserting that there are infinitely many pairs of prime numbers that differ by 2.
-
C.
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.
-
D.
Goldbach conjecture
The Goldbach conjecture is a famous unsolved problem in number theory asserting that every even integer greater than 2 can be expressed as the sum of two prime numbers.
-
E.
Hardy–Littlewood conjectures
The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.
- F. None of above.
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_69d8d38465a0819099b9b42d2a662ac1 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e53066a7108190a50eda9b489c90ca |
completed | April 19, 2026, 7:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a04916189f48190ba0a3196dbcfe4e2 |
completed | May 13, 2026, 2:57 p.m. |
| NEDg | Description generation | batch_6a0491db8c0081909bc90a13ccf17ca8 |
completed | May 13, 2026, 2:59 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a0493148d348190b53330a239d8eeb7 |
completed | May 13, 2026, 3:04 p.m. |
Created at: April 10, 2026, 11:35 a.m.