Triple

T21494459
Position Surface form Disambiguated ID Type / Status
Subject analytic number theory E530316 entity
Predicate centralTheorem P16614 FINISHED
Object Pólya–Vinogradov inequality NE NERFINISHED

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: Pólya–Vinogradov inequality | Statement: [analytic number theory, centralTheorem, Pólya–Vinogradov inequality]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Pólya–Vinogradov inequality
Context triple: [analytic number theory, centralTheorem, Pólya–Vinogradov inequality]
  • A. 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.
  • B. Turán–Kubilius inequality
    The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
  • C. Siegel–Walfisz theorem
    The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
  • D. Chebyshev’s estimates for π(x)
    Chebyshev’s estimates for π(x) are 19th-century bounds on the prime-counting function that showed it grows on the order of x/log x and provided a crucial precursor to the prime number theorem.
  • E. 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.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Pólya–Vinogradov inequality
Target entity description: The Pólya–Vinogradov inequality is a fundamental result in analytic number theory that gives a strong upper bound on character sums, playing a key role in the study of Dirichlet characters and the distribution of primes in arithmetic progressions.
  • A. 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.
  • B. Turán–Kubilius inequality
    The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
  • C. Siegel–Walfisz theorem
    The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
  • D. Chebyshev’s estimates for π(x)
    Chebyshev’s estimates for π(x) are 19th-century bounds on the prime-counting function that showed it grows on the order of x/log x and provided a crucial precursor to the prime number theorem.
  • E. 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.
  • F. None of above. chosen

Provenance (2 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_69e0c45bd15481909fba5910765cdda2 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69e9ea567244819091863350fedae3ae completed April 23, 2026, 9:45 a.m.
Created at: April 16, 2026, 6:23 p.m.