{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KXDHIMH6N5AFA6ZOKHNU7BDMRX","short_pith_number":"pith:KXDHIMH6","schema_version":"1.0","canonical_sha256":"55c67430fe6f40507b2e51db4f846c8dc154bf197369d508c389dfe9cc0462a6","source":{"kind":"arxiv","id":"2606.30265","version":1},"attestation_state":"computed","paper":{"title":"When Is a Draft Accepted? A Theory of Acceptance in Speculative Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaryam Sharma","submitted_at":"2026-06-29T13:14:51Z","abstract_excerpt":"Speculative decoding accelerates language model inference by using a fast drafter to propose candidate tokens that are then verified by a larger target model. Existing theory largely studies the stochastic, distribution-preserving setting, where the goal is to exactly sample from the target distribution. In contrast, many practical systems use greedy decoding, relaxed acceptance rules, or tree-based candidate sets, where success is governed by local ranking and threshold events rather than exact distributional equality. We develop a theory for these regimes. We identify that many common accept"},"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":"2606.30265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-29T13:14:51Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"ccdf9d2dcb114c708afe0dd290a21d64265a789dc4ac14d8eee5645adca2c0bf","abstract_canon_sha256":"d02d590bfbd4b1f888c78b36b02d32c6264aa165dba0f3941bc626462b14a61e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:56.698856Z","signature_b64":"3EauX8w7eEm7Evdxny4QRpMakvh10j80QBFaVnHtsJRjJRSoJqnz9Ryajp2KHoRkwdzsCeoCuW7MykVYCjpNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c67430fe6f40507b2e51db4f846c8dc154bf197369d508c389dfe9cc0462a6","last_reissued_at":"2026-06-30T02:17:56.698184Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:56.698184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Is a Draft Accepted? A Theory of Acceptance in Speculative Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaryam Sharma","submitted_at":"2026-06-29T13:14:51Z","abstract_excerpt":"Speculative decoding accelerates language model inference by using a fast drafter to propose candidate tokens that are then verified by a larger target model. Existing theory largely studies the stochastic, distribution-preserving setting, where the goal is to exactly sample from the target distribution. In contrast, many practical systems use greedy decoding, relaxed acceptance rules, or tree-based candidate sets, where success is governed by local ranking and threshold events rather than exact distributional equality. We develop a theory for these regimes. We identify that many common accept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30265","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/2606.30265/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":"2606.30265","created_at":"2026-06-30T02:17:56.698282+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30265v1","created_at":"2026-06-30T02:17:56.698282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30265","created_at":"2026-06-30T02:17:56.698282+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXDHIMH6N5AF","created_at":"2026-06-30T02:17:56.698282+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXDHIMH6N5AFA6ZO","created_at":"2026-06-30T02:17:56.698282+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXDHIMH6","created_at":"2026-06-30T02:17:56.698282+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/KXDHIMH6N5AFA6ZOKHNU7BDMRX","json":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX.json","graph_json":"https://pith.science/api/pith-number/KXDHIMH6N5AFA6ZOKHNU7BDMRX/graph.json","events_json":"https://pith.science/api/pith-number/KXDHIMH6N5AFA6ZOKHNU7BDMRX/events.json","paper":"https://pith.science/paper/KXDHIMH6"},"agent_actions":{"view_html":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX","download_json":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX.json","view_paper":"https://pith.science/paper/KXDHIMH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30265&json=true","fetch_graph":"https://pith.science/api/pith-number/KXDHIMH6N5AFA6ZOKHNU7BDMRX/graph.json","fetch_events":"https://pith.science/api/pith-number/KXDHIMH6N5AFA6ZOKHNU7BDMRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX/action/storage_attestation","attest_author":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX/action/author_attestation","sign_citation":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX/action/citation_signature","submit_replication":"https://pith.science/pith/KXDHIMH6N5AFA6ZOKHNU7BDMRX/action/replication_record"}},"created_at":"2026-06-30T02:17:56.698282+00:00","updated_at":"2026-06-30T02:17:56.698282+00:00"}