Triple
T3037539
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Andrei Kolmogorov |
E83045
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
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.
|
E320434
|
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: Kolmogorov zero–one law | Statement: [Andrei Kolmogorov, notableWork, Kolmogorov zero–one law]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kolmogorov zero–one law Context triple: [Andrei Kolmogorov, notableWork, Kolmogorov zero–one law]
-
A.
Kakutani’s random ergodic theorem
Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
-
B.
Khinchin–Kahane type inequalities
Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
-
C.
Carathéodory’s extension theorem
Carathéodory’s extension theorem is a fundamental result in measure theory that guarantees a unique extension of a pre-measure defined on an algebra of sets to a complete measure on the generated σ-algebra.
-
D.
Tonelli's theorem
Tonelli's theorem is a fundamental result in measure theory that justifies interchanging the order of integration for non-negative measurable functions in iterated Lebesgue integrals.
-
E.
Modern Probability Theory and Its Applications
"Modern Probability Theory and Its Applications" is a foundational textbook by Emanuel Parzen that systematically develops modern probability theory and demonstrates its use in a wide range of statistical and applied contexts.
- 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: Kolmogorov zero–one law Triple: [Andrei Kolmogorov, notableWork, Kolmogorov zero–one law]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kolmogorov zero–one law Target entity description: 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.
-
A.
Kakutani’s random ergodic theorem
Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
-
B.
Khinchin–Kahane type inequalities
Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
-
C.
Carathéodory’s extension theorem
Carathéodory’s extension theorem is a fundamental result in measure theory that guarantees a unique extension of a pre-measure defined on an algebra of sets to a complete measure on the generated σ-algebra.
-
D.
Tonelli's theorem
Tonelli's theorem is a fundamental result in measure theory that justifies interchanging the order of integration for non-negative measurable functions in iterated Lebesgue integrals.
-
E.
Modern Probability Theory and Its Applications
"Modern Probability Theory and Its Applications" is a foundational textbook by Emanuel Parzen that systematically develops modern probability theory and demonstrates its use in a wide range of statistical and applied contexts.
- 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_69ad8b2298908190a7cb4e9bdbf064d0 |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69ad9b2cd4988190b52fe3616ecbe9ef |
completed | March 8, 2026, 3:52 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b1dec8778c8190a5e06a29a0218404 |
completed | March 11, 2026, 9:29 p.m. |
| NEDg | Description generation | batch_69b1e2c4aaa88190bb5e39c51d0583f0 |
completed | March 11, 2026, 9:46 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69b1e3228f488190b13c948c6c5d13d0 |
completed | March 11, 2026, 9:48 p.m. |
Created at: March 8, 2026, 3:01 p.m.