Triple

T12597189
Position Surface form Disambiguated ID Type / Status
Subject Mertens’ theorems E300762 entity
Predicate relatedTo P37 FINISHED
Object Prime Number Theorem E259759 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: Prime Number Theorem | Statement: [Mertens’ theorems, relatedTo, Prime Number Theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Prime Number Theorem
Context triple: [Mertens’ theorems, relatedTo, 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. 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.
  • D. 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.
  • E. Ü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.
  • 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_69d7bdea2ca881908f379526c13b1145 completed April 9, 2026, 2:55 p.m.
NER Named-entity recognition batch_69d954cf33b88190bff339fcd3142cc8 completed April 10, 2026, 7:51 p.m.
NED1 Entity disambiguation (via context triple) batch_69f668679dfc8190ac05eeb200f23985 completed May 2, 2026, 9:11 p.m.
Created at: April 9, 2026, 5:08 p.m.