Packing directed circuits fractionally

LetG be a digraph, and letk≥1, such that no “fractional” packing of directed circuits ofG has value >k, when every vertex is given “capacity” 1. We prove there is a set ofO (k logk logk) vertices meeting all directed circuits ofG.