Triple

T9297044
Position Surface form Disambiguated ID Type / Status
Subject Chebotarev density theorem E223663 entity
Predicate implies P1661 FINISHED
Object Dirichlet's theorem on arithmetic progressions E466245 NE FINISHED

How this triple was built (2 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: [Chebotarev density theorem, implies, 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: [Chebotarev density theorem, implies, 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. Linnik’s theorem on the least prime in an arithmetic progression
    Linnik’s theorem on the least prime in an arithmetic progression is a result in analytic number theory that gives an explicit upper bound, depending only on the modulus, for the size of the smallest prime in any given coprime residue class.
  • 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. Erdős–Wintner theorem
    The Erdős–Wintner theorem is a fundamental result in probabilistic number theory that characterizes when an additive arithmetic function has a limiting distribution.
  • E. Bombieri–Vinogradov theorem
    The Bombieri–Vinogradov theorem is a major result in analytic number theory that gives strong average estimates for the distribution of prime numbers in arithmetic progressions, approaching what is predicted by the Generalized Riemann Hypothesis.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69ca8423edb08190bc0c91287a484768 completed March 30, 2026, 2:09 p.m.
NER Named-entity recognition batch_69cd089c9c588190967404c9eb938dfb completed April 1, 2026, 11:59 a.m.
NED1 Entity disambiguation (via context triple) batch_69d0b251c4148190a94fafdc23a601d6 completed April 4, 2026, 6:40 a.m.
Created at: March 30, 2026, 7:36 p.m.