The $(4\frac14,\frac14)$-flow conjecture for simple cubic graphs

Let $G$ be a simple cubic graph, and let $bed(G)$ denote the set of flow parameters admitted by $G$ in the source. $(4\frac14,\frac14)$-flow conjecture. For every simple cubic graph $G$,

$$(4\frac14,\frac14)\in bed(G).$$

The claim concerns a uniform flow parameter for simple cubic graphs; the source reports supporting analysis for a smallest example but does not state that the conjecture has been resolved.