{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Y6GGGRXYR2JWCVBXGJGF3UXU6P","short_pith_number":"pith:Y6GGGRXY","canonical_record":{"source":{"id":"2510.06133","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-10-07T17:08:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d21668d3b0d1a1456f303fd179ba4b3da5437d63dcd2874a8db986eef1d07fe3","abstract_canon_sha256":"145a05375e762d97428eae8c402d60eb90b0c7848e32b5c915fc966b41da9894"},"schema_version":"1.0"},"canonical_sha256":"c78c6346f88e93615437324c5dd2f4f3e060e4192f8946155b3f610f2a485f5d","source":{"kind":"arxiv","id":"2510.06133","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.06133","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2510.06133v3","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06133","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GGGRXYR2JW","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GGGRXYR2JWCVBX","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GGGRXY","created_at":"2026-05-27T01:04:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Y6GGGRXYR2JWCVBXGJGF3UXU6P","target":"record","payload":{"canonical_record":{"source":{"id":"2510.06133","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-10-07T17:08:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d21668d3b0d1a1456f303fd179ba4b3da5437d63dcd2874a8db986eef1d07fe3","abstract_canon_sha256":"145a05375e762d97428eae8c402d60eb90b0c7848e32b5c915fc966b41da9894"},"schema_version":"1.0"},"canonical_sha256":"c78c6346f88e93615437324c5dd2f4f3e060e4192f8946155b3f610f2a485f5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:52.062452Z","signature_b64":"6QcZQnBF3u2UNBqtQrDrJfkm7bM1LTjFzfxVyYoXisMrb0r7j6S8sbDffIo4Nx8P53suV2E3JrlyemuJPAxdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78c6346f88e93615437324c5dd2f4f3e060e4192f8946155b3f610f2a485f5d","last_reissued_at":"2026-05-27T01:04:52.061714Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:52.061714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.06133","source_version":3,"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-05-27T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5nfZzOtn1+L6RBul9nbR4om22r5wr5wRlRP2o04w84dARg70jGAgDY+oZNV3SgDabC8ycygvwQCniXu1gqJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:31:48.701008Z"},"content_sha256":"908bc00da1f27c7b801ecc17e06293e78da2ba894e129fede3bf5e6ff29ee8e5","schema_version":"1.0","event_id":"sha256:908bc00da1f27c7b801ecc17e06293e78da2ba894e129fede3bf5e6ff29ee8e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Y6GGGRXYR2JWCVBXGJGF3UXU6P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CreditDecoding: Accelerating Parallel Decoding in Diffusion Large Language Models with Trace Credit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"By accumulating historical prediction evidence, CreditDecoding lets diffusion LLMs accept correct tokens earlier in parallel decoding, delivering up to 5.48 times speedup and modest accuracy gains.","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Haibo Feng, Jianguo Li, Kangyu Wang, Lin Liu, Weijia Zhao, Weiyao Lin, Zhenzhong Lan, Zhiyun Jiang","submitted_at":"2025-10-07T17:08:33Z","abstract_excerpt":"Diffusion large language models (dLLMs) generate text through iterative denoising. In commonly adopted parallel decoding schemes, each step confirms only high-confidence positions while remasking the others. By analyzing dLLM denoising traces, we uncover a key inefficiency: models often predict the correct target token several steps before its confidence becomes high enough to be decoded. This gap between early prediction and late decoding forces repeated remasking of already-correct tokens, causing redundant iterations and limiting acceleration. To exploit this temporal redundancy, we introdu"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On eight benchmarks, CreditDecoding achieves up to 5.48 times speedup with +0.48 accuracy on LLaDA-8B and consistently improves performance across diverse dLLM architectures and parameter scales.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that accumulating historical prediction evidence via Trace Credit and fusing it with current logits will reliably increase acceptance of correct tokens without introducing new errors or degrading performance on positions that were previously handled correctly.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CreditDecoding accelerates parallel decoding in diffusion LLMs by fusing accumulated Trace Credit with current logits to accept early-correct tokens sooner, yielding up to 5.48x speedup and accuracy gains.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"By accumulating historical prediction evidence, CreditDecoding lets diffusion LLMs accept correct tokens earlier in parallel decoding, delivering up to 5.48 times speedup and modest accuracy gains.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"228c9525af2c545eb6b8a9c5dc538e06a3ab23c8be7521b6e6a9ffad692a3f32"},"source":{"id":"2510.06133","kind":"arxiv","version":3},"verdict":{"id":"fea8ea21-6f55-44d4-a32e-ad3e73e57ad9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T09:03:11.125852Z","strongest_claim":"On eight benchmarks, CreditDecoding achieves up to 5.48 times speedup with +0.48 accuracy on LLaDA-8B and consistently improves performance across diverse dLLM architectures and parameter scales.","one_line_summary":"CreditDecoding accelerates parallel decoding in diffusion LLMs by fusing accumulated Trace Credit with current logits to accept early-correct tokens sooner, yielding up to 5.48x speedup and accuracy gains.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that accumulating historical prediction evidence via Trace Credit and fusing it with current logits will reliably increase acceptance of correct tokens without introducing new errors or degrading performance on positions that were previously handled correctly.","pith_extraction_headline":"By accumulating historical prediction evidence, CreditDecoding lets diffusion LLMs accept correct tokens earlier in parallel decoding, delivering up to 5.48 times speedup and modest accuracy gains."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.06133/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":2,"snapshot_sha256":"b82a84a798499cc1f869f906ea24525ff88039fa285f0226f6983f2e10d432db"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"fea8ea21-6f55-44d4-a32e-ad3e73e57ad9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afHF8fNpIShI1qN/4hk1dCbN87xHMktaSgKHzs49393h5XGo9Y9YZ36G/6dAJOa+g1maJCxZIRVyWtxTszEjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:31:48.701502Z"},"content_sha256":"b450d2567c3fb480296fbb1a5eff7ea8e92c802f107240ab656619380f2d255f","schema_version":"1.0","event_id":"sha256:b450d2567c3fb480296fbb1a5eff7ea8e92c802f107240ab656619380f2d255f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y6GGGRXYR2JWCVBXGJGF3UXU6P/bundle.json","state_url":"https://pith.science/pith/Y6GGGRXYR2JWCVBXGJGF3UXU6P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y6GGGRXYR2JWCVBXGJGF3UXU6P/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-02T14:31:48Z","links":{"resolver":"https://pith.science/pith/Y6GGGRXYR2JWCVBXGJGF3UXU6P","bundle":"https://pith.science/pith/Y6GGGRXYR2JWCVBXGJGF3UXU6P/bundle.json","state":"https://pith.science/pith/Y6GGGRXYR2JWCVBXGJGF3UXU6P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y6GGGRXYR2JWCVBXGJGF3UXU6P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Y6GGGRXYR2JWCVBXGJGF3UXU6P","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":"145a05375e762d97428eae8c402d60eb90b0c7848e32b5c915fc966b41da9894","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-10-07T17:08:33Z","title_canon_sha256":"d21668d3b0d1a1456f303fd179ba4b3da5437d63dcd2874a8db986eef1d07fe3"},"schema_version":"1.0","source":{"id":"2510.06133","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.06133","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"2510.06133v3","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06133","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"Y6GGGRXYR2JW","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"pith_short_16","alias_value":"Y6GGGRXYR2JWCVBX","created_at":"2026-05-27T01:04:52Z"},{"alias_kind":"pith_short_8","alias_value":"Y6GGGRXY","created_at":"2026-05-27T01:04:52Z"}],"graph_snapshots":[{"event_id":"sha256:b450d2567c3fb480296fbb1a5eff7ea8e92c802f107240ab656619380f2d255f","target":"graph","created_at":"2026-05-27T01:04:52Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"On eight benchmarks, CreditDecoding achieves up to 5.48 times speedup with +0.48 accuracy on LLaDA-8B and consistently improves performance across diverse dLLM architectures and parameter scales."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that accumulating historical prediction evidence via Trace Credit and fusing it with current logits will reliably increase acceptance of correct tokens without introducing new errors or degrading performance on positions that were previously handled correctly."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CreditDecoding accelerates parallel decoding in diffusion LLMs by fusing accumulated Trace Credit with current logits to accept early-correct tokens sooner, yielding up to 5.48x speedup and accuracy gains."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"By accumulating historical prediction evidence, CreditDecoding lets diffusion LLMs accept correct tokens earlier in parallel decoding, delivering up to 5.48 times speedup and modest accuracy gains."}],"snapshot_sha256":"228c9525af2c545eb6b8a9c5dc538e06a3ab23c8be7521b6e6a9ffad692a3f32"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b82a84a798499cc1f869f906ea24525ff88039fa285f0226f6983f2e10d432db"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.06133/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Diffusion large language models (dLLMs) generate text through iterative denoising. In commonly adopted parallel decoding schemes, each step confirms only high-confidence positions while remasking the others. By analyzing dLLM denoising traces, we uncover a key inefficiency: models often predict the correct target token several steps before its confidence becomes high enough to be decoded. This gap between early prediction and late decoding forces repeated remasking of already-correct tokens, causing redundant iterations and limiting acceleration. To exploit this temporal redundancy, we introdu","authors_text":"Haibo Feng, Jianguo Li, Kangyu Wang, Lin Liu, Weijia Zhao, Weiyao Lin, Zhenzhong Lan, Zhiyun Jiang","cross_cats":["cs.AI"],"headline":"By accumulating historical prediction evidence, CreditDecoding lets diffusion LLMs accept correct tokens earlier in parallel decoding, delivering up to 5.48 times speedup and modest accuracy gains.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-10-07T17:08:33Z","title":"CreditDecoding: Accelerating Parallel Decoding in Diffusion Large Language Models with Trace Credit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.06133","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-18T09:03:11.125852Z","id":"fea8ea21-6f55-44d4-a32e-ad3e73e57ad9","model_set":{"reader":"grok-4.3"},"one_line_summary":"CreditDecoding accelerates parallel decoding in diffusion LLMs by fusing accumulated Trace Credit with current logits to accept early-correct tokens sooner, yielding up to 5.48x speedup and accuracy gains.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"By accumulating historical prediction evidence, CreditDecoding lets diffusion LLMs accept correct tokens earlier in parallel decoding, delivering up to 5.48 times speedup and modest accuracy gains.","strongest_claim":"On eight benchmarks, CreditDecoding achieves up to 5.48 times speedup with +0.48 accuracy on LLaDA-8B and consistently improves performance across diverse dLLM architectures and parameter scales.","weakest_assumption":"The assumption that accumulating historical prediction evidence via Trace Credit and fusing it with current logits will reliably increase acceptance of correct tokens without introducing new errors or degrading performance on positions that were previously handled correctly."}},"verdict_id":"fea8ea21-6f55-44d4-a32e-ad3e73e57ad9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:908bc00da1f27c7b801ecc17e06293e78da2ba894e129fede3bf5e6ff29ee8e5","target":"record","created_at":"2026-05-27T01:04:52Z","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":"145a05375e762d97428eae8c402d60eb90b0c7848e32b5c915fc966b41da9894","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-10-07T17:08:33Z","title_canon_sha256":"d21668d3b0d1a1456f303fd179ba4b3da5437d63dcd2874a8db986eef1d07fe3"},"schema_version":"1.0","source":{"id":"2510.06133","kind":"arxiv","version":3}},"canonical_sha256":"c78c6346f88e93615437324c5dd2f4f3e060e4192f8946155b3f610f2a485f5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c78c6346f88e93615437324c5dd2f4f3e060e4192f8946155b3f610f2a485f5d","first_computed_at":"2026-05-27T01:04:52.061714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:04:52.061714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6QcZQnBF3u2UNBqtQrDrJfkm7bM1LTjFzfxVyYoXisMrb0r7j6S8sbDffIo4Nx8P53suV2E3JrlyemuJPAxdCA==","signature_status":"signed_v1","signed_at":"2026-05-27T01:04:52.062452Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.06133","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:908bc00da1f27c7b801ecc17e06293e78da2ba894e129fede3bf5e6ff29ee8e5","sha256:b450d2567c3fb480296fbb1a5eff7ea8e92c802f107240ab656619380f2d255f"],"state_sha256":"cf9d512cea2cf4f6c65552b4a987fab50e250a39c3daa739bf8b6d9bee324ab6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"synxGpj/uMavbqj6O3f773OBvfd8PhknVXmfj1TAgCcQhjd03nk5KDG1Q1xRw6KIHouX4mzC/0y4NmoDPkCfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:31:48.703792Z","bundle_sha256":"3f8b9aa8251270859b0a431a5caefbf150c3acd8b86543c867898670e10b8ab5"}}