The orientable 5-cycle double cover conjecture

An orientable cycle double cover of a graph $G$ is a list of Eulerian subgraphs, each equipped with a directed Eulerian orientation, such that every edge of $G$ is used exactly once in each direction. An orientable $k$-cycle double cover is an orientable cycle double cover with at most $k$ Eulerian subgraphs.

Orientable 5-cycle double cover conjecture. Every bridgeless graph admits an orientable $5$-cycle double cover.

The conjecture would imply Tutte's $5$-flow conjecture. The source gives this implication but no resolution of the orientable cover conjecture.