{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:49Z","timestamp":1750306789701,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,12]],"date-time":"2014-01-12T00:00:00Z","timestamp":1389484800000},"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":[],"published-print":{"date-parts":[[2014,1,12]]},"DOI":"10.1145\/2554797.2554832","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"377-386","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Deterministic compression with uncertain priors"],"prefix":"10.1145","author":[{"given":"Elad","family":"Haramaty","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/FOCS.2011.86"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/S0019-9958(86)80023-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/129837"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/2160158.2160161"},{"volume-title":"Deterministic compression with uncertain priors. Electronic Colloquium on Computational Complexity (ECCC), 19:166","year":"2012","author":"Haramaty E.","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/TIT.2009.2034824"},{"key":"e_1_3_2_1_7_1","first-page":"79","volume-title":"Compression without a common prior: an information-theoretic justification for ambiguity in language","author":"Juba B.","year":"2011"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1374376.1374397"},{"volume-title":"Communication Complexity","year":"1997","author":"Kushilevitz E.","key":"e_1_3_2_1_9_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1137\/0221015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/TIT.1977.1055714"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"ITCS'14","name":"ITCS'14: Innovations in Theoretical Computer Science","location":"Princeton New Jersey USA"},"container-title":["Proceedings of the 5th conference on Innovations in theoretical computer science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554832","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2554797.2554832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:21Z","timestamp":1750232061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,12]]},"references-count":12,"alternative-id":["10.1145\/2554797.2554832","10.1145\/2554797"],"URL":"https:\/\/doi.org\/10.1145\/2554797.2554832","relation":{},"subject":[],"published":{"date-parts":[[2014,1,12]]},"assertion":[{"value":"2014-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}