Reproduce “The Multiple Unicast Conjecture is False” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Mark Braverman, Zhongtian He
The authors construct a deterministic, causal network code over F9 for 157 simultaneous unicast sessions on a 182-vertex undirected graph. Each edge has unit capacity shared between directions, and the code achieves common rate at least 1. Since every demand has distance at least five, fractional routing has common rate at most 147/157, establishing strict separation without determining the flow optimum.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.