{"schema":"vela.problem-packet.v0.1","problem":361,"statement":"Let $c>0$ and $n$ be some large integer. What is the size of the largest $A\\subseteq \\{1,\\ldots,\\lfloor cn\\rfloor\\}$ such that $n$ is not a sum of a subset of $A$? Does this depend on $n$ in an irregular way?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[{"id":"att_21917b2f843361cd","kind":"dead_end","claim":"attempted via frontier 'additive-basis' (transfer_strength=none) -> 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)"}