Triple
T4597240
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kronecker’s lemma |
E100233
|
entity |
| Predicate | usedIn |
P98
|
FINISHED |
| Object | Tauberian theory |
E451517
|
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: Tauberian theory | Statement: [Kronecker’s lemma, usedIn, Tauberian theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Tauberian theory Context triple: [Kronecker’s lemma, usedIn, Tauberian theory]
-
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.
Khinchin–Pollaczek formula
The Khinchin–Pollaczek formula is a result in probability theory and queueing theory that provides an explicit expression for the stationary waiting-time distribution in certain single-server queues.
-
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.
Khinchin's representation theorem
Khinchin's representation theorem is a result in probability theory that characterizes stationary stochastic processes by representing them in terms of simpler, more fundamental random components.
-
E.
Khinchin's law of the iterated logarithm
Khinchin's law of the iterated logarithm is a fundamental result in probability theory that precisely characterizes the almost-sure fluctuations of partial sums of independent random variables on the scale of the square root of twice the product of their variance and the iterated logarithm of the sample size.
- 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_69bd43cbc014819098b45f435908f88a |
completed | March 20, 2026, 12:55 p.m. |
| NER | Named-entity recognition | batch_69bd59420c108190b5c2c5039e964da5 |
completed | March 20, 2026, 2:27 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bdfa4a99c88190b7332fd2e1799b3a |
completed | March 21, 2026, 1:54 a.m. |
Created at: March 20, 2026, 1:11 p.m.