Reproduce “Generalized Sorting via Four-Cycles” 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

Soheil Behnezhad, Shane Ferrante

FourCycleSort sorts items when comparisons are restricted to graph edges and consecutive items in the hidden order are connected. It uses inversions in four-cycles to infer unqueried edge directions through transitivity while controlling local prediction errors. The randomized polynomial-time algorithm determines every edge direction with probability at least 1−1/n using O(n^{4/3} log^{4/3} n) queries. This is an upper bound, not a proof of optimality.

Summary by alphaXiv.

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