In their paper "Flip Graphs for Matrix Multiplication", they introduce a new method for finding matrix multiplication schemes with few multiplications. In particular, for 5x5 matrices, they improved the record from 98 to 97, and modulo two from 96 to 95. When the preprint was posted on ArXiv last fall, it attracted some public interest. Now the work has passed peer review and appeared at ISSAC, the main conference in the area of computer algebra and symbolic computation. We are proud that our contribution was recognized with the distinguished paper award sponsored by ACM SIGSAM.