Reproduce “Hard Optimization Problems have Soft Edges” 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
Raffaele Marino, Scott Kirkpatrick
The authors study clique search in Erdős–Rényi graphs and test whether greedy methods can recover planted cliques at finite sizes. Their early-stopped search finds a candidate just above the expected natural-clique size, then cleans it up. On graphs with N=10^4, SM1 succeeds below AMP’s threshold, including at α=0.4; this is a finite-simulation result, not a general theorem.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.