A published paper or arXiv preprint answers the main question of Erdős Problem #1188 (theorem erdos_1188 in formal-conjectures) in full (proof, disproof, or the exact value asked for) with no hypotheses beyond the problem's own.

The problem, as stated in formal-conjectures (Apache 2.0):

Call a set of distinct integers 1<n_1<\cdots<n_k with associated congruence classes a_i\pmod{n_i} a distinct covering system if every integer satisfies at least one of these congruences. A minimal distinct covering system is one such that no proper subset forms a covering system. Let F(x) count the number of minimal distinct covering systems with all moduli in [1,x]. Estimate F(x). The estimate is `log(log F(x)) / log x → 1`.