{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MQOBFQ2CSYD4PGAS44XHE5DKTZ","short_pith_number":"pith:MQOBFQ2C","canonical_record":{"source":{"id":"2606.01813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-01T07:29:56Z","cross_cats_sorted":[],"title_canon_sha256":"9863350c64d750f679d002776f6e026df01ab9ee1ddc98b20ed20a79b16d9afa","abstract_canon_sha256":"ec507194c483218a3ecd23542ff0518ba718b91e44cdaff472d90789ece8d334"},"schema_version":"1.0"},"canonical_sha256":"641c12c3429607c79812e72e72746a9e6202e5aa1b37655ddf0b5337d0499ec9","source":{"kind":"arxiv","id":"2606.01813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01813","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01813v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01813","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"MQOBFQ2CSYD4","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"MQOBFQ2CSYD4PGAS","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"MQOBFQ2C","created_at":"2026-06-02T02:04:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MQOBFQ2CSYD4PGAS44XHE5DKTZ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.01813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-01T07:29:56Z","cross_cats_sorted":[],"title_canon_sha256":"9863350c64d750f679d002776f6e026df01ab9ee1ddc98b20ed20a79b16d9afa","abstract_canon_sha256":"ec507194c483218a3ecd23542ff0518ba718b91e44cdaff472d90789ece8d334"},"schema_version":"1.0"},"canonical_sha256":"641c12c3429607c79812e72e72746a9e6202e5aa1b37655ddf0b5337d0499ec9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:57.566592Z","signature_b64":"lTeyHpSLiSex2rcIXN+elWIf9znvLiS8m29RCPgCygr3nmbruP2O/L1tllYipDxDumOm/6R0bNt5+umhW+w3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"641c12c3429607c79812e72e72746a9e6202e5aa1b37655ddf0b5337d0499ec9","last_reissued_at":"2026-06-02T02:04:57.566224Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:57.566224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.01813","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-06-02T02:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FnlmV2X3KYeWzwZdt5eib8KftAp2d9fgyQG0SQBDeO/zgqTx2rlQva6KZm5hny07qrjniM9p6rAACteY7vEeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:02:17.242102Z"},"content_sha256":"bcfbb13edfceb0d4ba1651a3781de892357f2ae4299274cb608cfc85ee1c82ea","schema_version":"1.0","event_id":"sha256:bcfbb13edfceb0d4ba1651a3781de892357f2ae4299274cb608cfc85ee1c82ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MQOBFQ2CSYD4PGAS44XHE5DKTZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-Aware Diffusion Draft Trees for Speculative Decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hongliang He, Huachuan Qiu, Shuai Zhang, Yong Dai","submitted_at":"2026-06-01T07:29:56Z","abstract_excerpt":"Speculative decoding accelerates inference by having a lightweight drafter propose tokens verified in parallel by the target language model. Block diffusion drafters such as DFlash generate an entire draft block in one pass, yielding per-position marginals; DDTree uses these to build a candidate tree that maximizes expected acceptance length under a fixed node budget. We observe, however, that acceptance length is non-decreasing in budget: it always favors larger trees regardless of verification cost, offering no principled basis for budget selection. We introduce \\textbf{CaDDTree} (Cost-aware"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01813","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.01813/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-06-02T02:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbiohYJHro8nrlQ0vg9/Mb81gaxmjnyIzIy6ulJN5Qf3NprbshoOINqvPkjWGkksfieUhkxA50QKsIuyF3uPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:02:17.242500Z"},"content_sha256":"d7f50fd0c3aab089f99b557c1aecfcde41da0a3e2e838ae6ddbeee86a70d363f","schema_version":"1.0","event_id":"sha256:d7f50fd0c3aab089f99b557c1aecfcde41da0a3e2e838ae6ddbeee86a70d363f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQOBFQ2CSYD4PGAS44XHE5DKTZ/bundle.json","state_url":"https://pith.science/pith/MQOBFQ2CSYD4PGAS44XHE5DKTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQOBFQ2CSYD4PGAS44XHE5DKTZ/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-06-02T21:02:17Z","links":{"resolver":"https://pith.science/pith/MQOBFQ2CSYD4PGAS44XHE5DKTZ","bundle":"https://pith.science/pith/MQOBFQ2CSYD4PGAS44XHE5DKTZ/bundle.json","state":"https://pith.science/pith/MQOBFQ2CSYD4PGAS44XHE5DKTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQOBFQ2CSYD4PGAS44XHE5DKTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MQOBFQ2CSYD4PGAS44XHE5DKTZ","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":"ec507194c483218a3ecd23542ff0518ba718b91e44cdaff472d90789ece8d334","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-01T07:29:56Z","title_canon_sha256":"9863350c64d750f679d002776f6e026df01ab9ee1ddc98b20ed20a79b16d9afa"},"schema_version":"1.0","source":{"id":"2606.01813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01813","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01813v1","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01813","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"MQOBFQ2CSYD4","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"MQOBFQ2CSYD4PGAS","created_at":"2026-06-02T02:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"MQOBFQ2C","created_at":"2026-06-02T02:04:57Z"}],"graph_snapshots":[{"event_id":"sha256:d7f50fd0c3aab089f99b557c1aecfcde41da0a3e2e838ae6ddbeee86a70d363f","target":"graph","created_at":"2026-06-02T02:04:57Z","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/2606.01813/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Speculative decoding accelerates inference by having a lightweight drafter propose tokens verified in parallel by the target language model. Block diffusion drafters such as DFlash generate an entire draft block in one pass, yielding per-position marginals; DDTree uses these to build a candidate tree that maximizes expected acceptance length under a fixed node budget. We observe, however, that acceptance length is non-decreasing in budget: it always favors larger trees regardless of verification cost, offering no principled basis for budget selection. We introduce \\textbf{CaDDTree} (Cost-aware","authors_text":"Hongliang He, Huachuan Qiu, Shuai Zhang, Yong Dai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-01T07:29:56Z","title":"Cost-Aware Diffusion Draft Trees for Speculative Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01813","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:bcfbb13edfceb0d4ba1651a3781de892357f2ae4299274cb608cfc85ee1c82ea","target":"record","created_at":"2026-06-02T02:04:57Z","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":"ec507194c483218a3ecd23542ff0518ba718b91e44cdaff472d90789ece8d334","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-06-01T07:29:56Z","title_canon_sha256":"9863350c64d750f679d002776f6e026df01ab9ee1ddc98b20ed20a79b16d9afa"},"schema_version":"1.0","source":{"id":"2606.01813","kind":"arxiv","version":1}},"canonical_sha256":"641c12c3429607c79812e72e72746a9e6202e5aa1b37655ddf0b5337d0499ec9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"641c12c3429607c79812e72e72746a9e6202e5aa1b37655ddf0b5337d0499ec9","first_computed_at":"2026-06-02T02:04:57.566224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:57.566224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lTeyHpSLiSex2rcIXN+elWIf9znvLiS8m29RCPgCygr3nmbruP2O/L1tllYipDxDumOm/6R0bNt5+umhW+w3Dw==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:57.566592Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcfbb13edfceb0d4ba1651a3781de892357f2ae4299274cb608cfc85ee1c82ea","sha256:d7f50fd0c3aab089f99b557c1aecfcde41da0a3e2e838ae6ddbeee86a70d363f"],"state_sha256":"c3de108c4a9de79e3816bf8713ddeda1fff4d787b0d81ba849b55fbca2e0bb62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VQELyHLvG6Bprz8k+CLCIOfj/7DmFi2u7gL9elIiam+6Kbr2+cg4RXUix9fMaJdMk1C7Q0aYqU6vjHjQZ48Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:02:17.244952Z","bundle_sha256":"a4f90d432adbc7a66c37e8307509ec4785c803e07a30691966db4f1a542cc0b5"}}