{"schema":"vela.problem-packet.v0.1","problem":64,"statement":"Does every finite graph with minimum degree at least 3 contain a cycle of length $2^k$ for some $k\\geq 2$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}