{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XMY2VYH2NKXYWZIADECSSPTVHA","short_pith_number":"pith:XMY2VYH2","schema_version":"1.0","canonical_sha256":"bb31aae0fa6aaf8b65001905293e7538079993c13afe9ed47c31ca623d04d8c5","source":{"kind":"arxiv","id":"2603.16360","version":2},"attestation_state":"computed","paper":{"title":"Fast Approximate Vector Joins via Offline-Online Co-Design","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anastasia Ailamaki, Kyoungmin Kim, Lennart Roth, Liang Liang","submitted_at":"2026-03-17T10:47:35Z","abstract_excerpt":"Vector joins - finding all vector pairs between a set of query and data vectors whose distances are below a given threshold - are fundamental to modern vector and vector-relational database systems that power multimodal retrieval and semantic analytics. Existing state-of-the-art approach exploits work sharing among similar queries but still suffers from redundant index traversals and excessive distance computations. We propose a unified framework for efficient approximate vector joins that (1) introduces soft work sharing to reuse traversal results beyond the join results of previous queries, "},"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":"2603.16360","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2026-03-17T10:47:35Z","cross_cats_sorted":[],"title_canon_sha256":"e38714a0c0375f3e3b550311a54dcc1916e4515f779eb8c3e0da8041f8951df9","abstract_canon_sha256":"a745db1f80a4290b28c332c0f673ce1c21ec48bed64e8cc8b5df565facfe021c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T00:23:08.682879Z","signature_b64":"8NziQA+PbFJBqAxZS5tK6CJrobQ52EHkNiMpMX30zqHUPv225gDeXjYbaQftrt1LTaNEpXzpe5EPM+ZU0uR/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb31aae0fa6aaf8b65001905293e7538079993c13afe9ed47c31ca623d04d8c5","last_reissued_at":"2026-07-24T00:23:08.681892Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T00:23:08.681892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximate Vector Joins via Offline-Online Co-Design","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anastasia Ailamaki, Kyoungmin Kim, Lennart Roth, Liang Liang","submitted_at":"2026-03-17T10:47:35Z","abstract_excerpt":"Vector joins - finding all vector pairs between a set of query and data vectors whose distances are below a given threshold - are fundamental to modern vector and vector-relational database systems that power multimodal retrieval and semantic analytics. Existing state-of-the-art approach exploits work sharing among similar queries but still suffers from redundant index traversals and excessive distance computations. We propose a unified framework for efficient approximate vector joins that (1) introduces soft work sharing to reuse traversal results beyond the join results of previous queries, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.16360","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/2603.16360/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":"2603.16360","created_at":"2026-07-24T00:23:08.682370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.16360v2","created_at":"2026-07-24T00:23:08.682370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.16360","created_at":"2026-07-24T00:23:08.682370+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMY2VYH2NKXY","created_at":"2026-07-24T00:23:08.682370+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMY2VYH2NKXYWZIA","created_at":"2026-07-24T00:23:08.682370+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMY2VYH2","created_at":"2026-07-24T00:23:08.682370+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/XMY2VYH2NKXYWZIADECSSPTVHA","json":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA.json","graph_json":"https://pith.science/api/pith-number/XMY2VYH2NKXYWZIADECSSPTVHA/graph.json","events_json":"https://pith.science/api/pith-number/XMY2VYH2NKXYWZIADECSSPTVHA/events.json","paper":"https://pith.science/paper/XMY2VYH2"},"agent_actions":{"view_html":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA","download_json":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA.json","view_paper":"https://pith.science/paper/XMY2VYH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.16360&json=true","fetch_graph":"https://pith.science/api/pith-number/XMY2VYH2NKXYWZIADECSSPTVHA/graph.json","fetch_events":"https://pith.science/api/pith-number/XMY2VYH2NKXYWZIADECSSPTVHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/action/storage_attestation","attest_author":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/action/author_attestation","sign_citation":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/action/citation_signature","submit_replication":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/action/replication_record"}},"created_at":"2026-07-24T00:23:08.682370+00:00","updated_at":"2026-07-24T00:23:08.682370+00:00"}