5-cycle double cover Conjecture for bridgeless cubic graphs

Let $G$ be a bridgeless cubic graph. A $5$-cycle double cover is a multiset of five cycles in $G$ such that every edge $e\in E(G)$ belongs to exactly two members of the multiset. 5-cycle double cover Conjecture. Every bridgeless cubic graph has a $5$-cycle double cover. This is one of the standard cycle-cover conjectures for bridgeless cubic graphs and is discussed in the source alongside the Fan–Raspaud and Berge–Fulkerson conjectures.