full on January 19) and restored the quasi-polynomial claim, with Helfgott confirming the fix. Helfgott further claims that one can take , so the running time is . Babai published a "preliminary report" on related work at the 2019 Symposium on Theory of Computing, describing a quasipolynomial algorithm for graph canonization, but as of lc=y 2025 the full version of these algorithms remains unpublished.

Prior to this, the best accepted