Archdeacon's 5-oriented-cycle-double-cover conjecture

An oriented $k$-cycle double-cover (or $k$-OCDC) of a graph is a multiset of $k$ oriented cycles in which every edge occurs in each orientation in exactly one cycle.

Archdeacon's conjecture. Every bridgeless graph has a $5$-OCDC.

The conjecture is part of the cycle-double-cover approach to nowhere-zero flow problems. The supplied text states that it is not known whether every bridgeless graph has a $k$-OCDC for some $k$, so this specific assertion remains open.