{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:34Z","timestamp":1750306354309,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GR 1492\/14-1"],"award-info":[{"award-number":["GR 1492\/14-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2933595","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"287-296","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic"],"prefix":"10.1145","author":[{"given":"Sandra","family":"Kiefer","sequence":"first","affiliation":[{"name":"RWTH Aachen University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[{"name":"RWTH Aachen University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"07171","volume-title":"MIT Press","author":"Babai L.","year":"1995"},{"unstructured":"L. Babai. Graph isomorphism in quasipolynomial time. CoRR abs\/1512.03547 2015. URL http:\/\/arxiv.org\/abs\/1512.03547.  L. Babai. Graph isomorphism in quasipolynomial time. CoRR abs\/1512.03547 2015. URL http:\/\/arxiv.org\/abs\/1512.03547.","key":"e_1_3_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1137\/0209047"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/2933575.2934560"},{"doi-asserted-by":"crossref","unstructured":"C.\n       \n      Berkholz P. S.\n       \n      Bonsma and \n      \n      \n      M.\n       \n      Grohe\n      \n  \n  . \n  Tight lower and upper bounds for the complexity of canonical colour refinement. In H. L. Bodlaender and G. F. Italiano editors Algorithms - ESA 2013 - 21st Annual European Symposium Sophia Antipolis France September 2-4 2013\n  . Proceedings volume \n  8125\n   of \n  Lecture Notes in Computer Science pages \n  145\n  --\n  156\n  . \n  Springer 2013. doi: 10.1007\/978-3-642-40450-4_13. URL http:\/\/dx.doi.org\/10.1007\/978-3-642-40450-4_13.  C. Berkholz P. S. Bonsma and M. Grohe. Tight lower and upper bounds for the complexity of canonical colour refinement. In H. L. Bodlaender and G. F. Italiano editors Algorithms - ESA 2013 - 21st Annual European Symposium Sophia Antipolis France September 2-4 2013. Proceedings volume 8125 of Lecture Notes in Computer Science pages 145--156. Springer 2013. doi: 10.1007\/978-3-642-40450-4_13. URL http:\/\/dx.doi.org\/10.1007\/978-3-642-40450-4_13.","key":"e_1_3_2_1_5_1","DOI":"10.1007\/978-3-642-40450-4_13"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"Fast matrix multiplication. Theory of Computing","volume":"5","author":"Bl\u00e4ser M.","year":"2013","journal-title":"Graduate Surveys"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1007\/BF01305232"},{"key":"e_1_3_2_1_8_1","first-page":"55","volume-title":"Groups, combinatorics & geometry (Durham","author":"Cameron P. J.","year":"2001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/0304-3975(82)90016-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/996566.996712"},{"doi-asserted-by":"crossref","unstructured":"M.\n       \n      F\u00fcrer\n    .\n      \n  \n   \n  Weisfeiler-Lehman refinement requires at least a linear number of iterations. In F. Orejas P. G. Spirakis and J. van Leeuwen editors Automata Languages and Programming 28th International Colloquium ICALP\n   \n  2001 Crete Greece July 8-12 2001 Proceedings volume \n  2076\n   of \n  Lecture Notes in Computer Science pages \n  322\n  --\n  333\n  . \n  Springer 2001. doi: 10.1007\/3-540-48224-5_27. URL http:\/\/dx.doi.org\/10.1007\/3-540-48224-5_27.   M. F\u00fcrer. Weisfeiler-Lehman refinement requires at least a linear number of iterations. In F. Orejas P. G. Spirakis and J. van Leeuwen editors Automata Languages and Programming 28th International Colloquium ICALP 2001 Crete Greece July 8-12 2001 Proceedings volume 2076 of Lecture Notes in Computer Science pages 322--333. Springer 2001. doi: 10.1007\/3-540-48224-5_27. URL http:\/\/dx.doi.org\/10.1007\/3-540-48224-5_27.","key":"e_1_3_2_1_11_1","DOI":"10.1007\/3-540-48224-5_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/2371656.2371662"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/11786986_2"},{"doi-asserted-by":"crossref","unstructured":"M.\n       \n      Grohe K.\n       \n      Kersting M.\n       \n      Mladenov and \n      \n      \n      E.\n       \n      Selman\n      \n  \n  . \n  Dimension reduction via colour refinement. In A. S. Schulz and D. Wagner editors Algorithms - ESA 2014 - 22th Annual European Symposium Wroclaw Poland September 8-10 2014\n  . Proceedings volume \n  8737\n   of \n  Lecture Notes in Computer Science pages \n  505\n  --\n  516\n  . \n  Springer 2014. doi: 10.1007\/978-3-662-44777-2_42. URL http:\/\/dx.doi.org\/10.1007\/978-3-662-44777-2_42.  M. Grohe K. Kersting M. Mladenov and E. Selman. Dimension reduction via colour refinement. In A. S. Schulz and D. Wagner editors Algorithms - ESA 2014 - 22th Annual European Symposium Wroclaw Poland September 8-10 2014. Proceedings volume 8737 of Lecture Notes in Computer Science pages 505--516. Springer 2014. doi: 10.1007\/978-3-662-44777-2_42. URL http:\/\/dx.doi.org\/10.1007\/978-3-662-44777-2_42.","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-662-44777-2_42"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/978-1-4612-4478-3_5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/2791188.2791201"},{"doi-asserted-by":"crossref","unstructured":"S.\n       \n      Kiefer P.\n       \n      Schweitzer and \n      \n      \n      E.\n       \n      Selman\n      \n  \n  . \n  Graphs identified by logics with counting. In G. F. Italiano G. Pighizzini and D. Sannella editors Mathematical Foundations of Computer Science 2015 - 40th International Symposium MFCS\n   \n  2015 Milan Italy August 24-28 2015 Proceedings Part I volume \n  9234\n   of \n  Lecture Notes in Computer Science pages \n  319\n  --\n  330\n  . \n  Springer 2015. doi: 10.1007\/978-3-662-48057-1_25. URL http:\/\/dx.doi.org\/10.1007\/978-3-662-48057-1_25.  S. Kiefer P. Schweitzer and E. Selman. Graphs identified by logics with counting. In G. F. Italiano G. Pighizzini and D. Sannella editors Mathematical Foundations of Computer Science 2015 - 40th International Symposium MFCS 2015 Milan Italy August 24-28 2015 Proceedings Part I volume 9234 of Lecture Notes in Computer Science pages 319--330. Springer 2015. doi: 10.1007\/978-3-662-48057-1_25. URL http:\/\/dx.doi.org\/10.1007\/978-3-662-48057-1_25.","key":"e_1_3_2_1_17_1","DOI":"10.1007\/978-3-662-48057-1_25"},{"doi-asserted-by":"crossref","unstructured":"J.\n       \n      K\u00f6bler\n     and \n      \n      \n      O.\n       \n      Verbitsky\n      \n  \n  . \n  From invariants to canonization in parallel. In E. A. Hirsch A. A. Razborov A. L. Semenov and A. Slissenko editors Computer Science - Theory and Applications Third International Computer Science Symposium in Russia CSR\n   \n  2008 Moscow Russia June 7-12 2008 Proceedings volume \n  5010\n   of \n  Lecture Notes in Computer Science pages \n  216\n  --\n  227\n  . \n  Springer 2008. doi: 10.1007\/978-3-540-79709-8_23. URL http:\/\/dx.doi.org\/10.1007\/978-3-540-79709-8_23.   J. K\u00f6bler and O. Verbitsky. From invariants to canonization in parallel. In E. A. Hirsch A. A. Razborov A. L. Semenov and A. Slissenko editors Computer Science - Theory and Applications Third International Computer Science Symposium in Russia CSR 2008 Moscow Russia June 7-12 2008 Proceedings volume 5010 of Lecture Notes in Computer Science pages 216--227. Springer 2008. doi: 10.1007\/978-3-540-79709-8_23. URL http:\/\/dx.doi.org\/10.1007\/978-3-540-79709-8_23.","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-540-79709-8_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/LICS.2015.69"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/SFCS.1987.11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/978-3-319-35122-3_21"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/j.jsc.2013.09.003"},{"volume-title":"Springer-Verlag","year":"1997","author":"Otto M.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","series-title":"Contemp","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1090\/conm\/558\/11050","volume-title":"Model theoretic methods in finite combinatorics","author":"Pikhurko O.","year":"2011"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.5555\/1953048.2078187"}],"event":{"sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"acronym":"LICS '16","name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"New York NY USA"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2933595","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2933595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:03Z","timestamp":1750222563000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2933595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":25,"alternative-id":["10.1145\/2933575.2933595","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2933595","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}