{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FZ3E5CLXFDQLNOEOBLGOR3Q4AI","short_pith_number":"pith:FZ3E5CLX","schema_version":"1.0","canonical_sha256":"2e764e897728e0b6b88e0acce8ee1c023c6f5edcbede6523e99fe879ab1b4a91","source":{"kind":"arxiv","id":"2302.05737","version":3},"attestation_state":"computed","paper":{"title":"A Reparameterized Discrete Diffusion Model for Text Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jianbo Yuan, Lei Yu, Lingpeng Kong, Lin Zheng","submitted_at":"2023-02-11T16:26:57Z","abstract_excerpt":"This work studies discrete diffusion probabilistic models with applications to natural language generation. We derive an alternative yet equivalent formulation of the sampling from discrete diffusion processes and leverage this insight to develop a family of reparameterized discrete diffusion models. The derived generic framework is highly flexible, offers a fresh perspective of the generation process in discrete diffusion models, and features more effective training and decoding techniques. We conduct extensive experiments to evaluate the text generation capability of our model, demonstrating"},"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":"2302.05737","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-02-11T16:26:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9328801d34280cb8bd4e7758b45adcb7ce27a2079dfad7088bb88051c5b950d9","abstract_canon_sha256":"06bf9eecf60e8ef4701cfc27f54dc9016a49ae44d4e378789f58680921c186bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:51:09.993597Z","signature_b64":"ZTpbEAOVwETK380UZ/kHs+/mjdPIOusZPc+rFYjEKSZHamLTJ7i91Ja4AU8+R8DWPGHulqFg+nUC57fBF6pvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e764e897728e0b6b88e0acce8ee1c023c6f5edcbede6523e99fe879ab1b4a91","last_reissued_at":"2026-07-05T08:51:09.993075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:51:09.993075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reparameterized Discrete Diffusion Model for Text Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jianbo Yuan, Lei Yu, Lingpeng Kong, Lin Zheng","submitted_at":"2023-02-11T16:26:57Z","abstract_excerpt":"This work studies discrete diffusion probabilistic models with applications to natural language generation. We derive an alternative yet equivalent formulation of the sampling from discrete diffusion processes and leverage this insight to develop a family of reparameterized discrete diffusion models. The derived generic framework is highly flexible, offers a fresh perspective of the generation process in discrete diffusion models, and features more effective training and decoding techniques. We conduct extensive experiments to evaluate the text generation capability of our model, demonstrating"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05737","kind":"arxiv","version":3},"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/2302.05737/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":"2302.05737","created_at":"2026-07-05T08:51:09.993149+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05737v3","created_at":"2026-07-05T08:51:09.993149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05737","created_at":"2026-07-05T08:51:09.993149+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZ3E5CLXFDQL","created_at":"2026-07-05T08:51:09.993149+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZ3E5CLXFDQLNOEO","created_at":"2026-07-05T08:51:09.993149+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZ3E5CLX","created_at":"2026-07-05T08:51:09.993149+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":20,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05381","citing_title":"What Does a Discrete Diffusion Model Learn?","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24773","citing_title":"Posterior Refinement: Fast Language Generation via Any-Order Flow Maps","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.21802","citing_title":"When to Plan, When to Polish: Noise Level as a Granularity Axis for Diffusion Language Models","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08048","citing_title":"Diffusion Language Model Parallel Decoding via Product-of-Experts Bridge","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00773","citing_title":"Accelerating Discrete Diffusion Models with Parallel-In-Time Sampling","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00182","citing_title":"Towards A Generative Protein Evolution Machine with DPLM-Evo","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22765","citing_title":"Uniform Diffusion Models Revisited: Leave-One-Out Denoiser and Absorbing State Reformulation","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20813","citing_title":"PulseCol: Periodically Refreshed Column-Sparse Attention for Accelerating Diffusion Language Models","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17174","citing_title":"Beyond Execution: Static-Analysis Rewards and Hint-Conditioned Diffusion RL for Code Generation","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19726","citing_title":"Efficient Long-Context Modeling in Diffusion Language Models via Block Approximate Sparse Attention","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2505.16933","citing_title":"LLaDA-V: Large Language Diffusion Models with Visual Instruction Tuning","ref_index":106,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00182","citing_title":"Towards A Generative Protein Evolution Machine with DPLM-Evo","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11577","citing_title":"BitLM: Unlocking Multi-Token Language Generation with Bitwise Continuous Diffusion","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03360","citing_title":"A-CODE: Fully Atomic Protein Co-Design with Unified Multimodal Diffusion","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06548","citing_title":"Continuous Latent Diffusion Language Model","ref_index":115,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00182","citing_title":"Towards A Generative Protein Evolution Machine with DPLM-Evo","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07193","citing_title":"Coupling Models for One-Step Discrete Generation","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2502.09992","citing_title":"Large Language Diffusion Models","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05551","citing_title":"FastDiSS: Few-step Match Many-step Diffusion Language Model on Sequence-to-Sequence Generation--Full Version","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04291","citing_title":"Leveraging Pretrained Language Models as Energy Functions for Glauber Dynamics Text Diffusion","ref_index":118,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI","json":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI.json","graph_json":"https://pith.science/api/pith-number/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/graph.json","events_json":"https://pith.science/api/pith-number/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/events.json","paper":"https://pith.science/paper/FZ3E5CLX"},"agent_actions":{"view_html":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI","download_json":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI.json","view_paper":"https://pith.science/paper/FZ3E5CLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05737&json=true","fetch_graph":"https://pith.science/api/pith-number/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/graph.json","fetch_events":"https://pith.science/api/pith-number/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/action/storage_attestation","attest_author":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/action/author_attestation","sign_citation":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/action/citation_signature","submit_replication":"https://pith.science/pith/FZ3E5CLXFDQLNOEOBLGOR3Q4AI/action/replication_record"}},"created_at":"2026-07-05T08:51:09.993149+00:00","updated_at":"2026-07-05T08:51:09.993149+00:00"}