Triple
T7705142
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Carl-Gustav Esseen |
E174593
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Berry–Esseen theorem |
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: Berry–Esseen theorem | Statement: [Carl-Gustav Esseen, knownFor, Berry–Esseen theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Berry–Esseen theorem Context triple: [Carl-Gustav Esseen, knownFor, Berry–Esseen theorem]
-
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.
Lindeberg–Feller central limit theorem
The Lindeberg–Feller central limit theorem is a general form of the central limit theorem that provides conditions under which sums of independent, not necessarily identically distributed random variables converge in distribution to a normal law.
-
C.
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.
-
D.
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.
-
E.
Khinchin–Kolmogorov theorem
The Khinchin–Kolmogorov theorem is a fundamental result in probability theory that provides conditions under which series of independent random variables converge almost surely.
- 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.