Triple
T7705144
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Carl-Gustav Esseen |
E174593
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Esseen’s inequality |
E32545
|
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: Esseen’s inequality | Statement: [Carl-Gustav Esseen, notableWork, Esseen’s inequality]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Esseen’s inequality Context triple: [Carl-Gustav Esseen, notableWork, Esseen’s inequality]
-
A.
Berry–Esseen theorem
chosen
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
-
B.
Chebyshev inequalities
Chebyshev inequalities are probabilistic bounds that limit how much a random variable’s values can deviate from its mean in terms of its variance.
-
C.
Karamata's inequality
Karamata's inequality is a fundamental result in majorization theory that generalizes several classical inequalities by comparing sums of convex (or concave) functions over majorized sequences.
-
D.
Khinchin–Kahane type inequalities
Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
-
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_69c6995b3e8c8190833108f883d5f53c |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c7028f17f0819081686ac146750d3a |
completed | March 27, 2026, 10:19 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8acc088148190ba5ba07e4ad2284c |
completed | March 29, 2026, 4:38 a.m. |
Created at: March 27, 2026, 4:03 p.m.