{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:23Z","timestamp":1750309343912,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T00:00:00Z","timestamp":1725926400000},"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":["SIGACT News"],"published-print":{"date-parts":[[2024,9,10]]},"abstract":"<jats:p>This month's guest author is Dean Doron, who provides a wonderful survey on construction, encoding and decoding of binary codes with distance close to half. Thank you Dean for your hard work!<\/jats:p>\n          <jats:p>Coming up next, we'll have columns by Stacey Jeffrey (on Quantum Las Vegas Algorithms and Composition), Igor Carboni Oliveira (on the Meta-Mathematics of Computational Complexity Theory), Noam Mazor (topic TBA) and Elena Grigorescu (on Locally Decodable Codes for Insertions and Deletions). Stay tuned for more!<\/jats:p>","DOI":"10.1145\/3695887.3695893","type":"journal-article","created":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T22:25:11Z","timestamp":1726007111000},"page":"32-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SIGACT News Complexity Theory Column"],"prefix":"10.1145","volume":"55","author":[{"given":"Ben","family":"Lee Volk","sequence":"first","affiliation":[{"name":"Reichman University, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,10]]},"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695887.3695893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695887.3695893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:30Z","timestamp":1750291470000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695887.3695893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,10]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9,10]]}},"alternative-id":["10.1145\/3695887.3695893"],"URL":"https:\/\/doi.org\/10.1145\/3695887.3695893","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2024,9,10]]},"assertion":[{"value":"2024-09-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}