{"id":"https://openalex.org/W4414945630","doi":"https://doi.org/10.1145/3801897","title":"Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model","display_name":"Deterministic Lower Bounds for k-Edge Connectivity in the Distributed Sketching Model","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W4414945630","doi":"https://doi.org/10.1145/3801897"},"language":"en","primary_location":{"id":"doi:10.1145/3801897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3801897","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.11257","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070507440","display_name":"Peter Robinson","orcid":"https://orcid.org/0000-0002-2537-4872"},"institutions":[{"id":"https://openalex.org/I25041050","display_name":"Augusta University","ror":"https://ror.org/012mef835","country_code":"US","type":"education","lineage":["https://openalex.org/I25041050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Robinson","raw_affiliation_strings":["Augusta University, Augusta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0002-7442-7002","affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, GA, USA","institution_ids":["https://openalex.org/I25041050"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102936309","display_name":"Ming Ming Tan","orcid":"https://orcid.org/0000-0002-5279-5314"},"institutions":[{"id":"https://openalex.org/I4210087454","display_name":"Augusta University Health","ror":"https://ror.org/007rawr89","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210087454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ming Ming Tan","raw_affiliation_strings":["Augusta University, Augusta, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-5279-5314","affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, Singapore","institution_ids":["https://openalex.org/I4210087454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0084387,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"2","first_page":"1","last_page":"21"},"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.998199999332428,"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.998199999332428,"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/T12288","display_name":"Optimization and Search Problems","score":0.9919999837875366,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7275000214576721},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5257999897003174},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5059999823570251},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4375999867916107},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.42080000042915344},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.3917999863624573},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.36079999804496765},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.32749998569488525},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.325300008058548}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7275000214576721},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5257999897003174},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5059999823570251},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49570000171661377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44200000166893005},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43880000710487366},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4375999867916107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4343999922275543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42800000309944153},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.42080000042915344},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.32749998569488525},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28999999165534973},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.26420000195503235},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.25949999690055847},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.25760000944137573},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.2572000026702881}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3801897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3801897","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2507.11257","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.11257","pdf_url":"https://arxiv.org/pdf/2507.11257","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2507.11257","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.11257","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":"pmh:oai:arXiv.org:2507.11257","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.11257","pdf_url":"https://arxiv.org/pdf/2507.11257","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4915190492","display_name":"Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation","funder_award_id":"2402836","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7190952238","display_name":"CRII: AF: The Impact of Knowledge on the Performance of Distributed Algorithms","funder_award_id":"2348346","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,59],"study":[1],"the":[2,11,30,38,41,46,56,61,82,131,142,196,199,211,219,228],"k":[3,49,89,93,99,234],"-edge":[4,50,94,235],"connectivity":[5,69,138,236],"problem":[6,70,140,166,173],"on":[7,33],"undirected":[8],"graphs":[9],"in":[10,37,71,141,218,243],"distributed":[12,143],"sketching":[13,145],"model,":[14],"where":[15],"we":[16,79,151,168,202,226],"have":[17],"n":[18,103,113],"nodes":[19],"and":[20,40,255],"a":[21,26,67,75,107,137,153,162,238],"referee.":[22],"Each":[23],"node":[24],"sends":[25],"single":[27],"message":[28,85],"to":[29,122,177,180,182,193,209,245],"referee":[31,42],"based":[32],"its":[34],"1-hop":[35],"neighborhood":[36],"graph,":[39],"must":[43],"decide":[44],"whether":[45],"graph":[47,68,144,157],"is":[48,87,130],"connected":[51],"by":[52],"taking":[53],"into":[54],"account":[55],"received":[57],"messages.":[58,224],"present":[60],"first":[62,132],"lower":[63,108,134,155,230],"bound":[64,109,135,156,231],"for":[65,92,96,118,136,215,232,258],"deciding":[66,233],"this":[72,172],"model":[73,221],"with":[74,222],"deterministic":[76,216,259],"algorithm.":[77],"Concretely,":[78],"show":[80],"that":[81,167],"worst":[83],"case":[84],"length":[86],"\u03a9(":[88],")":[90,114],"bits":[91,115],"connectivity,":[95,120],"any":[97,251],"super-constant":[98],"=":[100],"O":[101],"(\u221a":[102],").":[104],"Previously,":[105],"only":[106],"of":[110,198,213,253],"\u03a9(log":[111],"3":[112],"was":[116],"known":[117],"(1-edge)":[119],"due":[121,192],"Yu":[123],"(SODA":[124],"2021).":[125],"In":[126],"fact,":[127],"our":[128,149],"result":[129],"super-polylogarithmic":[133],"decision":[139],"model.":[146],"To":[147],"obtain":[148,227],"result,":[150],"introduce":[152,250],"new":[154,163],"construction,":[158],"as":[159,161,187],"well":[160],"communication":[164],"complexity":[165],"call":[169],"Overlap.":[170],"As":[171],"does":[174,248],"not":[175,249],"appear":[176],"be":[178],"amenable":[179],"reductions":[181],"existing":[183],"hard":[184],"problems":[185],"such":[186],"set":[188,207],"disjointness":[189],"or":[190],"indexing":[191],"correlations":[194],"between":[195],"inputs":[197],"three":[200],"players,":[201],"leverage":[203],"results":[204],"from":[205],"cross-intersecting":[206],"families":[208],"prove":[210],"hardness":[212],"Overlap":[214],"algorithms":[217],"3-party":[220],"simultaneous":[223],"Finally,":[225],"sought":[229],"via":[237],"novel":[239],"simulation":[240],"argument":[241],"that,":[242],"contrast":[244],"previous":[246],"works,":[247],"probability":[252],"error":[254],"thus":[256],"works":[257],"algorithms.":[260]},"counts_by_year":[],"updated_date":"2026-08-16T07:02:28.622633","created_date":"2025-10-08T00:00:00"}