{"schema":"vela.problem-packet.v0.1","problem":348,"statement":"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 $A$ remains complete after removing any $m$ elements, but $A$ is not complete after removing any $n$ elements?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[{"id":"att_00e496e00c134e7b","kind":"dead_end","claim":"attempted via frontier 'additive-basis' (transfer_strength=weak) -> no_progress","grade":"honest_null","gateStatus":"needs_verification","superseded":false}],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}