{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:08Z","timestamp":1750220648590,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM SIGLOG News"],"published-print":{"date-parts":[[2020,11,16]]},"abstract":"<jats:p>\n            Some of my favorite open problems concern fixed-point logic with counting, FPC. It is known that counting logic with\n            <jats:italic>k<\/jats:italic>\n            + 1 variables,\n            <jats:italic>C<\/jats:italic>\n            <jats:sup>\n              <jats:italic>k<\/jats:italic>\n              +1\n            <\/jats:sup>\n            , has exactly the same expressive power as the classic k-dimensional Weisfeiler-Leman Algorithm,\n            <jats:italic>k<\/jats:italic>\n            -WL. Furthermore, the quantifier-depth of a\n            <jats:italic>C<\/jats:italic>\n            <jats:sup>\n              <jats:italic>k<\/jats:italic>\n              +1\n            <\/jats:sup>\n            formula needed to express the color of a\n            <jats:italic>k<\/jats:italic>\n            -tuple of vertices is equal to the number of iterations of\n            <jats:italic>k<\/jats:italic>\n            -WL needed to derive that color.\n          <\/jats:p>","DOI":"10.1145\/3436980.3436981","type":"journal-article","created":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T02:30:49Z","timestamp":1606271449000},"page":"4-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity column"],"prefix":"10.1145","volume":"7","author":[{"given":"Neil","family":"Immerman","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,16]]},"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3436980.3436981","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:20Z","timestamp":1750197740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3436980.3436981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,16]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,11,16]]}},"alternative-id":["10.1145\/3436980.3436981"],"URL":"https:\/\/doi.org\/10.1145\/3436980.3436981","relation":{},"ISSN":["2372-3491"],"issn-type":[{"type":"electronic","value":"2372-3491"}],"subject":[],"published":{"date-parts":[[2020,11,16]]},"assertion":[{"value":"2020-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}