Triple
T19039821
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Mark Pinsker |
E465972
|
entity |
| Predicate | notableFor |
P22
|
FINISHED |
| Object |
Pinsker's inequality
Pinsker's inequality is a fundamental result in information theory that bounds the total variation distance between two probability distributions in terms of their Kullback–Leibler divergence.
|
E1355537
|
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: Pinsker's inequality | Statement: [Mark Pinsker, notableFor, Pinsker's inequality]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Pinsker's inequality Context triple: [Mark Pinsker, notableFor, Pinsker's inequality]
-
A.
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.
-
B.
Fano inequality
Fano inequality is a fundamental result in information theory that provides a lower bound on the probability of classification or decoding error in terms of conditional entropy.
-
C.
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.
-
D.
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.
-
E.
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.
- 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: Pinsker's inequality Triple: [Mark Pinsker, notableFor, Pinsker's inequality]
Generated description
Pinsker's inequality is a fundamental result in information theory that bounds the total variation distance between two probability distributions in terms of their Kullback–Leibler divergence.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Pinsker's inequality Target entity description: Pinsker's inequality is a fundamental result in information theory that bounds the total variation distance between two probability distributions in terms of their Kullback–Leibler divergence.
-
A.
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.
-
B.
Fano inequality
Fano inequality is a fundamental result in information theory that provides a lower bound on the probability of classification or decoding error in terms of conditional entropy.
-
C.
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.
-
D.
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.
-
E.
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.
- 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_69d8dd0359648190bc2a9202c5cf29d2 |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5d7ff9b6c8190adc3917a8c9af7bd |
completed | April 20, 2026, 7:38 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a05c549a6208190bb5258e49d868fea |
completed | May 14, 2026, 12:51 p.m. |
| NEDg | Description generation | batch_6a05c79185d88190801c95dc2aa229fd |
completed | May 14, 2026, 1:01 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a05c7e595688190872825ac7165dcc0 |
completed | May 14, 2026, 1:02 p.m. |
Created at: April 10, 2026, 12:02 p.m.