{"schema":"vela.problem-packet.v0.1","problem":184,"statement":"Any graph on $n$ vertices can be decomposed into $O(n)$ many edge-disjoint cycles and edges.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[{"id":"att_d48f4f53fcd87db4","kind":"dead_end","claim":"attempted via frontier '?' (transfer_strength=n/a) -> 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)"}