The five-cycle double cover conjecture

Let $G$ be a bridgeless cubic graph. A $5$-cycle double cover ($5$-CyDC) is a tuple of five cycles of $G$ such that every edge belongs to exactly two members of the tuple.

Five-cycle double cover conjecture. Every bridgeless cubic graph has a $5$-CyDC.

The ordinary cycle double cover conjecture is stated in the source as solved, but the five-cycle version remains open. The paper also gives a flow-only formulation of this conjecture and proves related results, including a characterization for a prescribed cycle.