Triple

T19050563
Position Surface form Disambiguated ID Type / Status
Subject Dirichlet's theorem on arithmetic progressions E466245 entity
Predicate generalizes P2372 FINISHED
Object Euclid's theorem on the infinitude of primes 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: Euclid's theorem on the infinitude of primes | Statement: [Dirichlet's theorem on arithmetic progressions, generalizes, Euclid's theorem on the infinitude of primes]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Euclid's theorem on the infinitude of primes
Context triple: [Dirichlet's theorem on arithmetic progressions, generalizes, Euclid's theorem on the infinitude of primes]
  • A. 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.
  • B. Bertrand's postulate
    Bertrand's postulate is a theorem in number theory stating that for every integer n > 1 there is always at least one prime number strictly between n and 2n.
  • 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. prime number theorem
    The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
  • E. 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.
  • 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: Euclid's theorem on the infinitude of primes
Target entity description: Euclid's theorem on the infinitude of primes is a foundational result in number theory proving that there are infinitely many prime numbers.
  • A. 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.
  • B. Bertrand's postulate
    Bertrand's postulate is a theorem in number theory stating that for every integer n > 1 there is always at least one prime number strictly between n and 2n.
  • 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. prime number theorem
    The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
  • E. 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.
  • 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_69d8dd040fb881909af2a964f65ad208 completed April 10, 2026, 11:20 a.m.
NER Named-entity recognition batch_69e5dc02597c8190b39fd2c7b7e42258 completed April 20, 2026, 7:55 a.m.
Created at: April 10, 2026, 12:03 p.m.