{"id":"https://openalex.org/W7167092524","doi":"https://doi.org/10.48550/arxiv.2607.00857","title":"Warm-Starting All-Pairs Shortest Paths with Predictions","display_name":"Warm-Starting All-Pairs Shortest Paths with Predictions","publication_year":2026,"publication_date":"2026-07-01","ids":{"openalex":"https://openalex.org/W7167092524","doi":"https://doi.org/10.48550/arxiv.2607.00857"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00857","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00857","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.2607.00857","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064315511","display_name":"Adam Polak","orcid":"https://orcid.org/0000-0003-4925-774X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Polak, Adam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139896681","display_name":"Jonas Schmidt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schmidt, Jonas","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.833899974822998,"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.833899974822998,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.08479999750852585,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.02759999968111515,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6363000273704529},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5449000000953674},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.46000000834465027},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4162999987602234},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4124999940395355},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.38589999079704285},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3172999918460846}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6363000273704529},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6007000207901001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5551999807357788},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5449000000953674},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.46000000834465027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4397999942302704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4189999997615814},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4162999987602234},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4124999940395355},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.38589999079704285},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3172999918460846},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3131999969482422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3066999912261963},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.26109999418258667},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.25429999828338623},{"id":"https://openalex.org/C36686422","wikidata":"https://www.wikidata.org/wiki/Q11167","display_name":"Tilde","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00857","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00857","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.2607.00857","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00857","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"One":[0],"of":[1,6,31,36,71,73,82,102,104,120],"the":[2,24,29,34,68,76,95,100,110,121,130,144,156,160,180,190,207],"three":[3],"key":[4],"hypotheses":[5],"fine-grained":[7,202],"complexity":[8],"asserts":[9],"that":[10,50],"computing":[11],"All-Pairs":[12],"Shortest":[13],"Paths":[14],"(APSP)":[15],"requires":[16],"cubic":[17],"time,":[18],"up":[19],"to":[20,115,176],"subpolynomial":[21],"factors,":[22],"in":[23,33,67,87,179],"worst":[25],"case.":[26],"We":[27,45,153],"initiate":[28],"study":[30],"APSP":[32,48,208],"paradigm":[35],"algorithms":[37,197],"with":[38,200],"predictions,":[39],"also":[40],"known":[41,201],"as":[42,52,99],"learning-augmented":[43,196],"algorithms.":[44],"propose":[46],"an":[47],"algorithm":[49,85,158,175],"takes":[51],"additional":[53],"input":[54],"a":[55,60],"\\emph{prediction}":[56],"(e.g.,":[57],"given":[58],"by":[59,164],"model":[61],"learned":[62],"from":[63,185],"similar":[64],"instances":[65],"seen":[66],"past)":[69],"consisting":[70],"sets":[72],"vertices":[74,105],"causing":[75],"shortest":[77,122],"\\emph{detour}":[78],"for":[79,106,159,198],"each":[80],"pair":[81],"vertices.":[83],"The":[84],"runs":[86],"time":[88],"$\\mathcal{O}(n^{2.83}":[89],"+":[90],"\u03b7n)$,":[91],"where":[92],"$\u03b7$":[93],"denotes":[94],"\\emph{prediction":[96],"error}":[97],"defined":[98],"number":[101],"pairs":[103],"which,":[107],"informally":[108],"speaking,":[109],"prediction":[111,131,145],"was":[112],"not":[113],"sufficient":[114],"compute":[116],"and":[117,168,183],"certify":[118],"optimality":[119],"path":[123],"length.":[124],"This":[125],"is":[126,133,146],"already":[127],"subcubic":[128],"when":[129],"error":[132],"(polynomially)":[134],"smaller":[135],"than":[136,151],"its":[137],"maximum":[138],"possible":[139],"values":[140],"$n^2$,":[141],"i.e.,":[142],"whenever":[143],"at":[147],"least":[148],"slightly":[149],"better":[150],"terrible.":[152],"build":[154],"on":[155,206],"co-nondeterministic":[157],"Exact":[161],"Triangle":[162],"problem":[163],"Chan,":[165],"Vassilevska":[166],"Williams,":[167],"Xu":[169],"(STOC":[170],"2023),":[171],"essentially":[172],"enabling":[173],"this":[174],"detect":[177],"mistakes":[178],"nondeterministic":[181],"certificate":[182],"recover":[184],"them.":[186],"Our":[187],"result":[188],"constitutes":[189],"first":[191],"necessary":[192],"step":[193],"towards":[194],"designing":[195],"problems":[199],"lower":[203],"bounds":[204],"conditioned":[205],"Hypothesis.":[209]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}