Triple

T14314179
Position Surface form Disambiguated ID Type / Status
Subject Bernstein inequalities E354909 entity
Predicate givesUpperBoundOn P96513 FINISHED
Object tail probabilities of sums of random variables LITERAL 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: tail probabilities of sums of random variables | Statement: [Bernstein inequalities, givesUpperBoundOn, tail probabilities of sums of random variables]
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: givesUpperBoundOn
Context triple: [Bernstein inequalities, givesUpperBoundOn, tail probabilities of sums of random variables]
  • A. givesBoundOn chosen
    Indicates that one quantity provides an upper or lower limit (a bound) on the value or behavior of another quantity.
  • B. isUpperBoundFor
    Indicates that one value is greater than or equal to every element in a given set or collection, serving as an upper limit for them.
  • C. boundedByApprox
    Indicates that one quantity is constrained by another within an approximate or tolerance-based bound, rather than an exact strict limit.
  • D. isBoundedBelow
    Indicates that every value in a set or function is greater than or equal to some fixed lower bound.
  • E. hasCommonWorkingDefinitionUpperBound
    Indicates that two or more entities share the same maximum value or limit in their commonly accepted working definition.
  • F. None of above.

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_69d8278ed42c8190b9f882dcce611347 completed April 9, 2026, 10:26 p.m.
NER Named-entity recognition batch_69de85b49e5481909b9ffab2d922e284 completed April 14, 2026, 6:21 p.m.
PD Predicate disambiguation batch_69de2a9515f4819081aabf251bca5878 completed April 14, 2026, 11:52 a.m.
Created at: April 10, 2026, 1:12 a.m.