A published paper or arXiv preprint answers the main question of Erdős Problem #348 (theorem erdos_348 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):

For what values of 0 \leq m < n is there a complete sequence A = \{a_1 \leq a_2 \leq \cdots\} of integers such that 1. A remains complete after removing any m elements, but 2. A is not complete after removing any n elements. Geneson [Ge26, Theorem 1] proved that the pairs are exactly those with m \leq 1. Completeness allows finitely many exceptions, and deletions remove indexed occurrences.

References formal-conjectures lists for this problem (a starting point, not evidence):

• [Ge26] Geneson, J., Deletion thresholds and exponential examples for complete sequences. arXiv:2609.25107 (2026).