{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CYQKIKTOZFEE7T7Q7KMFTNCT37","short_pith_number":"pith:CYQKIKTO","canonical_record":{"source":{"id":"2607.27623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"4ec45ea938ce63328c2866ff7e3d13194ff2d5e637d61f3678fb43a8a037b5f5","abstract_canon_sha256":"65d03707650d554d0a2a89f7332c7570acfa74376a9fe0ace6d3bca16d861b5f"},"schema_version":"1.0"},"canonical_sha256":"1620a42a6ec9484fcff0fa9859b453dfcffebfd75c8bc32fa5309ca6c3c65c11","source":{"kind":"arxiv","id":"2607.27623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27623","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27623v1","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27623","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"CYQKIKTOZFEE","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"pith_short_16","alias_value":"CYQKIKTOZFEE7T7Q","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"pith_short_8","alias_value":"CYQKIKTO","created_at":"2026-07-31T01:28:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CYQKIKTOZFEE7T7Q7KMFTNCT37","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"4ec45ea938ce63328c2866ff7e3d13194ff2d5e637d61f3678fb43a8a037b5f5","abstract_canon_sha256":"65d03707650d554d0a2a89f7332c7570acfa74376a9fe0ace6d3bca16d861b5f"},"schema_version":"1.0"},"canonical_sha256":"1620a42a6ec9484fcff0fa9859b453dfcffebfd75c8bc32fa5309ca6c3c65c11","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1620a42a6ec9484fcff0fa9859b453dfcffebfd75c8bc32fa5309ca6c3c65c11","last_reissued_at":"2026-07-31T01:28:18.018205Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:28:18.018205Z"},"source_kind":"arxiv","source_id":"2607.27623","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:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rld/lrAdW6se/MyETzBiyFjj9faJ0dXjCSwmp/tqNBbynR5WR0Bh1AU0ASIbprgBDdipugU8lxFKElqb1OrmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:06:23.933494Z"},"content_sha256":"11e18d207804b1357f2261524f96a122704cea61756644d9f1a6597f7a017cbc","schema_version":"1.0","event_id":"sha256:11e18d207804b1357f2261524f96a122704cea61756644d9f1a6597f7a017cbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CYQKIKTOZFEE7T7Q7KMFTNCT37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Kai Uwe Barthel, Klaus Jung, Konstantin Schall, Nico Hezel","submitted_at":"2026-07-30T03:22:17Z","abstract_excerpt":"As datasets and the dimensionality of feature vectors continue to grow, Approximate Nearest Neighbor Search (ANNS) in large multimedia databases becomes increasingly relevant. Graph-based approaches have demonstrated to offer the best trade-off between retrieval precision and search time. Despite their ability to deliver search times several orders of magnitude faster than exact search techniques, existing methods suffer from slow constructions speeds or high memory requirements. This paper presents a \"continuous refining Exploration Graph\" (crEG), a novel approach for rapidly constructing a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27623","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.27623/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:28:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LfpqJjOMxACtkUSq76hdbANUQKJosgd6IGJ3feJ+wf4kCbmd0Z6ojU6KmQGijZL1RA6wLHxQ9FYzLFyIS/mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:06:23.934093Z"},"content_sha256":"cfd434688b17ea701bec229b54745466547dae35005ec2613ff552f456a249c6","schema_version":"1.0","event_id":"sha256:cfd434688b17ea701bec229b54745466547dae35005ec2613ff552f456a249c6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:CYQKIKTOZFEE7T7Q7KMFTNCT37","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/CVPR.2016.226) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Artem Babenko Yandex and Victor Lempitsky. 2016. Efficient Indexing of Billion- Scale Datasets of Deep Descriptors. In2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). 2055–2063. https://doi.org/10.1109/CVPR.2016. 226","arxiv_id":"2607.27623","detector":"doi_compliance","evidence":{"ref_index":41,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/cvpr.2016","reconstructed_doi":"10.1109/CVPR.2016.226"},"severity":"advisory","ref_index":41,"audited_at":"2026-08-01T04:38:22.420562Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/CVPR.2016.226","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d8ae22c25646e93aa57d75bb56e1c45a23328c92137bc1cd7f226affea8555d8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15089,"payload_sha256":"f4303ea534d13fb814018662633318110cfcff3347242413574af4a0fe6ba2b2","signature_b64":"d5y0rIbVehBcxrm5bSUiV8p0I0orkpyKKveANw1AOycFqv9fJYYDKalmj0AAvImwg3jmtYXyw77TldCr/aeMBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T04:38:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzmMT+BgyjfZdT8ZVnhSC8h9qgZOiNy0boSiNgiTLRnBEp5BEOgXqBkVpGTajY/jMrBZXQOLw2jjhZByuIdvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:06:23.938873Z"},"content_sha256":"a4fad36f7d339db924b61b74cb3a3e80a2e0fc260c882d5526479e0542945cf7","schema_version":"1.0","event_id":"sha256:a4fad36f7d339db924b61b74cb3a3e80a2e0fc260c882d5526479e0542945cf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/bundle.json","state_url":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/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-10T14:06:23Z","links":{"resolver":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37","bundle":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/bundle.json","state":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CYQKIKTOZFEE7T7Q7KMFTNCT37","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"65d03707650d554d0a2a89f7332c7570acfa74376a9fe0ace6d3bca16d861b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:22:17Z","title_canon_sha256":"4ec45ea938ce63328c2866ff7e3d13194ff2d5e637d61f3678fb43a8a037b5f5"},"schema_version":"1.0","source":{"id":"2607.27623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27623","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27623v1","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27623","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"pith_short_12","alias_value":"CYQKIKTOZFEE","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"pith_short_16","alias_value":"CYQKIKTOZFEE7T7Q","created_at":"2026-07-31T01:28:18Z"},{"alias_kind":"pith_short_8","alias_value":"CYQKIKTO","created_at":"2026-07-31T01:28:18Z"}],"graph_snapshots":[{"event_id":"sha256:cfd434688b17ea701bec229b54745466547dae35005ec2613ff552f456a249c6","target":"graph","created_at":"2026-07-31T01:28:18Z","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.27623/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As datasets and the dimensionality of feature vectors continue to grow, Approximate Nearest Neighbor Search (ANNS) in large multimedia databases becomes increasingly relevant. Graph-based approaches have demonstrated to offer the best trade-off between retrieval precision and search time. Despite their ability to deliver search times several orders of magnitude faster than exact search techniques, existing methods suffer from slow constructions speeds or high memory requirements. This paper presents a \"continuous refining Exploration Graph\" (crEG), a novel approach for rapidly constructing a c","authors_text":"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:22:17Z","title":"An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27623","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:11e18d207804b1357f2261524f96a122704cea61756644d9f1a6597f7a017cbc","target":"record","created_at":"2026-07-31T01:28:18Z","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":"65d03707650d554d0a2a89f7332c7570acfa74376a9fe0ace6d3bca16d861b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2026-07-30T03:22:17Z","title_canon_sha256":"4ec45ea938ce63328c2866ff7e3d13194ff2d5e637d61f3678fb43a8a037b5f5"},"schema_version":"1.0","source":{"id":"2607.27623","kind":"arxiv","version":1}},"canonical_sha256":"1620a42a6ec9484fcff0fa9859b453dfcffebfd75c8bc32fa5309ca6c3c65c11","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1620a42a6ec9484fcff0fa9859b453dfcffebfd75c8bc32fa5309ca6c3c65c11","first_computed_at":"2026-07-31T01:28:18.018205Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:28:18.018205Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11e18d207804b1357f2261524f96a122704cea61756644d9f1a6597f7a017cbc","sha256:cfd434688b17ea701bec229b54745466547dae35005ec2613ff552f456a249c6","sha256:a4fad36f7d339db924b61b74cb3a3e80a2e0fc260c882d5526479e0542945cf7"],"state_sha256":"fc63c3a2a06a9d15ff322c58f75ebf9385f862086d06fe849216ef2d081de39b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dk+FbDLNHeAS78kUqRrw+8FtcIjHlTOzK40HbRGPLIPga36Nz5THWgMXHLddMLZjV7xwpPXBxurDrABzG8VPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:06:23.943050Z","bundle_sha256":"8e5ee553224bb2b66513143b4f234c4a319e6f809fefea8d0c2b3fbd8f00e296"}}