Reproduce “Reachability Diameter: Beyond the Square-Root Barrier, with Polynomial Hardness” 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

Hector Tierno, Shuang Yang

The authors estimate the reachability diameter of an unweighted directed graph, the shortest-path distance among reachable ordered pairs that is greatest. They combine recursive pivot sampling with randomized Sweep, which searches unresolved fragments before partitioning splits paths. The algorithm gives a randomized n^(1/3+o(1))-approximation in near-linear time with high probability. Under the 3-uniform Hyperclique hypothesis, near-linear time cannot achieve an n^(2/15−ε)-approximation; the optimal exponent remains open.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.