Triple

T13444054
Position Surface form Disambiguated ID Type / Status
Subject Kolmogorov zero–one law E320434 entity
Predicate relatedTo P37 FINISHED
Object Borel–Cantelli lemmas
The Borel–Cantelli lemmas are fundamental results in probability theory that characterize when events occur infinitely often or only finitely often, based on the convergence or divergence of the sum of their probabilities.
E1041768 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: Borel–Cantelli lemmas | Statement: [Kolmogorov zero–one law, relatedTo, Borel–Cantelli lemmas]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Borel–Cantelli lemmas
Context triple: [Kolmogorov zero–one law, relatedTo, Borel–Cantelli lemmas]
  • A. Kolmogorov zero–one law
    The Kolmogorov zero–one law is a fundamental result in probability theory stating that certain events determined by the tail behavior of independent random variables must have probability either zero or one.
  • B. Khinchin's law of the iterated logarithm
    Khinchin's law of the iterated logarithm is a fundamental result in probability theory that precisely characterizes the almost-sure fluctuations of partial sums of independent random variables on the scale of the square root of twice the product of their variance and the iterated logarithm of the sample size.
  • C. Erdős–Rényi law of large numbers
    The Erdős–Rényi law of large numbers is a refinement of the classical law of large numbers that provides precise asymptotic behavior and convergence rates for sums of independent random variables, developed by mathematicians Pál Erdős and Alfréd Rényi.
  • D. Limit Laws for Sums of Independent Random Variables
    Limit Laws for Sums of Independent Random Variables is a foundational mathematical work that systematically develops the theory of probability limit theorems, including results such as the law of large numbers and central limit behavior for sums of independent random variables.
  • E. Cramér’s theorem in large deviations
    Cramér’s theorem in large deviations is a fundamental result in probability theory that characterizes the exponential decay rate of tail probabilities for sums of independent, identically distributed random variables via a convex rate function.
  • 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: Borel–Cantelli lemmas
Triple: [Kolmogorov zero–one law, relatedTo, Borel–Cantelli lemmas]
Generated description
The Borel–Cantelli lemmas are fundamental results in probability theory that characterize when events occur infinitely often or only finitely often, based on the convergence or divergence of the sum of their probabilities.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Borel–Cantelli lemmas
Target entity description: The Borel–Cantelli lemmas are fundamental results in probability theory that characterize when events occur infinitely often or only finitely often, based on the convergence or divergence of the sum of their probabilities.
  • A. Kolmogorov zero–one law
    The Kolmogorov zero–one law is a fundamental result in probability theory stating that certain events determined by the tail behavior of independent random variables must have probability either zero or one.
  • B. Khinchin's law of the iterated logarithm
    Khinchin's law of the iterated logarithm is a fundamental result in probability theory that precisely characterizes the almost-sure fluctuations of partial sums of independent random variables on the scale of the square root of twice the product of their variance and the iterated logarithm of the sample size.
  • C. Erdős–Rényi law of large numbers
    The Erdős–Rényi law of large numbers is a refinement of the classical law of large numbers that provides precise asymptotic behavior and convergence rates for sums of independent random variables, developed by mathematicians Pál Erdős and Alfréd Rényi.
  • D. Limit Laws for Sums of Independent Random Variables
    Limit Laws for Sums of Independent Random Variables is a foundational mathematical work that systematically develops the theory of probability limit theorems, including results such as the law of large numbers and central limit behavior for sums of independent random variables.
  • E. Cramér’s theorem in large deviations
    Cramér’s theorem in large deviations is a fundamental result in probability theory that characterizes the exponential decay rate of tail probabilities for sums of independent, identically distributed random variables via a convex rate function.
  • 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_69d80761e6cc8190a90c844589998ecc completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbaee881888190811ddf01bc699864 completed April 12, 2026, 2:40 p.m.
NED1 Entity disambiguation (via context triple) batch_69f739965ef081909e85881ce805bbb5 completed May 3, 2026, 12:03 p.m.
NEDg Description generation batch_69f740e536d48190af369b38aa42438d completed May 3, 2026, 12:34 p.m.
NED2 Entity disambiguation (via description) batch_69f741b72d08819087808bf9bcffa0a1 completed May 3, 2026, 12:38 p.m.
Created at: April 9, 2026, 9:40 p.m.