{"id":"https://openalex.org/W7167222855","doi":"https://doi.org/10.48550/arxiv.2607.02338","title":"HNSW with Accuracy Guarantees Using Graph Spanners","display_name":"HNSW with Accuracy Guarantees Using Graph Spanners","publication_year":2026,"publication_date":"2026-07-02","ids":{"openalex":"https://openalex.org/W7167222855","doi":"https://doi.org/10.48550/arxiv.2607.02338"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.02338","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02338","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.02338","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139991758","display_name":"Minghao Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Minghao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139949907","display_name":"Raghav Mittal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mittal, Raghav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139829212","display_name":"Sanjivni Rana","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rana, Sanjivni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046581906","display_name":"Suraj Shetiya","orcid":"https://orcid.org/0000-0001-9166-2365"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shetiya, Suraj","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136581531","display_name":"Gautam Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Gautam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035257754","display_name":"Nick Koudas","orcid":"https://orcid.org/0000-0001-5648-0638"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koudas, Nick","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/T12292","display_name":"Graph Theory and Algorithms","score":0.29249998927116394,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.29249998927116394,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.28850001096725464,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.051899999380111694,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/correctness","display_name":"Correctness","score":0.5674999952316284},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.564300000667572},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5038999915122986},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4952999949455261},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.460099995136261},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42309999465942383},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.39410001039505005},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.302700012922287}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6517999768257141},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5674999952316284},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.564300000667572},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4952999949455261},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.460099995136261},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42309999465942383},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4219000041484833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4090000092983246},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37959998846054077},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C182449105","wikidata":"https://www.wikidata.org/wiki/Q3099732","display_name":"Technical report","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27889999747276306},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C46304622","wikidata":"https://www.wikidata.org/wiki/Q374814","display_name":"Certification","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2572999894618988},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.02338","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02338","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.02338","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.02338","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":[{"score":0.6293930411338806,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Hierarchical":[0],"Navigable":[1],"Small":[2],"World":[3],"(HNSW)":[4],"graphs":[5],"serve":[6],"as":[7,119],"the":[8,47,50,56,76,90,97,116,142,160,167],"industry":[9],"standard":[10,80],"due":[11],"to":[12,73,101,128,139],"their":[13],"logarithmic":[14],"complexity":[15],"and":[16,55,123,173],"strong":[17],"empirical":[18,133],"performance.":[19],"However,":[20],"HNSW":[21,81,117,164],"relies":[22],"on":[23,151],"greedy":[24],"graph":[25,118],"traversal,":[26],"a":[27,41,69,79,102,120],"heuristic":[28,53],"that":[29,45,89,155],"provides":[30],"no":[31],"theoretical":[32],"guarantees":[33],"of":[34,52,58,78,94,145,163,170],"correctness.":[35],"In":[36],"this":[37,109],"paper,":[38],"we":[39,114],"propose":[40],"novel":[42],"\"Certify-then-Rectify\"":[43],"framework":[44,98,158],"bridges":[46],"gap":[48],"between":[49],"speed":[51,162],"search":[54,82,172],"rigor":[57],"exact":[59,104,110,171],"retrieval.":[60],"Rather":[61],"than":[62],"discarding":[63],"HNSW,":[64],"our":[65,156],"approach":[66],"first":[67],"employs":[68],"distribution-free":[70],"statistical":[71],"certifier":[72],"dynamically":[74],"evaluate":[75],"quality":[77],"with":[83],"minimal":[84],"overhead.":[85],"If":[86],"certification":[87],"indicates":[88],"retrieved":[91],"neighbors":[92],"are":[93],"low":[95],"quality,":[96],"safely":[99],"escalates":[100],"rigorous":[103],"recovery":[105,111],"algorithm.":[106],"To":[107],"make":[108],"computationally":[112],"feasible,":[113],"reinterpret":[115],"geometric":[121],"spanner":[122],"utilize":[124],"Extreme":[125],"Value":[126],"Theory":[127],"stochastically":[129],"estimate":[130],"its":[131],"maximum":[132,143],"stretch":[134],"factor.":[135],"This":[136],"allows":[137],"us":[138],"mathematically":[140],"bound":[141],"distance":[144],"true":[146],"nearest":[147],"neighbors.":[148],"Extensive":[149],"evaluations":[150],"benchmark":[152],"datasets":[153],"demonstrate":[154],"tiered":[157],"delivers":[159],"average-case":[161],"while":[165],"ensuring":[166],"worst-case":[168],"correctness":[169],"outperforming":[174],"other":[175],"applicable":[176],"approaches.":[177]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-04T00:00:00"}