{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MYKXOZNFU744TFKLQ7DGZFJZSX","short_pith_number":"pith:MYKXOZNF","schema_version":"1.0","canonical_sha256":"66157765a5a7f9c9954b87c66c953995edbdc402c926ecf4bc040a37080f7093","source":{"kind":"arxiv","id":"2307.10479","version":2},"attestation_state":"computed","paper":{"title":"Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.IR","authors_text":"Kai Uwe Barthel, Klaus Jung, Konstantin Schall, Nico Hezel","submitted_at":"2023-07-19T22:20:06Z","abstract_excerpt":"For approximate nearest neighbor search, graph-based algorithms have shown to offer the best trade-off between accuracy and search time. We propose the Dynamic Exploration Graph (DEG) which significantly outperforms existing algorithms in terms of search and exploration efficiency by combining two new ideas: First, a single undirected even regular graph is incrementally built by partially replacing existing edges to integrate new vertices and to update old neighborhoods at the same time. Secondly, an edge optimization algorithm is used to continuously improve the quality of the graph. Combinin"},"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":"2307.10479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-07-19T22:20:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a22cbed4849bb4b7783668d96c2572bdeb6b393d0bb5e2b4aa9f8fb226e497d0","abstract_canon_sha256":"caa451b0ed94a9d22c7b2ab8142a31175bb49bbe2e98630e3858667ba2ce3478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:34.130329Z","signature_b64":"i/NhGlkWCMUfIM8cL9Gv2jN115JCsK/IWqWfsfooxWJ6bef2YMX24NEIrzSu/uzpLeTETgWWrPVr1PQ85EXvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66157765a5a7f9c9954b87c66c953995edbdc402c926ecf4bc040a37080f7093","last_reissued_at":"2026-07-05T06:33:34.129963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:34.129963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.IR","authors_text":"Kai Uwe Barthel, Klaus Jung, Konstantin Schall, Nico Hezel","submitted_at":"2023-07-19T22:20:06Z","abstract_excerpt":"For approximate nearest neighbor search, graph-based algorithms have shown to offer the best trade-off between accuracy and search time. We propose the Dynamic Exploration Graph (DEG) which significantly outperforms existing algorithms in terms of search and exploration efficiency by combining two new ideas: First, a single undirected even regular graph is incrementally built by partially replacing existing edges to integrate new vertices and to update old neighborhoods at the same time. Secondly, an edge optimization algorithm is used to continuously improve the quality of the graph. Combinin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.10479","kind":"arxiv","version":2},"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/2307.10479/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":"2307.10479","created_at":"2026-07-05T06:33:34.130019+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.10479v2","created_at":"2026-07-05T06:33:34.130019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10479","created_at":"2026-07-05T06:33:34.130019+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYKXOZNFU744","created_at":"2026-07-05T06:33:34.130019+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYKXOZNFU744TFKL","created_at":"2026-07-05T06:33:34.130019+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYKXOZNF","created_at":"2026-07-05T06:33:34.130019+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19802","citing_title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX","json":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX.json","graph_json":"https://pith.science/api/pith-number/MYKXOZNFU744TFKLQ7DGZFJZSX/graph.json","events_json":"https://pith.science/api/pith-number/MYKXOZNFU744TFKLQ7DGZFJZSX/events.json","paper":"https://pith.science/paper/MYKXOZNF"},"agent_actions":{"view_html":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX","download_json":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX.json","view_paper":"https://pith.science/paper/MYKXOZNF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.10479&json=true","fetch_graph":"https://pith.science/api/pith-number/MYKXOZNFU744TFKLQ7DGZFJZSX/graph.json","fetch_events":"https://pith.science/api/pith-number/MYKXOZNFU744TFKLQ7DGZFJZSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/action/storage_attestation","attest_author":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/action/author_attestation","sign_citation":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/action/citation_signature","submit_replication":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/action/replication_record"}},"created_at":"2026-07-05T06:33:34.130019+00:00","updated_at":"2026-07-05T06:33:34.130019+00:00"}