Claims

../

2019_04_09_balister_bollobas_morris_sahasrabudhe_tiba: The minimal covering systems built by Balister, Bollobás, Morris, Sahasrabudhe and Tiba (J. Eur. Math. Soc. 2024) give, as the site derives, F(x) >= exp((log x)^(3-o(1))); refereed; a lower bound only.

2026_07_12_snyder: Colin Snyder's 2026 claim, produced by Star Fleet Math's GPT 5.6 harness, that the number of minimal distinct covering systems with moduli at most x satisfies log log F(x)/log x -> 1, with a Lean 4 proof; no review recorded.

---