{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MJMZRDQTSC5MLBCXSOOFISENVG","short_pith_number":"pith:MJMZRDQT","schema_version":"1.0","canonical_sha256":"6259988e1390bac58457939c54488da9b8e14daf7012270fb7b268d8547770ab","source":{"kind":"arxiv","id":"2410.18234","version":2},"attestation_state":"computed","paper":{"title":"Multi-Draft Speculative Sampling: Canonical Decomposition and Theoretical Limits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.CL","authors_text":"Arash Behboodi, Ashish Khisti, Christos Louizos, Hassan Dbouk, M.Reza Ebrahimi, Roland Memisevic","submitted_at":"2024-10-23T19:28:34Z","abstract_excerpt":"We consider multi-draft speculative sampling, where the proposal sequences are sampled independently from different draft models. At each step, a token-level draft selection scheme takes a list of valid tokens as input and produces an output token whose distribution matches that of the target model. Previous works have demonstrated that the optimal scheme (which maximizes the probability of accepting one of the input tokens) can be cast as a solution to a linear program. In this work we show that the optimal scheme can be decomposed into a two-step solution: in the first step an importance sam"},"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":"2410.18234","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-10-23T19:28:34Z","cross_cats_sorted":["cs.DC","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"c92c21b36b80c226e18bb48f65aad4128261c0e91acc5eb8e3ad8b5038d2f790","abstract_canon_sha256":"ab2a55cc4dd2c41d3ff4ab55d40ce0364bd10c904d573eec2850284ef654c6cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:25.533288Z","signature_b64":"AeYjJ3sklyT9mnHstBW6P7OyyRqBHzV5Kik4l4tqUJR8wZUSnXp1ignlGhEoKBBTnRlMH3PTqFL3PwMXo/LSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6259988e1390bac58457939c54488da9b8e14daf7012270fb7b268d8547770ab","last_reissued_at":"2026-07-05T11:00:25.532706Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:25.532706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Draft Speculative Sampling: Canonical Decomposition and Theoretical Limits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.CL","authors_text":"Arash Behboodi, Ashish Khisti, Christos Louizos, Hassan Dbouk, M.Reza Ebrahimi, Roland Memisevic","submitted_at":"2024-10-23T19:28:34Z","abstract_excerpt":"We consider multi-draft speculative sampling, where the proposal sequences are sampled independently from different draft models. At each step, a token-level draft selection scheme takes a list of valid tokens as input and produces an output token whose distribution matches that of the target model. Previous works have demonstrated that the optimal scheme (which maximizes the probability of accepting one of the input tokens) can be cast as a solution to a linear program. In this work we show that the optimal scheme can be decomposed into a two-step solution: in the first step an importance sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18234","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/2410.18234/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":"2410.18234","created_at":"2026-07-05T11:00:25.532776+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.18234v2","created_at":"2026-07-05T11:00:25.532776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18234","created_at":"2026-07-05T11:00:25.532776+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJMZRDQTSC5M","created_at":"2026-07-05T11:00:25.532776+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJMZRDQTSC5MLBCX","created_at":"2026-07-05T11:00:25.532776+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJMZRDQT","created_at":"2026-07-05T11:00:25.532776+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12807","citing_title":"Multi-Marginal Couplings for Metropolis-Hastings","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG","json":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG.json","graph_json":"https://pith.science/api/pith-number/MJMZRDQTSC5MLBCXSOOFISENVG/graph.json","events_json":"https://pith.science/api/pith-number/MJMZRDQTSC5MLBCXSOOFISENVG/events.json","paper":"https://pith.science/paper/MJMZRDQT"},"agent_actions":{"view_html":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG","download_json":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG.json","view_paper":"https://pith.science/paper/MJMZRDQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.18234&json=true","fetch_graph":"https://pith.science/api/pith-number/MJMZRDQTSC5MLBCXSOOFISENVG/graph.json","fetch_events":"https://pith.science/api/pith-number/MJMZRDQTSC5MLBCXSOOFISENVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG/action/storage_attestation","attest_author":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG/action/author_attestation","sign_citation":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG/action/citation_signature","submit_replication":"https://pith.science/pith/MJMZRDQTSC5MLBCXSOOFISENVG/action/replication_record"}},"created_at":"2026-07-05T11:00:25.532776+00:00","updated_at":"2026-07-05T11:00:25.532776+00:00"}