The bar visibility number conjecture for the transitive tournament on 11 vertices

Let $T_n$ denote the transitive tournament on $n$ vertices, and let $b(G)$ be the bar visibility number of a digraph $G$. The conjecture.

$$b(T_{11})=3.$$

This was one of two conjectures posed by Axenovich, Beveridge, Hutchinson, and West; the supplied text does not indicate whether it has been resolved.