AIProofWatch
← Archive

AI-assisted proof of the deterministic k-server conjecture

Coester, Koutsoupias and Zbysiński report that the work function algorithm is k-competitive on every metric space.

Sources for this record

What was already known

The general deterministic k-server conjecture sought the optimal ratio k, beyond previously established special cases.

What changed and why it matters

Advances the stated target relative to the recorded baseline.

The AI contribution

The authors describe human potential-function development, AI-assisted symmetrization, and GPT-6 Astra’s algebraic generalization to arbitrary k.

Limitations

Preprint; this is the deterministic conjecture. The additive initial-configuration term and the paper’s metric model matter; randomized variants are separate.

Verification evidence

Evidence labels show what supports the claim. Importance rates its impact if correct.

Author claim

The original source reports this scoped result; AIProofWatch reviewed its statement, not the full proof.

Accessible artifact / proof

A research manuscript or proof artifact is publicly accessible; availability is not independent checking.

Correction and publication history