Triple
T4552478
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hardy–Littlewood conjectures |
E120396
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
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.
|
E451528
|
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: Bateman–Horn conjecture | Statement: [Hardy–Littlewood conjectures, relatedTo, Bateman–Horn conjecture]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bateman–Horn conjecture Context triple: [Hardy–Littlewood conjectures, relatedTo, Bateman–Horn conjecture]
-
A.
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.
-
B.
Ramanujan–Petersson conjecture
The Ramanujan–Petersson conjecture is a fundamental statement in number theory and the theory of modular forms that predicts strong bounds on the Fourier coefficients of modular cusp forms, with deep connections to automorphic forms and the Langlands program.
-
C.
Birch and Swinnerton-Dyer Conjecture
The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
-
D.
Chebotarev density theorem
The Chebotarev density theorem is a fundamental result in algebraic number theory that generalizes the prime number theorem to describe how often primes in a number field have a given Frobenius conjugacy class in its Galois group.
-
E.
Green–Tao theorem
The Green–Tao theorem is a landmark result in number theory proving that the sequence of prime numbers contains arbitrarily long arithmetic progressions.
- 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: Bateman–Horn conjecture Triple: [Hardy–Littlewood conjectures, relatedTo, Bateman–Horn conjecture]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bateman–Horn conjecture Target entity description: 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.
-
A.
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.
-
B.
Ramanujan–Petersson conjecture
The Ramanujan–Petersson conjecture is a fundamental statement in number theory and the theory of modular forms that predicts strong bounds on the Fourier coefficients of modular cusp forms, with deep connections to automorphic forms and the Langlands program.
-
C.
Birch and Swinnerton-Dyer Conjecture
The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
-
D.
Chebotarev density theorem
The Chebotarev density theorem is a fundamental result in algebraic number theory that generalizes the prime number theorem to describe how often primes in a number field have a given Frobenius conjugacy class in its Galois group.
-
E.
Green–Tao theorem
The Green–Tao theorem is a landmark result in number theory proving that the sequence of prime numbers contains arbitrarily long arithmetic progressions.
- 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_69bd4636f1648190a701445c2fcd9c17 |
completed | March 20, 2026, 1:05 p.m. |
| NER | Named-entity recognition | batch_69bd581160e08190b715a8ce5c3e6c9b |
completed | March 20, 2026, 2:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bdb95b01b0819094a600752e41aa09 |
completed | March 20, 2026, 9:17 p.m. |
| NEDg | Description generation | batch_69bdbdbf73508190b64a78ff9274ee6d |
completed | March 20, 2026, 9:35 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69bdbe1bcd8c819094adea59c91c6f5b |
completed | March 20, 2026, 9:37 p.m. |
Created at: March 20, 2026, 1:09 p.m.