Triple
T4746233
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Peter Gustav Lejeune Dirichlet |
E105365
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Dirichlet's theorem on arithmetic progressions
Dirichlet's theorem on arithmetic progressions is a fundamental result in number theory stating that any arithmetic progression with first term and difference coprime contains infinitely many prime numbers.
|
E466245
|
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: Dirichlet's theorem on arithmetic progressions | Statement: [Peter Gustav Lejeune Dirichlet, notableWork, Dirichlet's theorem on arithmetic progressions]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dirichlet's theorem on arithmetic progressions Context triple: [Peter Gustav Lejeune Dirichlet, notableWork, Dirichlet's theorem on arithmetic progressions]
-
A.
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.
-
B.
Vinogradov's three-primes theorem
Vinogradov's three-primes theorem is a landmark result in analytic number theory proving that every sufficiently large odd integer can be expressed as the sum of three prime numbers.
-
C.
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.
-
D.
Über die Anzahl der Primzahlen unter einer gegebenen Grösse
Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
-
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: Dirichlet's theorem on arithmetic progressions Triple: [Peter Gustav Lejeune Dirichlet, notableWork, Dirichlet's theorem on arithmetic progressions]
Generated description
Dirichlet's theorem on arithmetic progressions is a fundamental result in number theory stating that any arithmetic progression with first term and difference coprime contains infinitely many prime numbers.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Dirichlet's theorem on arithmetic progressions Target entity description: Dirichlet's theorem on arithmetic progressions is a fundamental result in number theory stating that any arithmetic progression with first term and difference coprime contains infinitely many prime numbers.
-
A.
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.
-
B.
Vinogradov's three-primes theorem
Vinogradov's three-primes theorem is a landmark result in analytic number theory proving that every sufficiently large odd integer can be expressed as the sum of three prime numbers.
-
C.
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.
-
D.
Über die Anzahl der Primzahlen unter einer gegebenen Grösse
Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
-
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
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_69bd43ef87a48190a5bc3600711aa032 |
completed | March 20, 2026, 12:56 p.m. |
| NER | Named-entity recognition | batch_69bd64c3fcb081909b1fe867b4adac8b |
completed | March 20, 2026, 3:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69be3a40bee88190ae97f6d409b51e96 |
completed | March 21, 2026, 6:27 a.m. |
| NEDg | Description generation | batch_69be3af59ef88190a5acc493978d412e |
completed | March 21, 2026, 6:30 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69be3c8533fc8190b512d3fec34e7e28 |
completed | March 21, 2026, 6:36 a.m. |
Created at: March 20, 2026, 1:20 p.m.