{"id":"https://openalex.org/W4411319845","doi":"https://doi.org/10.1145/3717823.3718129","title":"Constant-Cost Communication Is Not Reducible to k-Hamming Distance","display_name":"Constant-Cost Communication Is Not Reducible to k-Hamming Distance","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411319845","doi":"https://doi.org/10.1145/3717823.3718129"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718129","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/251406","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016790592","display_name":"Yuting Fang","orcid":"https://orcid.org/0000-0003-4741-5329"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yuting Fang","raw_affiliation_strings":["Ohio State University, Columbus, USA"],"raw_orcid":"https://orcid.org/0000-0003-4741-5329","affiliations":[{"raw_affiliation_string":"Ohio State University, Columbus, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065903790","display_name":"Mika G\u00f6\u00f6s","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Mika G\u00f6\u00f6s","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0009-0005-5095-7382","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078658717","display_name":"Nathaniel Harms","orcid":"https://orcid.org/0000-0003-0259-9355"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Nathaniel Harms","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-0259-9355","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007198874","display_name":"Pooya Hatami","orcid":"https://orcid.org/0000-0001-7928-8008"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pooya Hatami","raw_affiliation_strings":["Ohio State University, Columbus, USA"],"raw_orcid":"https://orcid.org/0000-0001-7928-8008","affiliations":[{"raw_affiliation_string":"Ohio State University, Columbus, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016790592"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":2.6514,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.90636074,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"565","last_page":"571"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7868578433990479},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6839759349822998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5381740927696228},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.491643488407135},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4735780656337738},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.4115048348903656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3404301702976227},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.2299206554889679},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19799423217773438},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.08394438028335571},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07662621140480042},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.060282737016677856}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7868578433990479},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6839759349822998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5381740927696228},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.491643488407135},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4735780656337738},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.4115048348903656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3404301702976227},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.2299206554889679},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19799423217773438},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.08394438028335571},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07662621140480042},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.060282737016677856}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3717823.3718129","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/251406","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/251406","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/251406","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/251406","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1964507566","https://openalex.org/W1970169765","https://openalex.org/W2008671796","https://openalex.org/W2010796327","https://openalex.org/W2888426597","https://openalex.org/W2912462513","https://openalex.org/W3023250268","https://openalex.org/W3164123192","https://openalex.org/W3217052763","https://openalex.org/W4211154544","https://openalex.org/W4226303352","https://openalex.org/W4281666742","https://openalex.org/W4390575983","https://openalex.org/W4393185920","https://openalex.org/W4399521384","https://openalex.org/W4411319845","https://openalex.org/W6948000019"],"related_works":["https://openalex.org/W2105471374","https://openalex.org/W2008960744","https://openalex.org/W2740543340","https://openalex.org/W1519122282","https://openalex.org/W153182557","https://openalex.org/W2371167013","https://openalex.org/W2158117886","https://openalex.org/W2613408642","https://openalex.org/W1582340598","https://openalex.org/W1964096323"],"abstract_inverted_index":{"Every":[0],"known":[1],"communication":[2,6],"problem":[3],"whose":[4],"randomized":[5],"cost":[7],"is":[8,83,101],"constant":[9,26],"(independent":[10],"of":[11,28,41],"the":[12,38],"input":[13],"size)":[14],"can":[15],"be":[16,46,118],"reduced":[17,47],"to":[18,31,48,57,93],"\ud835\udc58-Hamming":[19,33,49],"Distance,":[20],"that":[21,72],"is,":[22],"solved":[23],"with":[24],"a":[25,58],"number":[27],"deterministic":[29],"queries":[30],"some":[32],"Distance":[34],"oracle.":[35],"We":[36,103],"exhibit":[37],"first":[39],"examples":[40],"constant-cost":[42],"problems":[43],"which":[44],"cannot":[45],"Distance.":[50],"To":[51],"prove":[52,104],"this":[53],"separation,we":[54],"relate":[55],"it":[56,88],"natural":[59],"coding-theoretic":[60],"question.":[61],"For":[62],"\ud835\udc53":[63,85,97,100,109,116,120,124,127],":":[64,77],"{2,":[65],"4,":[66],"6}":[67],"\u2192":[68,80],"N,":[69],"we":[70],"say":[71],"an":[73,84],"encoding":[74],"function":[75],"\ud835\udc38":[76],"{0,":[78,81],"1}\ud835\udc5b":[79],"1}\ud835\udc5a":[82],"-code":[86],"if":[87,106],"transforms":[89],"Hamming":[90],"distances":[91],"according":[92],"dist(\ud835\udc38(\ud835\udc65),":[94],"\ud835\udc38(\ud835\udc66))":[95],"=":[96,122],"(dist(\ud835\udc65,\ud835\udc66))":[98],"whenever":[99],"defined.":[102],"that,":[105],"there":[107],"exist":[108],"-codes":[110],"for":[111],"infinitely":[112],"many":[113],"\ud835\udc5b,":[114],"then":[115],"must":[117],"affine:":[119],"(4)":[121],"(":[123],"(2)":[125],"+":[126],"(6))/2.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}