Whether every finite bridgeless loopless multigraph has a cycle double cover.
The archive currently tracks the recent AI-produced proof claim and public Lean formalization. Its status remains dated because formal checking, statement fidelity, novelty, and wider mathematical acceptance are distinct questions.