$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture

ArXi:2604.07240v1 Announce Type: cross Experiments on the resolved $k=3$ regime show that current agentic methods can solve nontrivial instances, and in the open $k=4$ regime they reduce the number of violations relative to existing potentials without fully resolving the task. Taken together, these results suggest that the task is challenging but plausibly within reach of current methods.