Well-balanced orientation conjecture for maximum total arc-connectivity

Let $G$ be a graph, let $\vec{G}$ be an orientation of $G$, and let $tac(\vec{G})$ denote its total arc-connectivity. An orientation maximizes total arc-connectivity when it maximizes $tac(\vec{G})$ among all orientations of $G$. Well-balanced orientation conjecture. Every graph $G$ has an orientation $\vec{G}$ that maximizes $tac(\vec{G})$ and is well-balanced. The source presents this as a stronger statement than the conjecture about 2-edge-connected graphs and does not give a resolution.