{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:STCNMKF73VK7HRMLDDRNEXKQYQ","short_pith_number":"pith:STCNMKF7","canonical_record":{"source":{"id":"2404.02805","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-04-03T15:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"c800f0e0eda73e6ebe09118a1a3665f491dea6e83459b5806c0638242a1710c9","abstract_canon_sha256":"9033820db880cb5183393cd474a25d0facc4f343aa360cbbb2bfc391601ad129"},"schema_version":"1.0"},"canonical_sha256":"94c4d628bfdd55f3c58b18e2d25d50c4205d0587e8c442b454469fcf725b508d","source":{"kind":"arxiv","id":"2404.02805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02805","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02805v1","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02805","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"STCNMKF73VK7","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"STCNMKF73VK7HRML","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"STCNMKF7","created_at":"2026-07-05T08:04:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:STCNMKF73VK7HRMLDDRNEXKQYQ","target":"record","payload":{"canonical_record":{"source":{"id":"2404.02805","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-04-03T15:20:24Z","cross_cats_sorted":[],"title_canon_sha256":"c800f0e0eda73e6ebe09118a1a3665f491dea6e83459b5806c0638242a1710c9","abstract_canon_sha256":"9033820db880cb5183393cd474a25d0facc4f343aa360cbbb2bfc391601ad129"},"schema_version":"1.0"},"canonical_sha256":"94c4d628bfdd55f3c58b18e2d25d50c4205d0587e8c442b454469fcf725b508d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:01.364070Z","signature_b64":"EC5L+yGtu82NqrZ5iFuIxUOtaIaL29Z8jUpI2tQ4RmotcJJhSXo7I2izF2GxhKl1iB4OPl5DWO0ZjMKsSP0ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94c4d628bfdd55f3c58b18e2d25d50c4205d0587e8c442b454469fcf725b508d","last_reissued_at":"2026-07-05T08:04:01.363670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:01.363670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.02805","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-05T08:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sinhC+IsDI1zvOiq8PboXC0lLWzUOca6cxUwFyI5+dMQxHTFtLHBiz5i+MI0OZYivEfyHVtim6TI8sOSu6XwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:14:34.592146Z"},"content_sha256":"e86471ea2b93d025c3ed2f0e0e1c2143ac67c3620c84059210c002d84a3d99f2","schema_version":"1.0","event_id":"sha256:e86471ea2b93d025c3ed2f0e0e1c2143ac67c3620c84059210c002d84a3d99f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:STCNMKF73VK7HRMLDDRNEXKQYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Multi-Vector Dense Retrieval Using Bit Vectors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Cosimo Rulli, Franco Maria Nardini, Rossano Venturini","submitted_at":"2024-04-03T15:20:24Z","abstract_excerpt":"Dense retrieval techniques employ pre-trained large language models to build a high-dimensional representation of queries and passages. These representations compute the relevance of a passage w.r.t. to a query using efficient similarity measures. In this line, multi-vector representations show improved effectiveness at the expense of a one-order-of-magnitude increase in memory footprint and query latency by encoding queries and documents on a per-token level. Recently, PLAID has tackled these problems by introducing a centroid-based term representation to reduce the memory impact of multi-vec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02805","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/2404.02805/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-05T08:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9uxfAISP4vDEfJihg/FIYawzqZQfanilsHOWOiSvxfvL8zshCSOlvC/2KttDsegr/+KoPU4j0imdXRI63eY3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:14:34.592666Z"},"content_sha256":"4f287d346a022871ad18c47ef3f2ab27e06468d2ca1ac4437ba89df93c7ff8ca","schema_version":"1.0","event_id":"sha256:4f287d346a022871ad18c47ef3f2ab27e06468d2ca1ac4437ba89df93c7ff8ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STCNMKF73VK7HRMLDDRNEXKQYQ/bundle.json","state_url":"https://pith.science/pith/STCNMKF73VK7HRMLDDRNEXKQYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STCNMKF73VK7HRMLDDRNEXKQYQ/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-11T08:14:34Z","links":{"resolver":"https://pith.science/pith/STCNMKF73VK7HRMLDDRNEXKQYQ","bundle":"https://pith.science/pith/STCNMKF73VK7HRMLDDRNEXKQYQ/bundle.json","state":"https://pith.science/pith/STCNMKF73VK7HRMLDDRNEXKQYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STCNMKF73VK7HRMLDDRNEXKQYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:STCNMKF73VK7HRMLDDRNEXKQYQ","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":"9033820db880cb5183393cd474a25d0facc4f343aa360cbbb2bfc391601ad129","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-04-03T15:20:24Z","title_canon_sha256":"c800f0e0eda73e6ebe09118a1a3665f491dea6e83459b5806c0638242a1710c9"},"schema_version":"1.0","source":{"id":"2404.02805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02805","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02805v1","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02805","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"STCNMKF73VK7","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"pith_short_16","alias_value":"STCNMKF73VK7HRML","created_at":"2026-07-05T08:04:01Z"},{"alias_kind":"pith_short_8","alias_value":"STCNMKF7","created_at":"2026-07-05T08:04:01Z"}],"graph_snapshots":[{"event_id":"sha256:4f287d346a022871ad18c47ef3f2ab27e06468d2ca1ac4437ba89df93c7ff8ca","target":"graph","created_at":"2026-07-05T08:04:01Z","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/2404.02805/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dense retrieval techniques employ pre-trained large language models to build a high-dimensional representation of queries and passages. These representations compute the relevance of a passage w.r.t. to a query using efficient similarity measures. In this line, multi-vector representations show improved effectiveness at the expense of a one-order-of-magnitude increase in memory footprint and query latency by encoding queries and documents on a per-token level. Recently, PLAID has tackled these problems by introducing a centroid-based term representation to reduce the memory impact of multi-vec","authors_text":"Cosimo Rulli, Franco Maria Nardini, Rossano Venturini","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-04-03T15:20:24Z","title":"Efficient Multi-Vector Dense Retrieval Using Bit Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02805","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:e86471ea2b93d025c3ed2f0e0e1c2143ac67c3620c84059210c002d84a3d99f2","target":"record","created_at":"2026-07-05T08:04:01Z","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":"9033820db880cb5183393cd474a25d0facc4f343aa360cbbb2bfc391601ad129","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-04-03T15:20:24Z","title_canon_sha256":"c800f0e0eda73e6ebe09118a1a3665f491dea6e83459b5806c0638242a1710c9"},"schema_version":"1.0","source":{"id":"2404.02805","kind":"arxiv","version":1}},"canonical_sha256":"94c4d628bfdd55f3c58b18e2d25d50c4205d0587e8c442b454469fcf725b508d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94c4d628bfdd55f3c58b18e2d25d50c4205d0587e8c442b454469fcf725b508d","first_computed_at":"2026-07-05T08:04:01.363670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:04:01.363670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EC5L+yGtu82NqrZ5iFuIxUOtaIaL29Z8jUpI2tQ4RmotcJJhSXo7I2izF2GxhKl1iB4OPl5DWO0ZjMKsSP0ZBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:04:01.364070Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.02805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e86471ea2b93d025c3ed2f0e0e1c2143ac67c3620c84059210c002d84a3d99f2","sha256:4f287d346a022871ad18c47ef3f2ab27e06468d2ca1ac4437ba89df93c7ff8ca"],"state_sha256":"36980871f511f7a97b2632daf7cf3882df9d6406bab62aa24bfe03456997ad8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMFEnkJ56RHxP2Ip+eYlcq59tchIWtfTcoqLRHHGfQjwj3pPim085FfWSYTGaLlY9uk2it6tot0rB//EZv6nCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:14:34.598422Z","bundle_sha256":"2c30c4f2633c5b5531b49c68acc9745049cec922f1db7b3c7d0ea4cefa16f366"}}