Triple

T21494453
Position Surface form Disambiguated ID Type / Status
Subject analytic number theory E530316 entity
Predicate centralTheorem P16614 FINISHED
Object prime number theorem NE NERFINISHED

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: prime number theorem | Statement: [analytic number theory, centralTheorem, prime number theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: prime number theorem
Context triple: [analytic number theory, centralTheorem, prime number theorem]
  • A. prime number theorem chosen
    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.
  • B. Erdős–Kac theorem
    The Erdős–Kac theorem is a fundamental result in probabilistic number theory stating that the number of distinct prime factors of a typical integer behaves like a normally distributed random variable.
  • 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. 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.
  • E. 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.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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.