{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BVTLYJREDMP2P7VUW224AGAPLG","short_pith_number":"pith:BVTLYJRE","schema_version":"1.0","canonical_sha256":"0d66bc26241b1fa7feb4b6b5c0180f59806f71f5e2b0aac8a7d8c7d572b871c0","source":{"kind":"arxiv","id":"2404.14989","version":1},"attestation_state":"computed","paper":{"title":"A Reproducibility Study of PLAID","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Nicola Tonellotto, Sean MacAvaney","submitted_at":"2024-04-23T12:46:53Z","abstract_excerpt":"The PLAID (Performance-optimized Late Interaction Driver) algorithm for ColBERTv2 uses clustered term representations to retrieve and progressively prune documents for final (exact) document scoring. In this paper, we reproduce and fill in missing gaps from the original work. By studying the parameters PLAID introduces, we find that its Pareto frontier is formed of a careful balance among its three parameters; deviations beyond the suggested settings can substantially increase latency without necessarily improving its effectiveness. We then compare PLAID with an important baseline missing from"},"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":"2404.14989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-04-23T12:46:53Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"89b47a276aaabf6a535d7912b17bb86e328867d0ca8de4871cac21d3d22ccb9f","abstract_canon_sha256":"eb2bd82c921409d68e450f9d1e6e5bad8b67777dd13d17e9236bc4b95e5907cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:13.518839Z","signature_b64":"4F61A3YwqH/WcJNHltyRfYtrqrtKrFwmZaJc6srOgtk4Ty1gJE8Fgd1kwyCySlfkNX9/TUZrm4XceZ+aS8kKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d66bc26241b1fa7feb4b6b5c0180f59806f71f5e2b0aac8a7d8c7d572b871c0","last_reissued_at":"2026-07-05T08:11:13.518499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:13.518499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reproducibility Study of PLAID","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Nicola Tonellotto, Sean MacAvaney","submitted_at":"2024-04-23T12:46:53Z","abstract_excerpt":"The PLAID (Performance-optimized Late Interaction Driver) algorithm for ColBERTv2 uses clustered term representations to retrieve and progressively prune documents for final (exact) document scoring. In this paper, we reproduce and fill in missing gaps from the original work. By studying the parameters PLAID introduces, we find that its Pareto frontier is formed of a careful balance among its three parameters; deviations beyond the suggested settings can substantially increase latency without necessarily improving its effectiveness. We then compare PLAID with an important baseline missing from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14989","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.14989/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":"2404.14989","created_at":"2026-07-05T08:11:13.518553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14989v1","created_at":"2026-07-05T08:11:13.518553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14989","created_at":"2026-07-05T08:11:13.518553+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVTLYJREDMP2","created_at":"2026-07-05T08:11:13.518553+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVTLYJREDMP2P7VU","created_at":"2026-07-05T08:11:13.518553+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVTLYJRE","created_at":"2026-07-05T08:11:13.518553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.17788","citing_title":"WARP: An Efficient Engine for Multi-Vector Retrieval","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG","json":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG.json","graph_json":"https://pith.science/api/pith-number/BVTLYJREDMP2P7VUW224AGAPLG/graph.json","events_json":"https://pith.science/api/pith-number/BVTLYJREDMP2P7VUW224AGAPLG/events.json","paper":"https://pith.science/paper/BVTLYJRE"},"agent_actions":{"view_html":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG","download_json":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG.json","view_paper":"https://pith.science/paper/BVTLYJRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14989&json=true","fetch_graph":"https://pith.science/api/pith-number/BVTLYJREDMP2P7VUW224AGAPLG/graph.json","fetch_events":"https://pith.science/api/pith-number/BVTLYJREDMP2P7VUW224AGAPLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG/action/storage_attestation","attest_author":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG/action/author_attestation","sign_citation":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG/action/citation_signature","submit_replication":"https://pith.science/pith/BVTLYJREDMP2P7VUW224AGAPLG/action/replication_record"}},"created_at":"2026-07-05T08:11:13.518553+00:00","updated_at":"2026-07-05T08:11:13.518553+00:00"}