Triple
T10991369
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | prime number theorem |
E259759
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Mertens’ theorems |
E300762
|
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: Mertens’ theorems | Statement: [prime number theorem, relatedConcept, Mertens’ theorems]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Mertens’ theorems Context triple: [prime number theorem, relatedConcept, Mertens’ theorems]
-
A.
Mertens’ theorems
chosen
Mertens’ theorems are classical results in analytic number theory that give precise asymptotic estimates for sums involving the Möbius function and the reciprocals of primes, illuminating the distribution of primes and their connection to the Riemann zeta function.
-
B.
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.
-
C.
Baker theorem on linear forms in logarithms
The Baker theorem on linear forms in logarithms is a fundamental result in transcendental number theory that provides explicit lower bounds for nonzero linear combinations of logarithms of algebraic numbers, with powerful applications to Diophantine equations and Diophantine approximation.
-
D.
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.
-
E.
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.
- 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_69d6aa8a6a548190a750f944ccdc8064 |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d795d1e918819090c71f5a077fa15a |
completed | April 9, 2026, 12:04 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e34504ebec8190a78e4795765b0c24 |
completed | April 18, 2026, 8:47 a.m. |
Created at: April 8, 2026, 9:24 p.m.