Reproduce “A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree” on OpenResearch

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