Triple

T14314176
Position Surface form Disambiguated ID Type / Status
Subject Bernstein inequalities E354909 entity
Predicate relatedTo P37 FINISHED
Object Azuma–Hoeffding inequality
The Azuma–Hoeffding inequality is a concentration inequality that bounds the probability of large deviations for martingales with bounded differences, generalizing Hoeffding’s inequality to dependent sequences.
E1096273 NE FINISHED

How this triple was built (4 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: Azuma–Hoeffding inequality | Statement: [Bernstein inequalities, relatedTo, Azuma–Hoeffding inequality]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Azuma–Hoeffding inequality
Context triple: [Bernstein inequalities, relatedTo, Azuma–Hoeffding inequality]
  • A. Chernoff bound
    The Chernoff bound is a probabilistic inequality that gives exponentially decreasing upper bounds on the tail probabilities of sums of independent random variables.
  • 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. Bennett inequality
    Bennett inequality is a probabilistic bound that provides exponential tail estimates for sums of independent random variables, refining classical concentration inequalities like Bernstein’s.
  • D. Berry–Esseen theorem
    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.
  • E. Doob’s maximal inequalities
    Doob’s maximal inequalities are fundamental results in probability theory that provide bounds on the maximum value of a martingale or submartingale in terms of its expected terminal value, playing a key role in convergence and limit theorems.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Azuma–Hoeffding inequality
Triple: [Bernstein inequalities, relatedTo, Azuma–Hoeffding inequality]
Generated description
The Azuma–Hoeffding inequality is a concentration inequality that bounds the probability of large deviations for martingales with bounded differences, generalizing Hoeffding’s inequality to dependent sequences.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Azuma–Hoeffding inequality
Target entity description: The Azuma–Hoeffding inequality is a concentration inequality that bounds the probability of large deviations for martingales with bounded differences, generalizing Hoeffding’s inequality to dependent sequences.
  • A. Chernoff bound
    The Chernoff bound is a probabilistic inequality that gives exponentially decreasing upper bounds on the tail probabilities of sums of independent random variables.
  • 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. Bennett inequality
    Bennett inequality is a probabilistic bound that provides exponential tail estimates for sums of independent random variables, refining classical concentration inequalities like Bernstein’s.
  • D. Berry–Esseen theorem
    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.
  • E. Doob’s maximal inequalities
    Doob’s maximal inequalities are fundamental results in probability theory that provide bounds on the maximum value of a martingale or submartingale in terms of its expected terminal value, playing a key role in convergence and limit theorems.
  • F. None of above. chosen

Provenance (5 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_69d8278ed42c8190b9f882dcce611347 completed April 9, 2026, 10:26 p.m.
NER Named-entity recognition batch_69de85b49e5481909b9ffab2d922e284 completed April 14, 2026, 6:21 p.m.
NED1 Entity disambiguation (via context triple) batch_69fd4c36a8b48190a3987b1026b3da65 completed May 8, 2026, 2:36 a.m.
NEDg Description generation batch_69fd5020e6f081909686fe3d143d31fa completed May 8, 2026, 2:53 a.m.
NED2 Entity disambiguation (via description) batch_69fd50c2cdb48190a438dc0641e3c25e completed May 8, 2026, 2:56 a.m.
Created at: April 10, 2026, 1:12 a.m.