{"schema":"vela.problem-packet.v0.1","problem":63,"statement":"Does every graph with infinite chromatic number contain a cycle of length $2^n$ for infinitely many $n$?","status":"solved","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)"}