{"id":"https://openalex.org/W4415952266","doi":"https://doi.org/10.48550/arxiv.2510.16336","title":"A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates","display_name":"A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates","publication_year":2025,"publication_date":"2025-10-18","ids":{"openalex":"https://openalex.org/W4415952266","doi":"https://doi.org/10.48550/arxiv.2510.16336"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2510.16336","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.16336","pdf_url":"https://arxiv.org/pdf/2510.16336","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2510.16336","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098402066","display_name":"Pachara Sawettamalya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sawettamalya, Pachara","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055157975","display_name":"Huacheng Yu","orcid":"https://orcid.org/0000-0003-1450-1896"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu, Huacheng","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8598999977111816,"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.8598999977111816,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.05849999934434891,"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.022600000724196434,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sketch","display_name":"Sketch","score":0.6485000252723694},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.5013999938964844},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48559999465942383},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4309999942779541},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4262000024318695},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.4090999960899353},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4034999907016754}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.6485000252723694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5138999819755554},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48559999465942383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4839000105857849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4828999936580658},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4627000093460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46059998869895935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4372999966144562},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.4090999960899353},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4034999907016754},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37700000405311584},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2510.16336","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.16336","pdf_url":"https://arxiv.org/pdf/2510.16336","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2510.16336","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.16336","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2510.16336","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.16336","pdf_url":"https://arxiv.org/pdf/2510.16336","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,82],"this":[1],"note,":[2],"we":[3],"present":[4],"a":[5,10,109,117],"simple":[6],"algorithm":[7,18,39,85],"for":[8,94,116],"computing":[9],"\\emph{$k$-connectivity":[11],"certificate}":[12],"in":[13],"dynamic":[14],"graph":[15],"streams.":[16],"Our":[17],"uses":[19],"$O(n":[20],"\\log^2":[21,66],"n":[22,26,67,98,124],"\\cdot":[23,68],"\\max\\{k,":[24,69],"\\log":[25,27,70,99,100,114,125,126],"k\\})$":[28],"bits":[29],"of":[30,40,49,112,120],"space":[31,56,89],"which":[32],"improves":[33],"upon":[34],"the":[35,47,61,88,104],"$O(kn":[36],"\\log^3":[37],"n)$-space":[38],"Ahn,":[41],"Guha,":[42],"and":[43,75,79,102],"McGregor":[44],"(SODA'12).":[45],"For":[46],"values":[48],"$k$":[50],"that":[51],"are":[52],"truly":[53],"sublinear,":[54],"our":[55,84],"usage":[57],"\\emph{very":[58],"nearly}":[59],"matches":[60],"known":[62],"lower":[63],"bound":[64],"$\u03a9(n":[65],"n\\})$":[71],"established":[72],"by":[73],"Nelson":[74],"Yu":[76],"(SODA'19;":[77],"implicit)":[78],"Robinson":[80],"(DISC'24).":[81],"particular,":[83],"fully":[86],"settles":[87],"complexity":[90],"at":[91],"$\u0398(kn":[92],"\\log^2{n})$":[93],"$k":[95,121],"=":[96,122],"\u03a9(\\log":[97],"n)$,":[101],"bridges":[103],"gap":[105],"down":[106],"to":[107],"only":[108],"doubly-logarithmic":[110],"factor":[111],"$O(\\log":[113],"n)$":[115],"smaller":[118],"range":[119],"o(\\log":[123],"n)$.":[127]},"counts_by_year":[],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2025-10-22T00:00:00"}