Determine whether the logarithmic coding-advantage upper bound is attainable

Determine whether the $O(\log k)$ upper bound on the coding advantage of network coding over fractional routing in undirected multiple-unicast networks is attained by any family of networks.

Background

The paper proves an unbounded, polylogarithmic coding advantage through a tensor-amplified family, while the general theory gives an O(log⁡k)O(\log k) upper bound in terms of the number of sessions. The results do not establish whether this asymptotic upper bound is tight, leaving open the question of whether some network family achieves a coding-to-routing advantage of order log⁡k\log k.

References

Much remains open: the true advantage of the finite instance, whose routing rate our certificate bounds only from above; whether the $O(\log k)$ upper bound on the coding advantage is attained; and whether a small counterexample exists.

— Network Coding Can Beat Routing in Undirected Multiple-Unicast Networks  (2610.09367 - Zhang et al., 7 Oct 2026) in Section 7, Concluding Remarks