Determine the exact coding advantage of the finite counterexample

Determine the true coding advantage of the finite undirected multiple-unicast counterexample, including its exact fractional-routing rate or the precise gap between its achievable coding rate and routing rate.

Background

The paper constructs a finite connected simple undirected network on which a binary linear network code achieves a common rate strictly greater than the maximum fractional-routing rate. The routing analysis supplies only an upper-bound certificate for the routing rate, rather than determining that rate exactly. Consequently, the magnitude of the coding advantage realized by the particular finite counterexample remains unresolved.

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

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