{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FFZB3QJCXSHEQQ7V3A7SDOGZVH","short_pith_number":"pith:FFZB3QJC","schema_version":"1.0","canonical_sha256":"29721dc122bc8e4843f5d83f21b8d9a9c58d904c216d54aaf5efb09ab01b052b","source":{"kind":"arxiv","id":"2410.13643","version":2},"attestation_state":"computed","paper":{"title":"Fine-Tuning Discrete Diffusion Models via Reward Optimization with Applications to DNA and Protein Design","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amy Wang, Avantika Lal, Aviv Regev, Chenyu Wang, Hanchen Wang, Masatoshi Uehara, Sergey Levine, Tommaso Biancalani, Tommi Jaakkola, Yichun He","submitted_at":"2024-10-17T15:10:13Z","abstract_excerpt":"Recent studies have demonstrated the strong empirical performance of diffusion models on discrete sequences across domains from natural language to biological sequence generation. For example, in the protein inverse folding task, conditional diffusion models have achieved impressive results in generating natural-like sequences that fold back into the original structure. However, practical design tasks often require not only modeling a conditional distribution but also optimizing specific task objectives. For instance, we may prefer protein sequences with high stability. To address this, we con"},"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":"2410.13643","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-17T15:10:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"911fb6b18d30b5a3eb23eb7eaf0b84c08dda8287c486791d8e7f279896e53d31","abstract_canon_sha256":"ad551319283136edc28749f24a972e1489a7fde283d35d913b2a3e031d685031"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:32.284164Z","signature_b64":"adM4GfIppqXlx1zrmqaX6hrZLXhxRQlSskEQ+QfKTZMqmaX9LegkgB/3DEeab00dwWvIT2e+NlxUrUcNhnL9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29721dc122bc8e4843f5d83f21b8d9a9c58d904c216d54aaf5efb09ab01b052b","last_reissued_at":"2026-07-05T10:32:32.283520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:32.283520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine-Tuning Discrete Diffusion Models via Reward Optimization with Applications to DNA and Protein Design","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amy Wang, Avantika Lal, Aviv Regev, Chenyu Wang, Hanchen Wang, Masatoshi Uehara, Sergey Levine, Tommaso Biancalani, Tommi Jaakkola, Yichun He","submitted_at":"2024-10-17T15:10:13Z","abstract_excerpt":"Recent studies have demonstrated the strong empirical performance of diffusion models on discrete sequences across domains from natural language to biological sequence generation. For example, in the protein inverse folding task, conditional diffusion models have achieved impressive results in generating natural-like sequences that fold back into the original structure. However, practical design tasks often require not only modeling a conditional distribution but also optimizing specific task objectives. For instance, we may prefer protein sequences with high stability. To address this, we con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13643","kind":"arxiv","version":2},"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/2410.13643/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":"2410.13643","created_at":"2026-07-05T10:32:32.283608+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.13643v2","created_at":"2026-07-05T10:32:32.283608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13643","created_at":"2026-07-05T10:32:32.283608+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFZB3QJCXSHE","created_at":"2026-07-05T10:32:32.283608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFZB3QJCXSHEQQ7V","created_at":"2026-07-05T10:32:32.283608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFZB3QJC","created_at":"2026-07-05T10:32:32.283608+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00773","citing_title":"Accelerating Discrete Diffusion Models with Parallel-In-Time Sampling","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23346","citing_title":"Contrastive Distribution Matching for Amortized Sequential Monte Carlo in Discrete Diffusion","ref_index":82,"is_internal_anchor":false},{"citing_arxiv_id":"2509.22963","citing_title":"Reinforcement Learning with Discrete Diffusion Policies for Combinatorial Action Spaces","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12916","citing_title":"Efficient Inference for Coupled Hidden Markov Models in Continuous Time and Discrete Space","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11726","citing_title":"Block-R1: Rethinking the Role of Block Size in Multi-domain Reinforcement Learning for Diffusion Large Language Models","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11726","citing_title":"Block-R1: Rethinking the Role of Block Size in Multi-domain Reinforcement Learning for Diffusion Large Language Models","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06491","citing_title":"Discrete Flow Matching Policy Optimization","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH","json":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH.json","graph_json":"https://pith.science/api/pith-number/FFZB3QJCXSHEQQ7V3A7SDOGZVH/graph.json","events_json":"https://pith.science/api/pith-number/FFZB3QJCXSHEQQ7V3A7SDOGZVH/events.json","paper":"https://pith.science/paper/FFZB3QJC"},"agent_actions":{"view_html":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH","download_json":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH.json","view_paper":"https://pith.science/paper/FFZB3QJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.13643&json=true","fetch_graph":"https://pith.science/api/pith-number/FFZB3QJCXSHEQQ7V3A7SDOGZVH/graph.json","fetch_events":"https://pith.science/api/pith-number/FFZB3QJCXSHEQQ7V3A7SDOGZVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH/action/storage_attestation","attest_author":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH/action/author_attestation","sign_citation":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH/action/citation_signature","submit_replication":"https://pith.science/pith/FFZB3QJCXSHEQQ7V3A7SDOGZVH/action/replication_record"}},"created_at":"2026-07-05T10:32:32.283608+00:00","updated_at":"2026-07-05T10:32:32.283608+00:00"}