The circumference conjecture for connected matroid pathwidth

Let $M$ be a connected matroid with rank function $r$. Its circumference is the maximum size of a circuit of $M$, when $M$ has at least one circuit, and its pathwidth is denoted by $\operatorname{pw}(M)$. Connected matroid circumference conjecture. Every connected matroid $M$ with circumference $k$ has pathwidth $O(k)$. This conjecture seeks a linear upper bound on the pathwidth of connected matroids in terms of their circumference, generalizing analogous bounds for $2$-connected graphs. The source does not state whether the conjecture is known or resolved.