Dijoin weight decomposition conjecture

Let $(D=(V,A),w)$ be a weighted digraph, and let $\tau$ be the minimum weight of a dicut, with $\tau\geq 3$.

Dijoin weight decomposition conjecture. There exist weighted digraphs $(D,c)$ and $(D,c')$ such that

$$w=c+c',$$

the minimum weight of a dicut in $(D,c)$ is $1$, and the minimum weight of a dicut in $(D,c')$ is $\tau-1$.

The source proposes this as a fix to the refuted Edmonds–Giles conjecture and states that it would imply the weighted dijoin-clutter $\tau=2$ conjecture. Its status is not resolved in the supplied text.