{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:31:04Z","timestamp":1771468264853,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718129","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"565-571","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Constant-Cost Communication Is Not Reducible to k-Hamming Distance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4741-5329","authenticated-orcid":false,"given":"Yuting","family":"Fang","sequence":"first","affiliation":[{"name":"Ohio State University, Columbus, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5095-7382","authenticated-orcid":false,"given":"Mika","family":"G\u00f6\u00f6s","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0259-9355","authenticated-orcid":false,"given":"Nathaniel","family":"Harms","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7928-8008","authenticated-orcid":false,"given":"Pooya","family":"Hatami","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2019.14"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2023.1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2023.57"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Yuting Fang Mika G\u00f6\u00f6s Nathaniel Harms and Pooya Hatami. 2025. Constant-Cost Communication is not Reducible to k-Hamming Distance. arxiv:2407.20204","DOI":"10.1145\/3717823.3718129"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649716"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/140991844"},{"key":"e_1_3_2_1_8_1","volume-title":"d.]. Applications of Ramsey theory to computer science. https:\/\/www.cs.umd.edu\/ gasarch\/TOPICS\/ramsey\/ramsey.html Accessed","author":"Gasarch William","year":"2024","unstructured":"William Gasarch. [n. d.]. Applications of Ramsey theory to computer science. https:\/\/www.cs.umd.edu\/ gasarch\/TOPICS\/ramsey\/ramsey.html Accessed: July 2, 2024"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2022.07.023"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-022-2365-8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519978"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.72"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654780.3654788"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.01.014"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574948"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Nati Linial and Adi Shraibman. 2009. Learning complexity vs. communication complexity. Combinatorics Probability and Computing https:\/\/doi.org\/10.1017\/S0963548308009656 10.1017\/S0963548308009656","DOI":"10.1017\/S0963548308009656"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90046-2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108671644"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00095"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780554"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia","acronym":"STOC '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:39:38Z","timestamp":1750693178000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":21,"alternative-id":["10.1145\/3717823.3718129","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718129","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}