Triple
T18479416
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tauberian theorems |
E451517
|
entity |
| Predicate | hasSubtype |
P1244
|
FINISHED |
| Object | Ikehara Tauberian theorem |
—
|
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: Ikehara Tauberian theorem | Statement: [Tauberian theorems, hasSubtype, Ikehara Tauberian theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ikehara Tauberian theorem Context triple: [Tauberian theorems, hasSubtype, Ikehara Tauberian theorem]
-
A.
Tauberian theorems
Tauberian theorems are results in mathematical analysis that connect the behavior of transformed series or integrals (such as those summed by Abel or Cesàro methods) back to the asymptotic behavior or convergence of the original sequences or series.
-
B.
Piatetski-Shapiro prime number theorem
The Piatetski-Shapiro prime number theorem is a result in analytic number theory that establishes the existence of infinitely many primes among the values of certain non-integer power sequences, such as ⌊n^c⌋ for suitable real exponents c.
-
C.
Mertens’ theorems
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.
-
D.
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.
-
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. 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: Ikehara Tauberian theorem Target entity description: The Ikehara Tauberian theorem is a key result in analytic number theory that links the boundary behavior of Dirichlet series to asymptotic formulas for arithmetic functions, notably providing a route to the prime number theorem.
-
A.
Tauberian theorems
chosen
Tauberian theorems are results in mathematical analysis that connect the behavior of transformed series or integrals (such as those summed by Abel or Cesàro methods) back to the asymptotic behavior or convergence of the original sequences or series.
-
B.
Piatetski-Shapiro prime number theorem
The Piatetski-Shapiro prime number theorem is a result in analytic number theory that establishes the existence of infinitely many primes among the values of certain non-integer power sequences, such as ⌊n^c⌋ for suitable real exponents c.
-
C.
Mertens’ theorems
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.
-
D.
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.
-
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.
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_69d8d38465a0819099b9b42d2a662ac1 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e53065e8388190bb216dae89f8cf75 |
completed | April 19, 2026, 7:43 p.m. |
Created at: April 10, 2026, 11:35 a.m.