{"id":"https://openalex.org/W7161718758","doi":"https://doi.org/10.48550/arxiv.2605.18086","title":"Distributed Renaming with Subquadratic Bits via Scalable Committee Election","display_name":"Distributed Renaming with Subquadratic Bits via Scalable Committee Election","publication_year":2026,"publication_date":"2026-05-18","ids":{"openalex":"https://openalex.org/W7161718758","doi":"https://doi.org/10.48550/arxiv.2605.18086"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.18086","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.18086","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.18086","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109792801","display_name":"Sirui Bai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bai, Sirui","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136480909","display_name":"Xinyu Fu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fu, Xinyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136495187","display_name":"Yuyi Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yuyi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5036490031","display_name":"Chaodong Zheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zheng, Chaodong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.8776999711990356,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.8776999711990356,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10237","display_name":"Cryptography and Data Security","score":0.08179999887943268,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012299999594688416,"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/scalability","display_name":"Scalability","score":0.7318999767303467},{"id":"https://openalex.org/keywords/namespace","display_name":"Namespace","score":0.550599992275238},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.54339998960495},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.46459999680519104},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4546999931335449},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4374000132083893},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4368000030517578},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.427700012922287},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4032999873161316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7971000075340271},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7318999767303467},{"id":"https://openalex.org/C2778383056","wikidata":"https://www.wikidata.org/wiki/Q873636","display_name":"Namespace","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.54339998960495},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5141000151634216},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.46459999680519104},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4546999931335449},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4374000132083893},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4368000030517578},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.427700012922287},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4032999873161316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3790000081062317},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.35359999537467957},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.3515999913215637},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C44871818","wikidata":"https://www.wikidata.org/wiki/Q5154139","display_name":"Communication in small groups","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3222000002861023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32010000944137573},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.31790000200271606},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.30709999799728394},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.18086","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.18086","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.18086","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.18086","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6311620473861694}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,45],"distributed":[1,234],"computing,":[2],"the":[3,38,46,71,86,153,169,178,187],"renaming":[4,53,90,113,190],"problem":[5],"requires":[6],"$n$":[7],"nodes":[8,174,183],"with":[9,136,161,237],"unique":[10],"identities":[11,21,42],"from":[12,22],"a":[13,23,62,202,216],"large":[14],"namespace":[15,26],"$[N]$":[16],"to":[17,117,231],"acquire":[18],"new,":[19],"distinct":[20],"smaller":[24],"target":[25],"$[M]$.":[27],"A":[28,211],"solution":[29],"is":[30,35,43,168,177,215],"strong":[31,110,241],"if":[32,37],"$M=n$,":[33],"and":[34,78,97,111,157,175,197,218,240],"order-preserving":[36,112],"relative":[39],"order":[40],"of":[41,66,88,172,180,205],"maintained.":[44],"synchronous":[47],"message-passing":[48],"model,":[49],"although":[50],"many":[51],"fault-tolerant":[52],"algorithms":[54,91,108,230],"achieve":[55],"logarithmic":[56],"time":[57],"complexity,":[58],"they":[59],"universally":[60],"incur":[61],"high":[63],"message":[64,102],"complexity":[65],"$\u03a9(n^2)$.":[67],"Recent":[68],"work":[69],"breaks":[70],"quadratic":[72],"barrier,":[73],"but":[74],"demands":[75],"linear":[76],"runtime":[77,160,196],"relies":[79],"on":[80],"shared":[81,130,154,209],"randomness.":[82,210],"This":[83,141,185],"paper":[84],"addresses":[85],"challenge":[87],"designing":[89],"that":[92,114,192,223],"are":[93],"simultaneously":[94],"time-efficient,":[95],"message-efficient,":[96],"Byzantine":[98,119,189],"fault-tolerant,":[99],"assuming":[100],"only":[101],"authentication.":[103],"We":[104],"present":[105],"two":[106],"randomized":[107],"for":[109,121,201],"tolerate":[115],"up":[116],"$(1/3-\u03b4)n$":[118],"failures":[120],"any":[122],"constant":[123],"$\u03b4>0$.":[124],"Our":[125,149],"first":[126,188],"algorithm,":[127],"which":[128],"assumes":[129],"randomness,":[131],"terminates":[132],"in":[133],"$O(\\text{poly-log}(n))$":[134,159],"rounds":[135],"$\\tilde{O}(n)$":[137],"total":[138,163],"communication":[139,164,199],"cost.":[140],"matches":[142],"known":[143],"lower":[144],"bounds":[145],"within":[146],"poly-logarithmic":[147,195],"factor.":[148],"second":[150],"algorithm":[151,191],"eliminates":[152],"randomness":[155],"assumption":[156],"achieves":[158,193],"$\\tilde{O}(n+\\min\\{nf,T\\})$":[162],"cost,":[165],"where":[166],"$f$":[167],"actual":[170],"number":[171],"faulty":[173,182],"$T$":[176],"amount":[179],"messages":[181],"sent.":[184],"gives":[186],"both":[194],"subquadratic":[198],"cost":[200,239],"wide":[203],"range":[204],"parameter":[206],"regimes,":[207],"without":[208],"key":[212],"technical":[213],"enabler":[214],"novel":[217],"scalable":[219],"committee":[220],"election":[221],"primitive":[222],"could":[224],"be":[225],"easily":[226],"integrated":[227],"into":[228],"other":[229],"solve":[232],"various":[233],"computing":[235],"problems":[236],"low":[238],"fault-tolerance.":[242]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2026-05-20T00:00:00"}