Nash-Williams' edge-connectivity orientation conjecture

For a natural number $k$, a graph is $2k$-edge-connected if every edge cut has size at least $2k$, and an orientation is $k$-arc-connected if every ordered pair of vertices is joined by at least $k$ edge-disjoint directed paths. Nash-Williams' edge-connectivity orientation conjecture. For any natural number $k$, every $2k$-edge-connected graph admits a $k$-arc-connected orientation. This is the edge-connectivity consequence of Nash-Williams' orientation problem for arbitrary graphs. The supplied status evidence says that this problem was answered by Thomas, who proved that one can take $f(k)=8k$; accordingly, this candidate is recorded as solved.