Triple
T1535806
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Berry–Esseen theorem |
E32545
|
entity |
| Predicate | hasGeneralizations |
P2372
|
FINISHED |
| Object | multivariate Berry–Esseen bounds |
E32545
|
NE FINISHED |
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: multivariate Berry–Esseen bounds | Statement: [Berry–Esseen theorem, hasGeneralizations, multivariate Berry–Esseen bounds]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: multivariate Berry–Esseen bounds Context triple: [Berry–Esseen theorem, hasGeneralizations, multivariate Berry–Esseen bounds]
-
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.
Cramér–Rao bound
The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
-
C.
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.
-
D.
Cameron–Martin theorem
The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
-
E.
Statistical Independence in Probability, Analysis and Number Theory
"Statistical Independence in Probability, Analysis and Number Theory" is a mathematical monograph by Mark Kac that explores the concept of independence across probability theory, real analysis, and number theory.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasGeneralizations Context triple: [Berry–Esseen theorem, hasGeneralizations, multivariate Berry–Esseen bounds]
-
A.
generalizationOf
chosen
Indicates that one entity represents a broader, more general concept or category that subsumes or abstracts over another, more specific entity.
-
B.
hasTypeGenus
Indicates that one entity is the type genus that formally defines or represents the taxonomic group of the other entity.
-
C.
hasGeneralPurpose
Indicates that one entity serves as the broad, overarching function, role, or intended use of another entity.
-
D.
hasSubConcept
Indicates that one concept is a more specific, subordinate, or narrower idea within the scope of another, more general concept.
-
E.
hasGenus
Indicates that one entity belongs to, or is classified under, the biological genus represented by the other entity.
- F. None of above.
Provenance (4 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_69a885ea86308190998f6bc14bb91f8e |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69a915f323bc8190aa757142c225e0ae |
completed | March 5, 2026, 5:34 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad295da0988190b1dc171bcdfe4d71 |
completed | March 8, 2026, 7:46 a.m. |
| PD | Predicate disambiguation | batch_69a907b046448190be8ea4d7b20255f7 |
completed | March 5, 2026, 4:33 a.m. |
Created at: March 4, 2026, 7:26 p.m.