{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QM27Q5K6BW3SZZEEXWKQIPWODU","short_pith_number":"pith:QM27Q5K6","schema_version":"1.0","canonical_sha256":"8335f8755e0db72ce484bd95043ece1d081c0ecda9cd5567b2a89f6be2400cee","source":{"kind":"arxiv","id":"2607.02338","version":1},"attestation_state":"computed","paper":{"title":"HNSW with Accuracy Guarantees Using Graph Spanners -- A Technical Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.IR","cs.LG"],"primary_cat":"cs.DB","authors_text":"Gautam Das, Minghao Li, Nick Koudas, Raghav Mittal, Sanjivni Rana, Suraj Shetiya","submitted_at":"2026-07-02T15:44:43Z","abstract_excerpt":"Hierarchical Navigable Small World (HNSW) graphs serve as the industry standard due to their logarithmic complexity and strong empirical performance. However, HNSW relies on greedy graph traversal, a heuristic that provides no theoretical guarantees of correctness. In this paper, we propose a novel \"Certify-then-Rectify\" framework that bridges the gap between the speed of heuristic search and the rigor of exact retrieval. Rather than discarding HNSW, our approach first employs a distribution-free statistical certifier to dynamically evaluate the quality of a standard HNSW search with minimal o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.02338","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-07-02T15:44:43Z","cross_cats_sorted":["cs.CL","cs.IR","cs.LG"],"title_canon_sha256":"372db7c2b4d6e9c0f971f5d3110309e2eda6ac2c89bfd27f2235d198bdfd28bd","abstract_canon_sha256":"af7fc26828e68d5acc2471ce2a7117dbcea5cf1e0875b8d2dc0fbb2f5e2754ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:48.810949Z","signature_b64":"3qxuUtHq9MYSn5SDY4bi6J0hUppdMxxpDlr5mB9fMKrv1yrSY27hKHYjmJFu662KMrRAm4pZ3CRNVLvqsrSzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8335f8755e0db72ce484bd95043ece1d081c0ecda9cd5567b2a89f6be2400cee","last_reissued_at":"2026-07-03T01:17:48.810544Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:48.810544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HNSW with Accuracy Guarantees Using Graph Spanners -- A Technical Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.IR","cs.LG"],"primary_cat":"cs.DB","authors_text":"Gautam Das, Minghao Li, Nick Koudas, Raghav Mittal, Sanjivni Rana, Suraj Shetiya","submitted_at":"2026-07-02T15:44:43Z","abstract_excerpt":"Hierarchical Navigable Small World (HNSW) graphs serve as the industry standard due to their logarithmic complexity and strong empirical performance. However, HNSW relies on greedy graph traversal, a heuristic that provides no theoretical guarantees of correctness. In this paper, we propose a novel \"Certify-then-Rectify\" framework that bridges the gap between the speed of heuristic search and the rigor of exact retrieval. Rather than discarding HNSW, our approach first employs a distribution-free statistical certifier to dynamically evaluate the quality of a standard HNSW search with minimal o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02338","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.02338/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.02338","created_at":"2026-07-03T01:17:48.810606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02338v1","created_at":"2026-07-03T01:17:48.810606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02338","created_at":"2026-07-03T01:17:48.810606+00:00"},{"alias_kind":"pith_short_12","alias_value":"QM27Q5K6BW3S","created_at":"2026-07-03T01:17:48.810606+00:00"},{"alias_kind":"pith_short_16","alias_value":"QM27Q5K6BW3SZZEE","created_at":"2026-07-03T01:17:48.810606+00:00"},{"alias_kind":"pith_short_8","alias_value":"QM27Q5K6","created_at":"2026-07-03T01:17:48.810606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU","json":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU.json","graph_json":"https://pith.science/api/pith-number/QM27Q5K6BW3SZZEEXWKQIPWODU/graph.json","events_json":"https://pith.science/api/pith-number/QM27Q5K6BW3SZZEEXWKQIPWODU/events.json","paper":"https://pith.science/paper/QM27Q5K6"},"agent_actions":{"view_html":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU","download_json":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU.json","view_paper":"https://pith.science/paper/QM27Q5K6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02338&json=true","fetch_graph":"https://pith.science/api/pith-number/QM27Q5K6BW3SZZEEXWKQIPWODU/graph.json","fetch_events":"https://pith.science/api/pith-number/QM27Q5K6BW3SZZEEXWKQIPWODU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU/action/storage_attestation","attest_author":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU/action/author_attestation","sign_citation":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU/action/citation_signature","submit_replication":"https://pith.science/pith/QM27Q5K6BW3SZZEEXWKQIPWODU/action/replication_record"}},"created_at":"2026-07-03T01:17:48.810606+00:00","updated_at":"2026-07-03T01:17:48.810606+00:00"}