{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EC62QQ6J6EIFKVDN2KB7BLCUDA","short_pith_number":"pith:EC62QQ6J","schema_version":"1.0","canonical_sha256":"20bda843c9f11055546dd283f0ac54182d06d4b4cfcbb223d4ab8c8b4194d207","source":{"kind":"arxiv","id":"2505.17368","version":1},"attestation_state":"computed","paper":{"title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abolfazl Asudeh, Mohsen Dehghankar","submitted_at":"2025-05-23T00:42:01Z","abstract_excerpt":"Hierarchical graph-based algorithms such as HNSW have achieved state-of-the-art performance for Approximate Nearest Neighbor (ANN) search in practice, yet they often lack theoretical guarantees on query time or recall due to their heavy use of randomized heuristic constructions. Conversely, existing theoretically grounded structures are typically difficult to implement and struggle to scale in real-world scenarios. We propose the Hierarchical $\\varepsilon$-Net Navigation Graph (HENN), a novel graph-based indexing structure for ANN search that combines strong theoretical guarantees with practic"},"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":"2505.17368","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-23T00:42:01Z","cross_cats_sorted":[],"title_canon_sha256":"1b3b69dbda9713f73c971e5047eec183562247cd8aab9ec673c2012cfb8d7e94","abstract_canon_sha256":"f945b300de86a82d7b54315ef425d60e605b4341aee7ad68024266554ec1f9b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:24.798393Z","signature_b64":"dqbJMGR0//ZmGZdc0+Gk3csFQdJyhsbydZYH0U158eF2l3rOXSuNWzv9C8WGDlBqtfmdKYbrwG/th8A2QBO/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20bda843c9f11055546dd283f0ac54182d06d4b4cfcbb223d4ab8c8b4194d207","last_reissued_at":"2026-07-05T11:08:24.797909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:24.797909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abolfazl Asudeh, Mohsen Dehghankar","submitted_at":"2025-05-23T00:42:01Z","abstract_excerpt":"Hierarchical graph-based algorithms such as HNSW have achieved state-of-the-art performance for Approximate Nearest Neighbor (ANN) search in practice, yet they often lack theoretical guarantees on query time or recall due to their heavy use of randomized heuristic constructions. Conversely, existing theoretically grounded structures are typically difficult to implement and struggle to scale in real-world scenarios. We propose the Hierarchical $\\varepsilon$-Net Navigation Graph (HENN), a novel graph-based indexing structure for ANN search that combines strong theoretical guarantees with practic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17368","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/2505.17368/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":"2505.17368","created_at":"2026-07-05T11:08:24.797967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.17368v1","created_at":"2026-07-05T11:08:24.797967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17368","created_at":"2026-07-05T11:08:24.797967+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC62QQ6J6EIF","created_at":"2026-07-05T11:08:24.797967+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC62QQ6J6EIFKVDN","created_at":"2026-07-05T11:08:24.797967+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC62QQ6J","created_at":"2026-07-05T11:08:24.797967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07770","citing_title":"FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA","json":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA.json","graph_json":"https://pith.science/api/pith-number/EC62QQ6J6EIFKVDN2KB7BLCUDA/graph.json","events_json":"https://pith.science/api/pith-number/EC62QQ6J6EIFKVDN2KB7BLCUDA/events.json","paper":"https://pith.science/paper/EC62QQ6J"},"agent_actions":{"view_html":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA","download_json":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA.json","view_paper":"https://pith.science/paper/EC62QQ6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.17368&json=true","fetch_graph":"https://pith.science/api/pith-number/EC62QQ6J6EIFKVDN2KB7BLCUDA/graph.json","fetch_events":"https://pith.science/api/pith-number/EC62QQ6J6EIFKVDN2KB7BLCUDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA/action/storage_attestation","attest_author":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA/action/author_attestation","sign_citation":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA/action/citation_signature","submit_replication":"https://pith.science/pith/EC62QQ6J6EIFKVDN2KB7BLCUDA/action/replication_record"}},"created_at":"2026-07-05T11:08:24.797967+00:00","updated_at":"2026-07-05T11:08:24.797967+00:00"}