New paper on arXiv: In Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them (with Snir Hordan and Nadav Dym), we show that the Weisfeiler-Leman algorithm is not a complete isomorphism tests on graphs with simple spectrum (distinct adjacency eigenvaules). To close this gap, we introduce PRiSM (Partition, Refine, Solve, Match), a complete canonicalization algorithm for simple-spectrum eigendecompositions.