https://hackerpaper.kaipfister.de/p/0804.4881/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=23892073urn:hackerpapers:mention:0804.4881:23892073Sun, 19 Jul 2020 20:06:32 GMT<p>I haven&#x27;t read everything, but it does contain a section about something I&#x27;m quite familiar with: The article says &quot;We compute the hashcode of the entire graph by hashing the multiset of WL labels. With one round, we’re just comparing the degree histogram. The more rounds we add, the more likely we are to detect a symmetry-breaker:&quot;, which is not correct. Repeatedly re-labeling a graph by assigning a unique label to each unique neighborhood histogram, until the corresponding partition reaches a fixpoint would compute the one-dimensional Weisfeiler-Lehman refinement. But there are many…</p><p><a href="https://hackerpaper.kaipfister.de/p/0804.4881/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS