Triple
T13444075
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kolmogorov zero–one law |
E320434
|
entity |
| Predicate | typeOfResult |
P2702
|
FINISHED |
| Object | zero–one law |
E320434
|
NE 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: zero–one law | Statement: [Kolmogorov zero–one law, typeOfResult, zero–one law]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: zero–one law Context triple: [Kolmogorov zero–one law, typeOfResult, zero–one law]
-
A.
Kolmogorov zero–one law
chosen
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.
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.
-
C.
Szemerényi's law
Szemerényi's law is a sound law in Proto-Indo-European linguistics that explains the loss of certain final consonants with compensatory lengthening of the preceding vowel.
-
D.
Low’s theorem
Low’s theorem is a result in quantum electrodynamics that constrains the behavior of scattering amplitudes involving the emission of low-energy (soft) photons.
-
E.
Kesten’s theorem
Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_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. |
Created at: April 9, 2026, 9:40 p.m.