After the publication of the OpenAI papers yesterday, we have decided to put the current version of our paper Lower Bounds for Weisfeiler-Leman (with Radu Curticapean, Mingjun Liu, and Daniel Neuen) online. The results in the paper extend tight lower complexity lower bounds on the Weisfeiler-Leman algorithm published by OpenAI yesterday. In particular, we show tight classical, parametrized and iteration number lower bounds.

Based on this experience, Radu Curticapean made a website on which researchers can share their experience with concurrent work related to the OpenAI publications.