{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FXL72E3EFXEHUTZVZYAVGEJII3","short_pith_number":"pith:FXL72E3E","canonical_record":{"source":{"id":"2510.00294","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T21:28:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"caa6e5f6f01a1d4c2dbb873ee0451695ff079fc2fefd8529b66b15277510ba2d","abstract_canon_sha256":"944a2fc5392a31049504aa551f3b0fb5241e0f228a5ad3486510f015fe6d6126"},"schema_version":"1.0"},"canonical_sha256":"2dd7fd13642dc87a4f35ce0153112846e8f7ebf4c1861d33a131a335a6cf2c84","source":{"kind":"arxiv","id":"2510.00294","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.00294","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2510.00294v4","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.00294","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"FXL72E3EFXEH","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"FXL72E3EFXEHUTZV","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"FXL72E3E","created_at":"2026-11-04T02:23:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FXL72E3EFXEHUTZVZYAVGEJII3","target":"record","payload":{"canonical_record":{"source":{"id":"2510.00294","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T21:28:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"caa6e5f6f01a1d4c2dbb873ee0451695ff079fc2fefd8529b66b15277510ba2d","abstract_canon_sha256":"944a2fc5392a31049504aa551f3b0fb5241e0f228a5ad3486510f015fe6d6126"},"schema_version":"1.0"},"canonical_sha256":"2dd7fd13642dc87a4f35ce0153112846e8f7ebf4c1861d33a131a335a6cf2c84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-11-04T02:23:10.931446Z","signature_b64":"oOnuIqCrRqEpCGBBoVgIAb8pWJyZhOhqNv8Ydgq1KpCgD+HGs1aWbbEpGhs5DFmusDKYXM76HYWfrwF45sZmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dd7fd13642dc87a4f35ce0153112846e8f7ebf4c1861d33a131a335a6cf2c84","last_reissued_at":"2026-11-04T02:23:10.929604Z","signature_status":"signed_v1","first_computed_at":"2026-11-04T02:23:10.929604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.00294","source_version":4,"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-11-04T02:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2L7oGWVddTNGcho6mcEPM53AWjIhJ887AWIxg7hfg8hGngpo8yIOf/F6c94GOrFHoiIZzeWd1SUo/bDa1lkNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T07:30:12.570963Z"},"content_sha256":"c041dc31a33753908c72ca35bfe0220a03e44a06ffa2c4326cff609e0a6229a8","schema_version":"1.0","event_id":"sha256:c041dc31a33753908c72ca35bfe0220a03e44a06ffa2c4326cff609e0a6229a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FXL72E3EFXEHUTZVZYAVGEJII3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Free Draft-and-Verification: Toward Lossless Parallel Decoding for Diffusion Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiawei Zhang, Shutong Wu","submitted_at":"2025-09-30T21:28:04Z","abstract_excerpt":"Diffusion Large Language Models (dLLMs) have emerged as a compelling paradigm for language modeling, offering the unique potential for highly efficient inference via multi-token parallel decoding. However, unlocking this potential remains challenging. High-quality generation typically defaults to one-token-per-step static decoding, while existing parallel algorithms rely on heuristic confidence thresholds, introducing a fragile trade-off between decoding efficiency and generation quality. To overcome this, we introduce Free Draft-and-Verification (FreeDave), a novel training-free and model-fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.00294","kind":"arxiv","version":4},"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/2510.00294/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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-11-04T02:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZvW1GYCJIbz5vwnoetQ2y1ev2xmuTaHPW3lBA4C70OAS/RCCyF7aDkHU5vayRZyvpp6nJwdCx9VdYUnuej6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T07:30:12.571352Z"},"content_sha256":"34e181cda69f37f7a02afa701fd714459fafd5377e9c8fb98b629fb065b2fef5","schema_version":"1.0","event_id":"sha256:34e181cda69f37f7a02afa701fd714459fafd5377e9c8fb98b629fb065b2fef5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXL72E3EFXEHUTZVZYAVGEJII3/bundle.json","state_url":"https://pith.science/pith/FXL72E3EFXEHUTZVZYAVGEJII3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXL72E3EFXEHUTZVZYAVGEJII3/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-11-16T07:30:12Z","links":{"resolver":"https://pith.science/pith/FXL72E3EFXEHUTZVZYAVGEJII3","bundle":"https://pith.science/pith/FXL72E3EFXEHUTZVZYAVGEJII3/bundle.json","state":"https://pith.science/pith/FXL72E3EFXEHUTZVZYAVGEJII3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXL72E3EFXEHUTZVZYAVGEJII3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FXL72E3EFXEHUTZVZYAVGEJII3","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":"944a2fc5392a31049504aa551f3b0fb5241e0f228a5ad3486510f015fe6d6126","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T21:28:04Z","title_canon_sha256":"caa6e5f6f01a1d4c2dbb873ee0451695ff079fc2fefd8529b66b15277510ba2d"},"schema_version":"1.0","source":{"id":"2510.00294","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.00294","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2510.00294v4","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.00294","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"FXL72E3EFXEH","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"FXL72E3EFXEHUTZV","created_at":"2026-11-04T02:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"FXL72E3E","created_at":"2026-11-04T02:23:10Z"}],"graph_snapshots":[{"event_id":"sha256:34e181cda69f37f7a02afa701fd714459fafd5377e9c8fb98b629fb065b2fef5","target":"graph","created_at":"2026-11-04T02:23:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.00294/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Diffusion Large Language Models (dLLMs) have emerged as a compelling paradigm for language modeling, offering the unique potential for highly efficient inference via multi-token parallel decoding. However, unlocking this potential remains challenging. High-quality generation typically defaults to one-token-per-step static decoding, while existing parallel algorithms rely on heuristic confidence thresholds, introducing a fragile trade-off between decoding efficiency and generation quality. To overcome this, we introduce Free Draft-and-Verification (FreeDave), a novel training-free and model-fre","authors_text":"Jiawei Zhang, Shutong Wu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T21:28:04Z","title":"Free Draft-and-Verification: Toward Lossless Parallel Decoding for Diffusion Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.00294","kind":"arxiv","version":4},"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:c041dc31a33753908c72ca35bfe0220a03e44a06ffa2c4326cff609e0a6229a8","target":"record","created_at":"2026-11-04T02:23:10Z","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":"944a2fc5392a31049504aa551f3b0fb5241e0f228a5ad3486510f015fe6d6126","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-09-30T21:28:04Z","title_canon_sha256":"caa6e5f6f01a1d4c2dbb873ee0451695ff079fc2fefd8529b66b15277510ba2d"},"schema_version":"1.0","source":{"id":"2510.00294","kind":"arxiv","version":4}},"canonical_sha256":"2dd7fd13642dc87a4f35ce0153112846e8f7ebf4c1861d33a131a335a6cf2c84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dd7fd13642dc87a4f35ce0153112846e8f7ebf4c1861d33a131a335a6cf2c84","first_computed_at":"2026-11-04T02:23:10.929604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-11-04T02:23:10.929604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oOnuIqCrRqEpCGBBoVgIAb8pWJyZhOhqNv8Ydgq1KpCgD+HGs1aWbbEpGhs5DFmusDKYXM76HYWfrwF45sZmCw==","signature_status":"signed_v1","signed_at":"2026-11-04T02:23:10.931446Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.00294","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c041dc31a33753908c72ca35bfe0220a03e44a06ffa2c4326cff609e0a6229a8","sha256:34e181cda69f37f7a02afa701fd714459fafd5377e9c8fb98b629fb065b2fef5"],"state_sha256":"b0cea17bfa7856bc7cba392daab3188e7c04a7f3a68ad002deb00bc152df5f8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxAFAbZ8Qbt3tZ3Xff3JsdDgQPe+N+za28nJyhZ2vAD9mPfH9fS5yM+gF0Hf+rxZLp8MEE0zcNsKgtngDutuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-11-16T07:30:12.575634Z","bundle_sha256":"d1c872333976524e1e45de2fb15b5a10b912d4e2245a5652dacc87bebd2cb0aa"}}