{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TIX7TTQHAWJWHZHK6TZD4W5YSF","short_pith_number":"pith:TIX7TTQH","canonical_record":{"source":{"id":"2604.18995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-21T02:26:08Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9e621d39e21d23a456ac488e6555f72a06949cc38fad517d7292d6573e5b04ea","abstract_canon_sha256":"2dad4755eb0bb5c4447a84b2a1015b9bbe5ebeb8cae3c921d23037e33eb9c64e"},"schema_version":"1.0"},"canonical_sha256":"9a2ff9ce07059363e4eaf4f23e5bb891453b19464d9b8df1d190511e061e8b3d","source":{"kind":"arxiv","id":"2604.18995","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.18995","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"2604.18995v2","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.18995","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"TIX7TTQHAWJW","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"pith_short_16","alias_value":"TIX7TTQHAWJWHZHK","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"pith_short_8","alias_value":"TIX7TTQH","created_at":"2026-06-03T01:05:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TIX7TTQHAWJWHZHK6TZD4W5YSF","target":"record","payload":{"canonical_record":{"source":{"id":"2604.18995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-21T02:26:08Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"9e621d39e21d23a456ac488e6555f72a06949cc38fad517d7292d6573e5b04ea","abstract_canon_sha256":"2dad4755eb0bb5c4447a84b2a1015b9bbe5ebeb8cae3c921d23037e33eb9c64e"},"schema_version":"1.0"},"canonical_sha256":"9a2ff9ce07059363e4eaf4f23e5bb891453b19464d9b8df1d190511e061e8b3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:13.923537Z","signature_b64":"mwOJbkSMmvV2ML2D/Po3uouX7Mi/2Cvr0OnIHTdpVFek7xRYYdPL2Z0Jm1NJojjSRz1LUZfqQpoQTgpyEQbyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a2ff9ce07059363e4eaf4f23e5bb891453b19464d9b8df1d190511e061e8b3d","last_reissued_at":"2026-06-03T01:05:13.923071Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:13.923071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.18995","source_version":2,"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-03T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9555BSMvCo97UXTn2jMd6qO8G9AQZNDjV4sM3MrOyp2HUPinEzYUTwsj1kfvvaG5GFTrELaPisR1y/bt2y9JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:43:39.727471Z"},"content_sha256":"535153aa0ddb4c5acfbcd6029d2e15dcbcc55bcdab101ab0f3f6a6f78aafb220","schema_version":"1.0","event_id":"sha256:535153aa0ddb4c5acfbcd6029d2e15dcbcc55bcdab101ab0f3f6a6f78aafb220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TIX7TTQHAWJWHZHK6TZD4W5YSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$R^2$-dLLM: Accelerating Diffusion Large Language Models via Spatio-Temporal Redundancy Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"R²-dLLM reduces diffusion LLM decoding steps by up to 75 percent by removing spatial and temporal redundancies during parallel token generation.","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Binfei Ji, Brucek Khailany, Kejing Xia, Nicolai Oswald, Pavlo Molchanov, Xinrui Zhong, Yingyan Lin, Yonggan Fu, Zhenbang Du","submitted_at":"2026-04-21T02:26:08Z","abstract_excerpt":"Diffusion Large Language Models (dLLMs) have emerged as a promising alternative to autoregressive generation by enabling parallel token prediction. However, practical dLLM decoding still suffers from high inference latency, which limits deployment. In this work, we observe that a substantial part of this inefficiency comes from recurring redundancy in the decoding process, including spatial redundancy caused by confidence clusters and positional ambiguity, and temporal redundancy caused by repeatedly remasking predictions that have already stabilized. Motivated by these patterns, we propose $R"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments demonstrate that R²-dLLM consistently reduces the number of decoding steps by up to 75% compared to existing decoding strategies, while maintaining competitive generation quality across different models and tasks.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the observed patterns of spatial redundancy from confidence clusters and positional ambiguity, plus temporal redundancy from remasking stabilized predictions, are general across dLLM models and tasks, and that the proposed aggregation rules plus redundancy-aware SFT can exploit them without quality loss.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"R²-dLLM reduces dLLM decoding steps by up to 75% via spatio-temporal redundancy reduction while keeping generation quality competitive.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"R²-dLLM reduces diffusion LLM decoding steps by up to 75 percent by removing spatial and temporal redundancies during parallel token generation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"20ac0dd5bb850ea30cbd41cf2f7677977546832befc3c6d55bca807975016228"},"source":{"id":"2604.18995","kind":"arxiv","version":2},"verdict":{"id":"41f9b6c5-d39f-40dd-afc2-5d0d4099ee2b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T02:52:24.300147Z","strongest_claim":"Experiments demonstrate that R²-dLLM consistently reduces the number of decoding steps by up to 75% compared to existing decoding strategies, while maintaining competitive generation quality across different models and tasks.","one_line_summary":"R²-dLLM reduces dLLM decoding steps by up to 75% via spatio-temporal redundancy reduction while keeping generation quality competitive.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the observed patterns of spatial redundancy from confidence clusters and positional ambiguity, plus temporal redundancy from remasking stabilized predictions, are general across dLLM models and tasks, and that the proposed aggregation rules plus redundancy-aware SFT can exploit them without quality loss.","pith_extraction_headline":"R²-dLLM reduces diffusion LLM decoding steps by up to 75 percent by removing spatial and temporal redundancies during parallel token generation."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.18995/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T03:25:22.752735Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"19ec52cec96daf0922c255de4241014af1b044be1e65f7656159db05af22a39c"},"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":"41f9b6c5-d39f-40dd-afc2-5d0d4099ee2b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2g0+BY+xMDqVAZZ0M/iU4zgKGfyZH9TIr9NkY1/fCvmtPN6x0Px1LzOxQVsjXaLfYZnhIY0xkRktaMQSFOqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:43:39.732388Z"},"content_sha256":"cd0c43462421dc733f33ed6644259a07c977abcd10b27ee1247e5dd8da77d41a","schema_version":"1.0","event_id":"sha256:cd0c43462421dc733f33ed6644259a07c977abcd10b27ee1247e5dd8da77d41a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIX7TTQHAWJWHZHK6TZD4W5YSF/bundle.json","state_url":"https://pith.science/pith/TIX7TTQHAWJWHZHK6TZD4W5YSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIX7TTQHAWJWHZHK6TZD4W5YSF/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-08-03T19:43:39Z","links":{"resolver":"https://pith.science/pith/TIX7TTQHAWJWHZHK6TZD4W5YSF","bundle":"https://pith.science/pith/TIX7TTQHAWJWHZHK6TZD4W5YSF/bundle.json","state":"https://pith.science/pith/TIX7TTQHAWJWHZHK6TZD4W5YSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIX7TTQHAWJWHZHK6TZD4W5YSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TIX7TTQHAWJWHZHK6TZD4W5YSF","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":"2dad4755eb0bb5c4447a84b2a1015b9bbe5ebeb8cae3c921d23037e33eb9c64e","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-21T02:26:08Z","title_canon_sha256":"9e621d39e21d23a456ac488e6555f72a06949cc38fad517d7292d6573e5b04ea"},"schema_version":"1.0","source":{"id":"2604.18995","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.18995","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"arxiv_version","alias_value":"2604.18995v2","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.18995","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"pith_short_12","alias_value":"TIX7TTQHAWJW","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"pith_short_16","alias_value":"TIX7TTQHAWJWHZHK","created_at":"2026-06-03T01:05:13Z"},{"alias_kind":"pith_short_8","alias_value":"TIX7TTQH","created_at":"2026-06-03T01:05:13Z"}],"graph_snapshots":[{"event_id":"sha256:cd0c43462421dc733f33ed6644259a07c977abcd10b27ee1247e5dd8da77d41a","target":"graph","created_at":"2026-06-03T01:05:13Z","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":"Experiments demonstrate that R²-dLLM consistently reduces the number of decoding steps by up to 75% compared to existing decoding strategies, while maintaining competitive generation quality across different models and tasks."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the observed patterns of spatial redundancy from confidence clusters and positional ambiguity, plus temporal redundancy from remasking stabilized predictions, are general across dLLM models and tasks, and that the proposed aggregation rules plus redundancy-aware SFT can exploit them without quality loss."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"R²-dLLM reduces dLLM decoding steps by up to 75% via spatio-temporal redundancy reduction while keeping generation quality competitive."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"R²-dLLM reduces diffusion LLM decoding steps by up to 75 percent by removing spatial and temporal redundancies during parallel token generation."}],"snapshot_sha256":"20ac0dd5bb850ea30cbd41cf2f7677977546832befc3c6d55bca807975016228"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T03:25:22.752735Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.18995/integrity.json","findings":[],"snapshot_sha256":"19ec52cec96daf0922c255de4241014af1b044be1e65f7656159db05af22a39c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Diffusion Large Language Models (dLLMs) have emerged as a promising alternative to autoregressive generation by enabling parallel token prediction. However, practical dLLM decoding still suffers from high inference latency, which limits deployment. In this work, we observe that a substantial part of this inefficiency comes from recurring redundancy in the decoding process, including spatial redundancy caused by confidence clusters and positional ambiguity, and temporal redundancy caused by repeatedly remasking predictions that have already stabilized. Motivated by these patterns, we propose $R","authors_text":"Binfei Ji, Brucek Khailany, Kejing Xia, Nicolai Oswald, Pavlo Molchanov, Xinrui Zhong, Yingyan Lin, Yonggan Fu, Zhenbang Du","cross_cats":["cs.AI","cs.LG"],"headline":"R²-dLLM reduces diffusion LLM decoding steps by up to 75 percent by removing spatial and temporal redundancies during parallel token generation.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-21T02:26:08Z","title":"$R^2$-dLLM: Accelerating Diffusion Large Language Models via Spatio-Temporal Redundancy Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.18995","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T02:52:24.300147Z","id":"41f9b6c5-d39f-40dd-afc2-5d0d4099ee2b","model_set":{"reader":"grok-4.3"},"one_line_summary":"R²-dLLM reduces dLLM decoding steps by up to 75% via spatio-temporal redundancy reduction while keeping generation quality competitive.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"R²-dLLM reduces diffusion LLM decoding steps by up to 75 percent by removing spatial and temporal redundancies during parallel token generation.","strongest_claim":"Experiments demonstrate that R²-dLLM consistently reduces the number of decoding steps by up to 75% compared to existing decoding strategies, while maintaining competitive generation quality across different models and tasks.","weakest_assumption":"That the observed patterns of spatial redundancy from confidence clusters and positional ambiguity, plus temporal redundancy from remasking stabilized predictions, are general across dLLM models and tasks, and that the proposed aggregation rules plus redundancy-aware SFT can exploit them without quality loss."}},"verdict_id":"41f9b6c5-d39f-40dd-afc2-5d0d4099ee2b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:535153aa0ddb4c5acfbcd6029d2e15dcbcc55bcdab101ab0f3f6a6f78aafb220","target":"record","created_at":"2026-06-03T01:05:13Z","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":"2dad4755eb0bb5c4447a84b2a1015b9bbe5ebeb8cae3c921d23037e33eb9c64e","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-04-21T02:26:08Z","title_canon_sha256":"9e621d39e21d23a456ac488e6555f72a06949cc38fad517d7292d6573e5b04ea"},"schema_version":"1.0","source":{"id":"2604.18995","kind":"arxiv","version":2}},"canonical_sha256":"9a2ff9ce07059363e4eaf4f23e5bb891453b19464d9b8df1d190511e061e8b3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a2ff9ce07059363e4eaf4f23e5bb891453b19464d9b8df1d190511e061e8b3d","first_computed_at":"2026-06-03T01:05:13.923071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:13.923071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mwOJbkSMmvV2ML2D/Po3uouX7Mi/2Cvr0OnIHTdpVFek7xRYYdPL2Z0Jm1NJojjSRz1LUZfqQpoQTgpyEQbyAg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:13.923537Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.18995","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:535153aa0ddb4c5acfbcd6029d2e15dcbcc55bcdab101ab0f3f6a6f78aafb220","sha256:cd0c43462421dc733f33ed6644259a07c977abcd10b27ee1247e5dd8da77d41a"],"state_sha256":"1a5d3e339b2967c049ae8377ef01cda9271408310d9252ec3cdae970bb16ab6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8yNbqUtloqontCawwg3VxatFyZecCitZykuUmVr6+x7PF8LdUuGFiCqldwzZ6Z6XEbia/xmOSL0TwAtBuuVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:43:39.745803Z","bundle_sha256":"70bff6937d7f717dccfe268133cd832fccbfe2d1dfaf226bcada40b2d5cebaed"}}