{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:28:08Z","timestamp":1765974488529,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175741","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T13:18:23Z","timestamp":1689340703000},"page":"1-13","source":"Crossref","is-referenced-by-count":6,"title":["The Iteration Number of the Weisfeiler-Leman Algorithm"],"prefix":"10.1109","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[{"name":"RWTH Aachen University,Aachen,Germany"}]},{"given":"Moritz","family":"Lichter","sequence":"additional","affiliation":[{"name":"TU Darmstadt,Darmstadt,Germany"}]},{"given":"Daniel","family":"Neuen","sequence":"additional","affiliation":[{"name":"Universität Bremen,Bremen,Germany"}]}],"member":"263","reference":[{"key":"ref1","article-title":"The reduction of a graph to canonical form and the algebra which appears therein","volume-title":"NTI","author":"Weisfeiler","year":"1968"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4478-3_5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/bf01305232"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/9781139028868"},{"key":"ref6","first-page":"72:1","article-title":"Isomorphism testing parameterized by genus and beyond","volume-title":"29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)","volume":"204","author":"Neuen"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.59"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746617"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470677"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"article-title":"How powerful are graph neural networks?","volume-title":"7th International Conference on Learning Representations, ICLR 2019","author":"Xu","key":"ref11"},{"key":"ref12","article-title":"Weisfeiler and Leman go machine learning: The story so far","volume-title":"CoRR","volume":"abs\/2112.09992","author":"Morris","year":"2021"},{"key":"ref13","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume-title":"J. Mach. Learn. Res","volume":"12","author":"Shervashidze","year":"2011"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.11"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/9781316716878"},{"key":"ref16","first-page":"73:1","article-title":"The iteration number of colour refinement","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference)","volume":"168","author":"Kiefer"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785694"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933595"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_27"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934560"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/20m1314987"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_2"},{"key":"ref23","first-page":"134:1","article-title":"Logarithmic weisfeiler-leman identifies all planar graphs","volume-title":"48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)","volume":"198","author":"Grohe"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_58"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07968-4"},{"volume-title":"Linear algebra methods in combinatorics","year":"2020","author":"Babai","key":"ref26"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"issue":"1-3","key":"ref28","first-page":"1","article-title":"Pseudorandomness","volume-title":"Found. Trends Theor. Comput. Sci","volume":"7","author":"Vadhan","year":"2012"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2023,6,26]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175741.pdf?arnumber=10175741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T19:47:53Z","timestamp":1705002473000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175741\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175741","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}