Triple
T14704224
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Émile Borel |
E345382
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Borel–Kolmogorov paradox
The Borel–Kolmogorov paradox is a famous example in probability theory showing that conditional probabilities on events of measure zero can be ambiguous without specifying the underlying limiting procedure or σ-algebra.
|
E1116058
|
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–Kolmogorov paradox | Statement: [Émile Borel, notableWork, Borel–Kolmogorov paradox]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Borel–Kolmogorov paradox Context triple: [Émile Borel, notableWork, Borel–Kolmogorov paradox]
-
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.
Mazurkiewicz–Sierpiński paradox
The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
-
C.
Kolmogorov axioms
The Kolmogorov axioms are the standard mathematical foundation of probability theory, formalizing probabilities as measures on a sigma-algebra that satisfy non-negativity, normalization, and countable additivity.
-
D.
Banach–Tarski paradox
The Banach–Tarski paradox is a theorem in set-theoretic geometry stating that a solid ball in 3‑dimensional space can be decomposed into finitely many non-measurable pieces and reassembled into two identical copies of the original ball, highlighting counterintuitive consequences of the axiom of choice.
-
E.
St. Petersburg paradox
The St. Petersburg paradox is a famous problem in probability theory and economics that highlights how a lottery with an infinite expected payoff can still attract only a finite price from rational gamblers, challenging traditional notions of expected value and decision-making under risk.
- 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–Kolmogorov paradox Triple: [Émile Borel, notableWork, Borel–Kolmogorov paradox]
Generated description
The Borel–Kolmogorov paradox is a famous example in probability theory showing that conditional probabilities on events of measure zero can be ambiguous without specifying the underlying limiting procedure or σ-algebra.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Borel–Kolmogorov paradox Target entity description: The Borel–Kolmogorov paradox is a famous example in probability theory showing that conditional probabilities on events of measure zero can be ambiguous without specifying the underlying limiting procedure or σ-algebra.
-
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.
Mazurkiewicz–Sierpiński paradox
The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
-
C.
Kolmogorov axioms
The Kolmogorov axioms are the standard mathematical foundation of probability theory, formalizing probabilities as measures on a sigma-algebra that satisfy non-negativity, normalization, and countable additivity.
-
D.
Banach–Tarski paradox
The Banach–Tarski paradox is a theorem in set-theoretic geometry stating that a solid ball in 3‑dimensional space can be decomposed into finitely many non-measurable pieces and reassembled into two identical copies of the original ball, highlighting counterintuitive consequences of the axiom of choice.
-
E.
St. Petersburg paradox
The St. Petersburg paradox is a famous problem in probability theory and economics that highlights how a lottery with an infinite expected payoff can still attract only a finite price from rational gamblers, challenging traditional notions of expected value and decision-making under risk.
- 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_69d822e4a8c08190a155df736bb7bc13 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69deb6071e5c8190bb5509c859135c2d |
completed | April 14, 2026, 9:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fdf087ce8c819081a7186df67bcf1f |
completed | May 8, 2026, 2:17 p.m. |
| NEDg | Description generation | batch_69fdf2a63cc88190b3670378c54c96b6 |
completed | May 8, 2026, 2:26 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69fdf31fcb4081908a88cf4d4c5ddced |
completed | May 8, 2026, 2:28 p.m. |
Created at: April 10, 2026, 1:28 a.m.