Circular flow number of highly edge connected signed graphs
  This paper proves that for any positive integer $k$, every essentially $(2k+1)$-unbalanced $(12k-1)$-edge connected signed graph has circular flow number at most $2+\frac 1k$. 
Xuding Zhu
math.CO