{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XMY2VYH2NKXYWZIADECSSPTVHA","short_pith_number":"pith:XMY2VYH2","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"},"canonical_sha256":"bb31aae0fa6aaf8b65001905293e7538079993c13afe9ed47c31ca623d04d8c5","source":{"kind":"arxiv","id":"2603.16360","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.16360","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"2603.16360v2","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.16360","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"XMY2VYH2NKXY","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"pith_short_16","alias_value":"XMY2VYH2NKXYWZIA","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"pith_short_8","alias_value":"XMY2VYH2","created_at":"2026-07-24T00:23:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XMY2VYH2NKXYWZIADECSSPTVHA","target":"record","payload":{"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"},"canonical_sha256":"bb31aae0fa6aaf8b65001905293e7538079993c13afe9ed47c31ca623d04d8c5","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"},"source_kind":"arxiv","source_id":"2603.16360","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-24T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2s5h1dfN4kp2O6gnXIokYNc9yLP4+IqDGrOOt8lSHUpEKwAfCZdWNG5KEhrx/9UpchPGNRbyxTtzQDUrdw3JBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:18:24.495170Z"},"content_sha256":"046de090b0c204ce9740316017324634a723846c6ad511ea433f1365de203125","schema_version":"1.0","event_id":"sha256:046de090b0c204ce9740316017324634a723846c6ad511ea433f1365de203125"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XMY2VYH2NKXYWZIADECSSPTVHA","target":"graph","payload":{"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"},"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-24T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xW4eGiQEPyoeHZCvBR/qZhF7LDkkAGbEGLYVUnddZVmghDSrfSql7lpbXSts/xNW5F171fW2UAz4qJ+j/HI4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:18:24.495794Z"},"content_sha256":"da28ede2114d6c7f014be20bf74b6f8aed6de67f6f1dc4df3bed0500951c3070","schema_version":"1.0","event_id":"sha256:da28ede2114d6c7f014be20bf74b6f8aed6de67f6f1dc4df3bed0500951c3070"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/bundle.json","state_url":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMY2VYH2NKXYWZIADECSSPTVHA/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-04T02:18:24Z","links":{"resolver":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA","bundle":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/bundle.json","state":"https://pith.science/pith/XMY2VYH2NKXYWZIADECSSPTVHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMY2VYH2NKXYWZIADECSSPTVHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XMY2VYH2NKXYWZIADECSSPTVHA","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":"a745db1f80a4290b28c332c0f673ce1c21ec48bed64e8cc8b5df565facfe021c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2026-03-17T10:47:35Z","title_canon_sha256":"e38714a0c0375f3e3b550311a54dcc1916e4515f779eb8c3e0da8041f8951df9"},"schema_version":"1.0","source":{"id":"2603.16360","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.16360","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"2603.16360v2","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.16360","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"XMY2VYH2NKXY","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"pith_short_16","alias_value":"XMY2VYH2NKXYWZIA","created_at":"2026-07-24T00:23:08Z"},{"alias_kind":"pith_short_8","alias_value":"XMY2VYH2","created_at":"2026-07-24T00:23:08Z"}],"graph_snapshots":[{"event_id":"sha256:da28ede2114d6c7f014be20bf74b6f8aed6de67f6f1dc4df3bed0500951c3070","target":"graph","created_at":"2026-07-24T00:23:08Z","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/2603.16360/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Anastasia Ailamaki, Kyoungmin Kim, Lennart Roth, Liang Liang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2026-03-17T10:47:35Z","title":"Fast Approximate Vector Joins via Offline-Online Co-Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.16360","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:046de090b0c204ce9740316017324634a723846c6ad511ea433f1365de203125","target":"record","created_at":"2026-07-24T00:23:08Z","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":"a745db1f80a4290b28c332c0f673ce1c21ec48bed64e8cc8b5df565facfe021c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2026-03-17T10:47:35Z","title_canon_sha256":"e38714a0c0375f3e3b550311a54dcc1916e4515f779eb8c3e0da8041f8951df9"},"schema_version":"1.0","source":{"id":"2603.16360","kind":"arxiv","version":2}},"canonical_sha256":"bb31aae0fa6aaf8b65001905293e7538079993c13afe9ed47c31ca623d04d8c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb31aae0fa6aaf8b65001905293e7538079993c13afe9ed47c31ca623d04d8c5","first_computed_at":"2026-07-24T00:23:08.681892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-24T00:23:08.681892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8NziQA+PbFJBqAxZS5tK6CJrobQ52EHkNiMpMX30zqHUPv225gDeXjYbaQftrt1LTaNEpXzpe5EPM+ZU0uR/Aw==","signature_status":"signed_v1","signed_at":"2026-07-24T00:23:08.682879Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.16360","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:046de090b0c204ce9740316017324634a723846c6ad511ea433f1365de203125","sha256:da28ede2114d6c7f014be20bf74b6f8aed6de67f6f1dc4df3bed0500951c3070"],"state_sha256":"1c8a897f2e16f3fb1d210336e8ebde7d6d0b8c888fcc4406b8409ac24d2bd925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tV8hJ6XXAwoFc2o2d0tuRt/u9HNguwCSZk9GJWBZ0iR0UGHWBtj7vWxr0HW1t0kfU38WRuzHBUnJ3Tg0JuzBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:18:24.501331Z","bundle_sha256":"d4811f429fd321f4a03fec47ce7095c24e2c124761c4275fa72bb6e093243afb"}}