Sublogarithmic randomized LOCAL complexity of Vizing coloring

Determine whether the randomized LOCAL complexity of edge coloring with Δ+1 colors is o(log(n)).

Background

The paper identifies randomized distributed Vizing coloring as a central unresolved issue. Although randomized algorithms achieving the Vizing bound are known with polylogarithmic complexity, it remains unknown whether the complexity can be reduced below logarithmic in the network size.