Reproduce “On the Communication Complexity of Maximum Matching and Negative-Weight Shortest Paths” on OpenResearch

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