{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2V6EMOIAB5LNNUO5AUYEFE7RPU","short_pith_number":"pith:2V6EMOIA","canonical_record":{"source":{"id":"2411.17229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-11-26T08:51:46Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"2656ca22d35bca2549982a91067a70bab88b2c34340dabeb47a2281e284ce344","abstract_canon_sha256":"7ca34182a24bc87e845dedd789efdf804a5fa0181980db1595a4bc2d98e41d8d"},"schema_version":"1.0"},"canonical_sha256":"d57c4639000f56d6d1dd05304293f17d35fcbb496700d01057906b86cd4ab637","source":{"kind":"arxiv","id":"2411.17229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17229","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17229v2","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17229","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"2V6EMOIAB5LN","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"pith_short_16","alias_value":"2V6EMOIAB5LNNUO5","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"pith_short_8","alias_value":"2V6EMOIA","created_at":"2026-07-05T09:42:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2V6EMOIAB5LNNUO5AUYEFE7RPU","target":"record","payload":{"canonical_record":{"source":{"id":"2411.17229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-11-26T08:51:46Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"2656ca22d35bca2549982a91067a70bab88b2c34340dabeb47a2281e284ce344","abstract_canon_sha256":"7ca34182a24bc87e845dedd789efdf804a5fa0181980db1595a4bc2d98e41d8d"},"schema_version":"1.0"},"canonical_sha256":"d57c4639000f56d6d1dd05304293f17d35fcbb496700d01057906b86cd4ab637","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:33.637339Z","signature_b64":"sTAg+UVT0AmUapsGwQ2c52u+PlnqFl3aeGvayztMEBMQF4qtYHcllkslePxyt0gv5DVzx7kph64wuuhLCqUWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d57c4639000f56d6d1dd05304293f17d35fcbb496700d01057906b86cd4ab637","last_reissued_at":"2026-07-05T09:42:33.636811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:33.636811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.17229","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-05T09:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmulSLJy8iLDNuEVzkl9VLBu2mbvOBAYZuY/bYwC9Y1GEoKBZ+bwDxWg/PUe0azxBHDPS0E3ROoW7Le1bAJkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:21:48.213704Z"},"content_sha256":"241096975d1cd57c3fadc2c28eead09b69cf23ac13c449ca0ddf29bdb8a6a276","schema_version":"1.0","event_id":"sha256:241096975d1cd57c3fadc2c28eead09b69cf23ac13c449ca0ddf29bdb8a6a276"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2V6EMOIAB5LNNUO5AUYEFE7RPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Kai Zheng, Liwei Deng, Penghao Chen, Tianfu Wang, Ximu Zeng, Yan Zhao","submitted_at":"2024-11-26T08:51:46Z","abstract_excerpt":"High-dimensional approximate $K$ nearest neighbor search (AKNN) is a fundamental task for various applications, including information retrieval. Most existing algorithms for AKNN can be decomposed into two main components, i.e., candidate generation and distance comparison operations (DCOs). While different methods have unique ways of generating candidates, they all share the same DCO process. In this study, we focus on accelerating the process of DCOs that dominates the time cost in most existing AKNN algorithms. To achieve this, we propose an Data-Aware Distance Estimation approach, called D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17229","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/2411.17229/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-05T09:42:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16XJuSyfc7E5E+cfNc1dzJAU2+jyhGLJSp5mEouiX20BVVw3707lCSl/65/tOQj+iqnbn/IQyoLfQKP9OARqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T16:21:48.214282Z"},"content_sha256":"64969ff3407159e8fc9e9c8565aa0f4170c7b825997fcc3bd8f6852e7a43109e","schema_version":"1.0","event_id":"sha256:64969ff3407159e8fc9e9c8565aa0f4170c7b825997fcc3bd8f6852e7a43109e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2V6EMOIAB5LNNUO5AUYEFE7RPU/bundle.json","state_url":"https://pith.science/pith/2V6EMOIAB5LNNUO5AUYEFE7RPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2V6EMOIAB5LNNUO5AUYEFE7RPU/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-20T16:21:48Z","links":{"resolver":"https://pith.science/pith/2V6EMOIAB5LNNUO5AUYEFE7RPU","bundle":"https://pith.science/pith/2V6EMOIAB5LNNUO5AUYEFE7RPU/bundle.json","state":"https://pith.science/pith/2V6EMOIAB5LNNUO5AUYEFE7RPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2V6EMOIAB5LNNUO5AUYEFE7RPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2V6EMOIAB5LNNUO5AUYEFE7RPU","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":"7ca34182a24bc87e845dedd789efdf804a5fa0181980db1595a4bc2d98e41d8d","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-11-26T08:51:46Z","title_canon_sha256":"2656ca22d35bca2549982a91067a70bab88b2c34340dabeb47a2281e284ce344"},"schema_version":"1.0","source":{"id":"2411.17229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.17229","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"arxiv_version","alias_value":"2411.17229v2","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17229","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"pith_short_12","alias_value":"2V6EMOIAB5LN","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"pith_short_16","alias_value":"2V6EMOIAB5LNNUO5","created_at":"2026-07-05T09:42:33Z"},{"alias_kind":"pith_short_8","alias_value":"2V6EMOIA","created_at":"2026-07-05T09:42:33Z"}],"graph_snapshots":[{"event_id":"sha256:64969ff3407159e8fc9e9c8565aa0f4170c7b825997fcc3bd8f6852e7a43109e","target":"graph","created_at":"2026-07-05T09:42:33Z","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/2411.17229/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"High-dimensional approximate $K$ nearest neighbor search (AKNN) is a fundamental task for various applications, including information retrieval. Most existing algorithms for AKNN can be decomposed into two main components, i.e., candidate generation and distance comparison operations (DCOs). While different methods have unique ways of generating candidates, they all share the same DCO process. In this study, we focus on accelerating the process of DCOs that dominates the time cost in most existing AKNN algorithms. To achieve this, we propose an Data-Aware Distance Estimation approach, called D","authors_text":"Kai Zheng, Liwei Deng, Penghao Chen, Tianfu Wang, Ximu Zeng, Yan Zhao","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-11-26T08:51:46Z","title":"Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17229","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:241096975d1cd57c3fadc2c28eead09b69cf23ac13c449ca0ddf29bdb8a6a276","target":"record","created_at":"2026-07-05T09:42:33Z","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":"7ca34182a24bc87e845dedd789efdf804a5fa0181980db1595a4bc2d98e41d8d","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-11-26T08:51:46Z","title_canon_sha256":"2656ca22d35bca2549982a91067a70bab88b2c34340dabeb47a2281e284ce344"},"schema_version":"1.0","source":{"id":"2411.17229","kind":"arxiv","version":2}},"canonical_sha256":"d57c4639000f56d6d1dd05304293f17d35fcbb496700d01057906b86cd4ab637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d57c4639000f56d6d1dd05304293f17d35fcbb496700d01057906b86cd4ab637","first_computed_at":"2026-07-05T09:42:33.636811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:33.636811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sTAg+UVT0AmUapsGwQ2c52u+PlnqFl3aeGvayztMEBMQF4qtYHcllkslePxyt0gv5DVzx7kph64wuuhLCqUWDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:33.637339Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.17229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:241096975d1cd57c3fadc2c28eead09b69cf23ac13c449ca0ddf29bdb8a6a276","sha256:64969ff3407159e8fc9e9c8565aa0f4170c7b825997fcc3bd8f6852e7a43109e"],"state_sha256":"62145dd38749cd16cd44d0b4ea94f601887357e21a0c838f3c700e144f4ab7b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYdkbTL+Y1VW6DY9U1oCnK0wMAyfn3vg8tmnXMmWm1sCuR4XmcHgbF9f4LjBN2B3nfZKWY6+MHPl1iZgCDi6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T16:21:48.219562Z","bundle_sha256":"5041465fe6b624a4713e83d2bf926b554566f4961f881dbc7477b3b3ae3686ab"}}