Reproduce “The distributed complexity of locally checkable problems on paths is decidable” 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

Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, Jukka Suomela

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