The paper Highly connected orientations from edge-disjoint rigid subgraphs by Gamavölgyi, Jordán, Király, and Villányi has been published in Forum of Mathematics Pi! In the paper, they prove a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a $k$-vertex-connected orientation. They also give an affirmative answer to the conjecture of Kriesell that every sufficiently highly connected graph $G$ contains a spanning tree $T$ such that $G-E(T)$ is $k$-vertex-connected.