{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CYQKIKTOZFEE7T7Q7KMFTNCT37","short_pith_number":"pith:CYQKIKTO","schema_version":"1.0","canonical_sha256":"1620a42a6ec9484fcff0fa9859b453dfcffebfd75c8bc32fa5309ca6c3c65c11","source":{"kind":"arxiv","id":"2607.27623","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.27623","created_at":"2026-07-31T01:28:18.024746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27623v1","created_at":"2026-07-31T01:28:18.024746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27623","created_at":"2026-07-31T01:28:18.024746+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYQKIKTOZFEE","created_at":"2026-07-31T01:28:18.024746+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYQKIKTOZFEE7T7Q","created_at":"2026-07-31T01:28:18.024746+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYQKIKTO","created_at":"2026-07-31T01:28:18.024746+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37","json":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37.json","graph_json":"https://pith.science/api/pith-number/CYQKIKTOZFEE7T7Q7KMFTNCT37/graph.json","events_json":"https://pith.science/api/pith-number/CYQKIKTOZFEE7T7Q7KMFTNCT37/events.json","paper":"https://pith.science/paper/CYQKIKTO"},"agent_actions":{"view_html":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37","download_json":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37.json","view_paper":"https://pith.science/paper/CYQKIKTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27623&json=true","fetch_graph":"https://pith.science/api/pith-number/CYQKIKTOZFEE7T7Q7KMFTNCT37/graph.json","fetch_events":"https://pith.science/api/pith-number/CYQKIKTOZFEE7T7Q7KMFTNCT37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/action/storage_attestation","attest_author":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/action/author_attestation","sign_citation":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/action/citation_signature","submit_replication":"https://pith.science/pith/CYQKIKTOZFEE7T7Q7KMFTNCT37/action/replication_record"}},"created_at":"2026-07-31T01:28:18.024746+00:00","updated_at":"2026-07-31T01:28:18.024746+00:00"}