{"schema":"vela.problem-packet.v0.1","problem":834,"statement":"Does there exist a $3$-critical $3$-uniform hypergraph in which every vertex has degree $\\geq 7$?","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)"}