{"id":"https://openalex.org/W4384388105","doi":"https://doi.org/10.1109/lics56636.2023.10175741","title":"The Iteration Number of the Weisfeiler-Leman Algorithm","display_name":"The Iteration Number of the Weisfeiler-Leman Algorithm","publication_year":2023,"publication_date":"2023-06-26","ids":{"openalex":"https://openalex.org/W4384388105","doi":"https://doi.org/10.1109/lics56636.2023.10175741"},"language":"en","primary_location":{"id":"doi:10.1109/lics56636.2023.10175741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics56636.2023.10175741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Grohe","raw_affiliation_strings":["RWTH Aachen University,Aachen,Germany","RWTH Aachen University, Aachen, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University,Aachen,Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050723678","display_name":"Moritz Lichter","orcid":"https://orcid.org/0000-0001-5437-8074"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Moritz Lichter","raw_affiliation_strings":["TU Darmstadt,Darmstadt,Germany","TU Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"TU Darmstadt,Darmstadt,Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008306814","display_name":"Daniel Neuen","orcid":"https://orcid.org/0000-0002-4940-0318"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Neuen","raw_affiliation_strings":["Universit&#x00E4;t Bremen,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"Universit&#x00E4;t Bremen,Bremen,Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073893026"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":1.2087,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81956418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9839000105857849,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10083","display_name":"Graphene research and applications","score":0.9555000066757202,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7464755773544312},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5825191140174866},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.55979323387146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4736310839653015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3875250816345215},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3830515742301941},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35700756311416626},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09908410906791687}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7464755773544312},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5825191140174866},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.55979323387146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4736310839653015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3875250816345215},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3830515742301941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35700756311416626},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09908410906791687}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics56636.2023.10175741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics56636.2023.10175741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1517098132","https://openalex.org/W1656942156","https://openalex.org/W1658031827","https://openalex.org/W1972761585","https://openalex.org/W2111302825","https://openalex.org/W2138556324","https://openalex.org/W2181072414","https://openalex.org/W2409645877","https://openalex.org/W2743930031","https://openalex.org/W2747329762","https://openalex.org/W2962810718","https://openalex.org/W2963494352","https://openalex.org/W2964195552","https://openalex.org/W2966519690","https://openalex.org/W2968583566","https://openalex.org/W3108904375","https://openalex.org/W3177995633","https://openalex.org/W4231916799","https://openalex.org/W4237031071","https://openalex.org/W4246560108","https://openalex.org/W4252748002","https://openalex.org/W6681029592","https://openalex.org/W6754929296","https://openalex.org/W6778108174","https://openalex.org/W6797390020","https://openalex.org/W6797803074","https://openalex.org/W6805571428","https://openalex.org/W6811676695"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2980963558","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2989452537"],"abstract_inverted_index":{"We":[0],"prove":[1],"new":[2,227],"upper":[3,57,70,87,228],"and":[4,66,129,135,229,250],"lower":[5,112,230],"bounds":[6,88,231],"on":[7,94,232],"the":[8,12,42,47,51,55,127,130,150,199,208,233,238],"number":[9,43,132,187,249],"of":[10,44,46,59,72,114,133,188,202,216],"iterations":[11,38,104,177,189],"k-dimensional":[13],"Weisfeiler-Leman":[14],"algorithm":[15,152],"(k-WL)":[16],"requires":[17,97,170],"until":[18],"stabilization.":[19],"For":[20],"k":[21,77],"\u2265":[22],"3,":[23],"we":[24],"show":[25,136],"that":[26,137],"k-WL":[27,96,151,192],"stabilizes":[28],"after":[29],"at":[30,98,171],"most":[31],"O(kn":[32],"<sup":[33,61,101,116,156,161,174],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[34,62,102,117,157,162,175],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k\u22121</sup>":[35],"log":[36,74,164],"n)":[37,75,165],"(where":[39],"n":[40,60,100,115,160,173],"denotes":[41],"vertices":[45],"input":[48],"structures),":[49],"obtaining":[50],"first":[52],"improvement":[53],"over":[54,109],"trivial":[56],"bound":[58,71,113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</sup>":[63],"\u2212":[64],"1":[65],"extending":[67],"a":[68,110,203],"previous":[69,111],"O(n":[73],"for":[76,178],"=":[78,141],"2":[79],"[Lichter":[80],"et":[81],"al.,":[82],"LICS":[83,121],"2019].We":[84],"complement":[85],"our":[86,223],"by":[89,191],"constructing":[90],"k-ary":[91],"relational":[92],"structures":[93,196],"which":[95],"least":[99,172],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03a9(k)</sup>":[103,176],"to":[105,193,198],"stabilize.":[106],"This":[107],"improves":[108],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03a9(k/logk)</sup>":[118],"[Berkholz,":[119],"Nordstr\u00f6m,":[120],"2016].We":[122],"also":[123,225],"investigate":[124],"tradeoffs":[125,246],"between":[126,247],"dimension":[128],"iteration":[131],"WL,":[134],"d-WL,":[138],"where":[139],"$d":[140],"\\left\\lceil":[142],"{\\frac{{3(k":[143],"+":[144,210,214,241],"1)}}{2}}":[145],"\\right\\rceil":[146],"$,":[147],"can":[148],"simulate":[149],"using":[153],"only":[154],"O(k":[155],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[158],"\u2022":[159],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u230ak/2\u230b+1</sup>":[163],"many":[166],"iterations,":[167],"but":[168],"still":[169],"any":[179],"d":[180],"(that":[181],"is":[182],"sufficiently":[183],"smaller":[184],"than":[185],"n).The":[186],"required":[190,236],"distinguish":[194],"two":[195],"corresponds":[197],"quantifier":[200,234,251],"rank":[201,235],"sentence":[204],"distinguishing":[205],"them":[206],"in":[207,237],"(k":[209],"1)-variable":[211],"fragment":[212],"${{\\mathcal{C}}_k}_{":[213,240],"1}$":[215],"first-order":[217],"logic":[218,239],"with":[219],"counting":[220],"quantifiers.":[221],"Hence,":[222],"results":[224],"imply":[226],"1}$,":[242],"as":[243,245],"well":[244],"variable":[248],"rank.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}