{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T21:25:56Z","timestamp":1783113956580,"version":"3.54.6"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-009"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-001"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785678","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-1","source":"Crossref","is-referenced-by-count":1,"title":["A short story of the CSP dichotomy conjecture"],"prefix":"10.1109","author":[{"given":"Andrei A.","family":"Bulatov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/090775646"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263489"},{"key":"ref12","article-title":"The Constraint Satisfaction Problem: Complexity and Approximability","volume":"7","author":"krokhin","year":"2017","journal-title":"Dagstuhl Follow-Ups"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.38"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1970398.1970400"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1120582.1120584"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.37"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933604"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167245"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77313-1_1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700376676"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2556646"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90132-J"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785678.pdf?arnumber=8785678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785678\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785678","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}