{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:75FQWMKBQ5LOYKQUTP2ZMCKCUU","short_pith_number":"pith:75FQWMKB","canonical_record":{"source":{"id":"2607.27640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:50:40Z","cross_cats_sorted":[],"title_canon_sha256":"992f1721b119b59e2d341548c3d4d2103407d4eefb55b480b1ab471d7d7991bc","abstract_canon_sha256":"527bc4fe0c46bd15b0eff4b4ab8b1a3d780e5f597c76100a62a472023b8614b7"},"schema_version":"1.0"},"canonical_sha256":"ff4b0b31418756ec2a149bf5960942a512f69a24126bf9ad6b2e3ea4ea71fe65","source":{"kind":"arxiv","id":"2607.27640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27640","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27640v1","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27640","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"75FQWMKBQ5LO","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"pith_short_16","alias_value":"75FQWMKBQ5LOYKQU","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"pith_short_8","alias_value":"75FQWMKB","created_at":"2026-07-31T01:29:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:75FQWMKBQ5LOYKQUTP2ZMCKCUU","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:50:40Z","cross_cats_sorted":[],"title_canon_sha256":"992f1721b119b59e2d341548c3d4d2103407d4eefb55b480b1ab471d7d7991bc","abstract_canon_sha256":"527bc4fe0c46bd15b0eff4b4ab8b1a3d780e5f597c76100a62a472023b8614b7"},"schema_version":"1.0"},"canonical_sha256":"ff4b0b31418756ec2a149bf5960942a512f69a24126bf9ad6b2e3ea4ea71fe65","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff4b0b31418756ec2a149bf5960942a512f69a24126bf9ad6b2e3ea4ea71fe65","last_reissued_at":"2026-07-31T01:29:00.812405Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:29:00.812405Z"},"source_kind":"arxiv","source_id":"2607.27640","source_version":1,"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-31T01:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c65xO/be737MM99Nl22/UTCF5WWfSl09tCDku3566NSqAvJVitCRAJ/mToks9myEOLz0/TKkC63tIdyyq3XBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:00:47.098218Z"},"content_sha256":"c0f7ad61d2226fbd874f2c5ff418109097132a8e13a5f2c76337ab4a30de3266","schema_version":"1.0","event_id":"sha256:c0f7ad61d2226fbd874f2c5ff418109097132a8e13a5f2c76337ab4a30de3266"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:75FQWMKBQ5LOYKQUTP2ZMCKCUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bruno Schilling, Kai Uwe Barthel, Klaus Jung, Konstantin Schall, Nico Hezel","submitted_at":"2026-07-30T03:50:40Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) represents a fundamental problem in various applications (image-search, recommendation systems). While graph-based algorithms have demonstrated a good balance between search accuracy and time, handling dynamic datasets, where data points are continuously added or removed, remains a challenge. This paper introduces the Dynamic Exploration Graph (DEG), an extension of the continuous refining Exploration Graph, which retains high search efficiency for static dataset while adding essential support for dynamic data. At the core of the DEG design are two ke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27640","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.27640/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-31T01:29:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZOHbLBXlO9dgCPmW+iYKpU0zUtmcwf2mNdaM6kpnu4+qf2Z7QOF2mBdgk4rn4+yXsO4ljJ31EWTJZjix0Y1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:00:47.098769Z"},"content_sha256":"d3719f4213bb79f31df5ed47ce4293e250f0ec7f0ef746373d29986888c46d03","schema_version":"1.0","event_id":"sha256:d3719f4213bb79f31df5ed47ce4293e250f0ec7f0ef746373d29986888c46d03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/75FQWMKBQ5LOYKQUTP2ZMCKCUU/bundle.json","state_url":"https://pith.science/pith/75FQWMKBQ5LOYKQUTP2ZMCKCUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/75FQWMKBQ5LOYKQUTP2ZMCKCUU/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-18T17:00:47Z","links":{"resolver":"https://pith.science/pith/75FQWMKBQ5LOYKQUTP2ZMCKCUU","bundle":"https://pith.science/pith/75FQWMKBQ5LOYKQUTP2ZMCKCUU/bundle.json","state":"https://pith.science/pith/75FQWMKBQ5LOYKQUTP2ZMCKCUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/75FQWMKBQ5LOYKQUTP2ZMCKCUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:75FQWMKBQ5LOYKQUTP2ZMCKCUU","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":"527bc4fe0c46bd15b0eff4b4ab8b1a3d780e5f597c76100a62a472023b8614b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:50:40Z","title_canon_sha256":"992f1721b119b59e2d341548c3d4d2103407d4eefb55b480b1ab471d7d7991bc"},"schema_version":"1.0","source":{"id":"2607.27640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27640","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27640v1","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27640","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"pith_short_12","alias_value":"75FQWMKBQ5LO","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"pith_short_16","alias_value":"75FQWMKBQ5LOYKQU","created_at":"2026-07-31T01:29:00Z"},{"alias_kind":"pith_short_8","alias_value":"75FQWMKB","created_at":"2026-07-31T01:29:00Z"}],"graph_snapshots":[{"event_id":"sha256:d3719f4213bb79f31df5ed47ce4293e250f0ec7f0ef746373d29986888c46d03","target":"graph","created_at":"2026-07-31T01:29:00Z","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/2607.27640/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) represents a fundamental problem in various applications (image-search, recommendation systems). While graph-based algorithms have demonstrated a good balance between search accuracy and time, handling dynamic datasets, where data points are continuously added or removed, remains a challenge. This paper introduces the Dynamic Exploration Graph (DEG), an extension of the continuous refining Exploration Graph, which retains high search efficiency for static dataset while adding essential support for dynamic data. At the core of the DEG design are two ke","authors_text":"Bruno Schilling, Kai Uwe Barthel, Klaus Jung, Konstantin Schall, Nico Hezel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:50:40Z","title":"Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27640","kind":"arxiv","version":1},"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:c0f7ad61d2226fbd874f2c5ff418109097132a8e13a5f2c76337ab4a30de3266","target":"record","created_at":"2026-07-31T01:29:00Z","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":"527bc4fe0c46bd15b0eff4b4ab8b1a3d780e5f597c76100a62a472023b8614b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:50:40Z","title_canon_sha256":"992f1721b119b59e2d341548c3d4d2103407d4eefb55b480b1ab471d7d7991bc"},"schema_version":"1.0","source":{"id":"2607.27640","kind":"arxiv","version":1}},"canonical_sha256":"ff4b0b31418756ec2a149bf5960942a512f69a24126bf9ad6b2e3ea4ea71fe65","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff4b0b31418756ec2a149bf5960942a512f69a24126bf9ad6b2e3ea4ea71fe65","first_computed_at":"2026-07-31T01:29:00.812405Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:29:00.812405Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0f7ad61d2226fbd874f2c5ff418109097132a8e13a5f2c76337ab4a30de3266","sha256:d3719f4213bb79f31df5ed47ce4293e250f0ec7f0ef746373d29986888c46d03"],"state_sha256":"2be6d1bfa2d0358ddf3b7d02efc5833de6b913f8c8641cbe077772e49dc09047"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAFVwYw5GQqwPH8DS82goTFgtkPXuNl9StzNybR1c48EM3TQfQTiKftG/jmBD8m6jHZZ7Ser0+wXHWOC8l9FAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:00:47.106348Z","bundle_sha256":"6b66c76f49cb11fdc3e31de693fbf32102b907bf543411a8595ecd2e17b04f53"}}