kalai-2023-good-turing-concentration-bound

OUT premise — summaries/2026/08/24/kalai-2023-hallucination-inevitable-sR-references.md

Created 2026-08-24T17:10:59+00:00

The Good-Turing concentration bound establishes that |p(U) − dMF| ≤ 3√(ln(4/δ)/n) with probability ≥ 1−δ, so the monofact estimate concentrates around the true missing-facts rate at rate O(1/√n).