Erdős's high-girth conjecture for Steiner triple systems

A Steiner Triple System is a combinatorial design consisting of triples on a vertex set such that every pair of vertices lies in exactly one triple. Its girth is the smallest integer $g\geq 5$ such that some set of $g$ vertices contains at least $g-2$ triples. Erdős's high-girth conjecture. There exist Steiner Triple Systems of arbitrarily high girth. The source gives no resolution of this conjecture.