The large even-subgraph 5-cycle double cover conjecture

A 5-cycle double cover ($5$-CDC) of a graph $G$ is a collection ${\cal C}=(E_0,\ldots,E_4)$ of five cycles such that every edge belongs to exactly two of them. Large even-subgraph 5-CDC conjecture. Every bridgeless graph $G$ admits a $5$-CDC ${\cal C}=(E_0,\ldots,E_4)$ such that

$$|E_0|\geq \frac{3}{5}|E(G)|.$$

The paper presents this as a seemingly stronger version of the 5-cycle double cover conjecture and notes that the Petersen coloring conjecture implies its restriction to cubic graphs. The general statement remains open.