Reproduce “Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

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