{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MYKXOZNFU744TFKLQ7DGZFJZSX","short_pith_number":"pith:MYKXOZNF","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"},"canonical_sha256":"66157765a5a7f9c9954b87c66c953995edbdc402c926ecf4bc040a37080f7093","source":{"kind":"arxiv","id":"2307.10479","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.10479","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"2307.10479v2","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10479","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"MYKXOZNFU744","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"pith_short_16","alias_value":"MYKXOZNFU744TFKL","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"pith_short_8","alias_value":"MYKXOZNF","created_at":"2026-07-05T06:33:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MYKXOZNFU744TFKLQ7DGZFJZSX","target":"record","payload":{"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"},"canonical_sha256":"66157765a5a7f9c9954b87c66c953995edbdc402c926ecf4bc040a37080f7093","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"},"source_kind":"arxiv","source_id":"2307.10479","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fiyjt68dgCU7epjpjfYYYH01nzm/m/jHbkn+wL/NlSL4qgQ9huuomjP3are9cB5XsXZCcCqdH35rT7U9r6ZbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T18:29:06.785661Z"},"content_sha256":"2ec74b2e9b99e37fe1bbc3ae4e20bab11dae84d6ee266a0c2a009e080d1bf3c6","schema_version":"1.0","event_id":"sha256:2ec74b2e9b99e37fe1bbc3ae4e20bab11dae84d6ee266a0c2a009e080d1bf3c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MYKXOZNFU744TFKLQ7DGZFJZSX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1EHa14ba4iF75O3WqVHI29aZNl/YMNmBU+hMjvUliVrIISjwnSgpFVEjLe23DiV1d1jbZQb2sLGHv0NAAA2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T18:29:06.786279Z"},"content_sha256":"323c0638c5a0421910cda63d4a3910a04b0e2799d799b653636303c9cdc19d4b","schema_version":"1.0","event_id":"sha256:323c0638c5a0421910cda63d4a3910a04b0e2799d799b653636303c9cdc19d4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/bundle.json","state_url":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T18:29:06Z","links":{"resolver":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX","bundle":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/bundle.json","state":"https://pith.science/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYKXOZNFU744TFKLQ7DGZFJZSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MYKXOZNFU744TFKLQ7DGZFJZSX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"caa451b0ed94a9d22c7b2ab8142a31175bb49bbe2e98630e3858667ba2ce3478","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-07-19T22:20:06Z","title_canon_sha256":"a22cbed4849bb4b7783668d96c2572bdeb6b393d0bb5e2b4aa9f8fb226e497d0"},"schema_version":"1.0","source":{"id":"2307.10479","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.10479","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"2307.10479v2","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10479","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"MYKXOZNFU744","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"pith_short_16","alias_value":"MYKXOZNFU744TFKL","created_at":"2026-07-05T06:33:34Z"},{"alias_kind":"pith_short_8","alias_value":"MYKXOZNF","created_at":"2026-07-05T06:33:34Z"}],"graph_snapshots":[{"event_id":"sha256:323c0638c5a0421910cda63d4a3910a04b0e2799d799b653636303c9cdc19d4b","target":"graph","created_at":"2026-07-05T06:33:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.10479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kai Uwe Barthel, Klaus Jung, Konstantin Schall, Nico Hezel","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-07-19T22:20:06Z","title":"Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.10479","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ec74b2e9b99e37fe1bbc3ae4e20bab11dae84d6ee266a0c2a009e080d1bf3c6","target":"record","created_at":"2026-07-05T06:33:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"caa451b0ed94a9d22c7b2ab8142a31175bb49bbe2e98630e3858667ba2ce3478","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-07-19T22:20:06Z","title_canon_sha256":"a22cbed4849bb4b7783668d96c2572bdeb6b393d0bb5e2b4aa9f8fb226e497d0"},"schema_version":"1.0","source":{"id":"2307.10479","kind":"arxiv","version":2}},"canonical_sha256":"66157765a5a7f9c9954b87c66c953995edbdc402c926ecf4bc040a37080f7093","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66157765a5a7f9c9954b87c66c953995edbdc402c926ecf4bc040a37080f7093","first_computed_at":"2026-07-05T06:33:34.129963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:33:34.129963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i/NhGlkWCMUfIM8cL9Gv2jN115JCsK/IWqWfsfooxWJ6bef2YMX24NEIrzSu/uzpLeTETgWWrPVr1PQ85EXvBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:33:34.130329Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.10479","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ec74b2e9b99e37fe1bbc3ae4e20bab11dae84d6ee266a0c2a009e080d1bf3c6","sha256:323c0638c5a0421910cda63d4a3910a04b0e2799d799b653636303c9cdc19d4b"],"state_sha256":"39864fa007896e57e4f937f22843668f33f816c0774736fa122ae17bd32ea57f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBitYhG87oLZhfaSsnI3tB3r2p4pWRUIG0nIT8Tj005O7GrclN+1Rqd+Z5S1rJrq2fE0M9qUFWkBMfLGiV1jCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T18:29:06.789975Z","bundle_sha256":"66a136d3ef783d6ff6a80dcdd60dc2c10f28791a4a2eba5d77a973c57646de5e"}}