{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XX2WQSCXZNQHX64RTLH7E7OF3K","short_pith_number":"pith:XX2WQSCX","schema_version":"1.0","canonical_sha256":"bdf5684857cb607bfb919acff27dc5dab19d37cd978803f842fccd1f45eca26d","source":{"kind":"arxiv","id":"2507.14060","version":1},"attestation_state":"computed","paper":{"title":"Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashwin Padaki, Erik Waingarten, Sanjeev Khanna","submitted_at":"2025-07-18T16:41:21Z","abstract_excerpt":"We initiate the study of approximation algorithms and computational barriers for constructing sparse $\\alpha$-navigable graphs [IX23, DGM+24], a core primitive underlying recent advances in graph-based nearest neighbor search. Given an $n$-point dataset $P$ with an associated metric $\\mathsf{d}$ and a parameter $\\alpha \\geq 1$, the goal is to efficiently build the sparsest graph $G=(P, E)$ that is $\\alpha$-navigable: for every distinct $s, t \\in P$, there exists an edge $(s, u) \\in E$ with $\\mathsf{d}(u, t) < \\mathsf{d}(s, t)/\\alpha$. We consider two natural sparsity objectives: minimizing the"},"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":"2507.14060","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-18T16:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"f12ccc8f3a6348ce4667a1021638792d976e95630e674f9f7411858448bf86c3","abstract_canon_sha256":"ff8d7d7e64baf2a47c2adad4d9b2a3eb88b68219fc34af68bc153cd40d0dd830"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:27.978857Z","signature_b64":"Ype53d2WDu1j0dP89vMLQAbYzaiBtCdq6cIANhPUjyytbc1M349ck2mlN9kjfRUPGTFWGbnmXBXR5CUI3i4uAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf5684857cb607bfb919acff27dc5dab19d37cd978803f842fccd1f45eca26d","last_reissued_at":"2026-07-05T11:39:27.978358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:27.978358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashwin Padaki, Erik Waingarten, Sanjeev Khanna","submitted_at":"2025-07-18T16:41:21Z","abstract_excerpt":"We initiate the study of approximation algorithms and computational barriers for constructing sparse $\\alpha$-navigable graphs [IX23, DGM+24], a core primitive underlying recent advances in graph-based nearest neighbor search. Given an $n$-point dataset $P$ with an associated metric $\\mathsf{d}$ and a parameter $\\alpha \\geq 1$, the goal is to efficiently build the sparsest graph $G=(P, E)$ that is $\\alpha$-navigable: for every distinct $s, t \\in P$, there exists an edge $(s, u) \\in E$ with $\\mathsf{d}(u, t) < \\mathsf{d}(s, t)/\\alpha$. We consider two natural sparsity objectives: minimizing the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14060","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/2507.14060/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":"2507.14060","created_at":"2026-07-05T11:39:27.978411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14060v1","created_at":"2026-07-05T11:39:27.978411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14060","created_at":"2026-07-05T11:39:27.978411+00:00"},{"alias_kind":"pith_short_12","alias_value":"XX2WQSCXZNQH","created_at":"2026-07-05T11:39:27.978411+00:00"},{"alias_kind":"pith_short_16","alias_value":"XX2WQSCXZNQHX64R","created_at":"2026-07-05T11:39:27.978411+00:00"},{"alias_kind":"pith_short_8","alias_value":"XX2WQSCX","created_at":"2026-07-05T11:39:27.978411+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/XX2WQSCXZNQHX64RTLH7E7OF3K","json":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K.json","graph_json":"https://pith.science/api/pith-number/XX2WQSCXZNQHX64RTLH7E7OF3K/graph.json","events_json":"https://pith.science/api/pith-number/XX2WQSCXZNQHX64RTLH7E7OF3K/events.json","paper":"https://pith.science/paper/XX2WQSCX"},"agent_actions":{"view_html":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K","download_json":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K.json","view_paper":"https://pith.science/paper/XX2WQSCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14060&json=true","fetch_graph":"https://pith.science/api/pith-number/XX2WQSCXZNQHX64RTLH7E7OF3K/graph.json","fetch_events":"https://pith.science/api/pith-number/XX2WQSCXZNQHX64RTLH7E7OF3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K/action/storage_attestation","attest_author":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K/action/author_attestation","sign_citation":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K/action/citation_signature","submit_replication":"https://pith.science/pith/XX2WQSCXZNQHX64RTLH7E7OF3K/action/replication_record"}},"created_at":"2026-07-05T11:39:27.978411+00:00","updated_at":"2026-07-05T11:39:27.978411+00:00"}