{"id":"https://openalex.org/W7160838772","doi":"https://doi.org/10.48550/arxiv.2605.07168","title":"Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition","display_name":"Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition","publication_year":2026,"publication_date":"2026-05-08","ids":{"openalex":"https://openalex.org/W7160838772","doi":"https://doi.org/10.48550/arxiv.2605.07168"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.07168","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07168","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.07168","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135898550","display_name":"Xizhe Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Xizhe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135842866","display_name":"Yaowei Long","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Long, Yaowei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135863596","display_name":"David Pidugu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pidugu, David","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135840814","display_name":"Thatchaphol Saranurak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saranurak, Thatchaphol","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135831533","display_name":"Benyu Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Benyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"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.5813000202178955,"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.5813000202178955,"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.2906999886035919,"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.04619999974966049,"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/oracle","display_name":"Oracle","score":0.8345999717712402},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5041999816894531},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4921000003814697},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.46399998664855957},{"id":"https://openalex.org/keywords/alias","display_name":"Alias","score":0.44119998812675476},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.439300000667572},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4083000123500824},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.38499999046325684},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.36649999022483826}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8345999717712402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6330000162124634},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5519999861717224},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5041999816894531},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4921000003814697},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.46399998664855957},{"id":"https://openalex.org/C46681722","wikidata":"https://www.wikidata.org/wiki/Q4725589","display_name":"Alias","level":2,"score":0.44119998812675476},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.439300000667572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42329999804496765},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4083000123500824},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3734000027179718},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3626999855041504},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.34929999709129333},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.3481000065803528},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3140999972820282},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C207609745","wikidata":"https://www.wikidata.org/wiki/Q4944086","display_name":"Bootstrapping (finance)","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2921999990940094},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.07168","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07168","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.07168","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.07168","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":false,"raw_source_name":null,"raw_type":"article"},"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":{"We":[0],"give":[1],"an":[2,19],"improved":[3],"connectivity":[4,32],"oracle":[5,17,87],"under":[6],"vertex":[7],"failures.":[8],"After":[9],"a":[10,126],"set":[11,129],"of":[12,23],"$k$":[13],"vertices":[14],"fails,":[15],"our":[16],"performs":[18],"$O(k^{6})$-time":[20],"update":[21,60,70],"independent":[22],"the":[24,90,103],"graph":[25],"size":[26],"$n$,":[27,82],"and":[28,45,71,124],"then":[29],"answers":[30],"pairwise":[31],"queries":[33],"in":[34,49,81],"optimal":[35,134],"$O(k)$":[36,135],"time.":[37,52,73,137],"For":[38],"constant":[39],"$k$,":[40],"it":[41],"uses":[42],"near-linear":[43,50,122],"space":[44,66,108],"can":[46],"be":[47],"built":[48],"preprocessing":[51,76],"In":[53],"contrast,":[54],"all":[55],"prior":[56],"oracles":[57,118],"with":[58],"$n$-independent":[59],"time[PSS+22,":[61],"vdBS19]":[62],"either":[63],"require":[64],"$\u03a9(n^{2})$":[65],"or":[67],"incur":[68],"$2^{2^{O(k)}}$":[69],"query":[72,136],"Moreover,":[74],"their":[75],"time":[77],"is":[78],"polynomially":[79],"large":[80],"far":[83],"from":[84,109],"near-linear.":[85],"Our":[86],"builds":[88],"on":[89],"unbreakable":[91],"decomposition":[92,105],"framework":[93],"of[PSS+22],":[94],"but":[95],"introduces":[96],"three":[97],"new":[98,127],"ingredients:":[99],"(i)":[100],"shortcutting":[101],"over":[102],"tree":[104],"to":[106,111,120],"reduce":[107],"quadratic":[110],"near-linear,":[112],"(ii)":[113],"bootstrapping":[114],"that":[115,131],"leverages":[116],"$n$-dependent":[117],"internally":[119],"obtain":[121],"preprocessing,":[123],"(iii)":[125],"patch":[128],"mechanism":[130],"yields":[132],"conditionally":[133]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-12T00:00:00"}