Triple
T7030749
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Multiplicative Number Theory |
E163262
|
entity |
| Predicate | hasClassicResult |
P74560
|
FINISHED |
| Object | Dirichlet’s theorem on arithmetic progressions |
E466245
|
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: Dirichlet’s theorem on arithmetic progressions | Statement: [Multiplicative Number Theory, hasClassicResult, 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: [Multiplicative Number Theory, hasClassicResult, Dirichlet’s theorem on arithmetic progressions]
-
A.
Dirichlet's theorem on arithmetic progressions
chosen
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.
-
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.
Ü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.
-
D.
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.
-
E.
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.
- 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: hasClassicResult Context triple: [Multiplicative Number Theory, hasClassicResult, Dirichlet’s theorem on arithmetic progressions]
-
A.
HamIs
Indicates that one entity is identified, classified, or equated as ham in relation to another entity.
-
B.
hasConclusion
Indicates that something leads to, results in, or is associated with a particular conclusion.
-
C.
hasComb
Indicates that an entity possesses or is equipped with a comb.
-
D.
hasClassmate
Indicates that two people attend the same class or course, making them classmates.
-
E.
hasCase
Indicates that one entity is involved in, associated with, or characterized by a particular case, instance, or occurrence represented by another entity.
- 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_69c6885d691c81908cf7d31083113886 |
completed | March 27, 2026, 1:38 p.m. |
| NER | Named-entity recognition | batch_69c6e458ad9c81908c3f492b317ce291 |
completed | March 27, 2026, 8:11 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c7885d83d4819099cc334dd2841f3b |
completed | March 28, 2026, 7:50 a.m. |
| PD | Predicate disambiguation | batch_69c6e1b9a2488190aea351d96afa5a12 |
completed | March 27, 2026, 7:59 p.m. |
| PDg | Predicate description generation | batch_69c6e456e89481908df42a1b4232a4a0 |
completed | March 27, 2026, 8:11 p.m. |
Created at: March 27, 2026, 2:35 p.m.