{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VVERKBFBBGWZIL5NFX7ZIKM3HR","short_pith_number":"pith:VVERKBFB","schema_version":"1.0","canonical_sha256":"ad491504a109ad942fad2dff94299b3c4218f5265f538f1055e7ea7a6f417142","source":{"kind":"arxiv","id":"2505.07086","version":2},"attestation_state":"computed","paper":{"title":"Multi-Objective-Guided Discrete Flow Matching for Controllable Biological Sequence Design","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["q-bio.BM"],"primary_cat":"cs.LG","authors_text":"Pranam Chatterjee, Sophia Tang, Tong Chen, Yinuo Zhang","submitted_at":"2025-05-11T18:17:44Z","abstract_excerpt":"Designing biological sequences that satisfy multiple, often conflicting, functional and biophysical criteria remains a central challenge in biomolecule engineering. While discrete flow matching models have recently shown promise for efficient sampling in high-dimensional sequence spaces, existing approaches address only single objectives or require continuous embeddings that can distort discrete distributions. We present Multi-Objective-Guided Discrete Flow Matching (MOG-DFM), a general framework to steer any pretrained discrete flow matching generator toward Pareto-efficient trade-offs across"},"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":"2505.07086","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-11T18:17:44Z","cross_cats_sorted":["q-bio.BM"],"title_canon_sha256":"3a9ffc2b9d1cfc8ac591d64bf30e29b7302eb34749de395cc523be13616df40c","abstract_canon_sha256":"d198a6846e9b27f45d5e95e7eaf39bea6d027cfeb897e91cdb94e700e8cdb72c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:04.730466Z","signature_b64":"+dmJI2pAMEz/XTDhO1CELghJG7Loy0ZP6/JN07WBEhLkTb/dcuNXmdTjQrHU7gVUcvmCb6kiqbHBHRx/IhY0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad491504a109ad942fad2dff94299b3c4218f5265f538f1055e7ea7a6f417142","last_reissued_at":"2026-07-05T11:03:04.729976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:04.729976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Objective-Guided Discrete Flow Matching for Controllable Biological Sequence Design","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["q-bio.BM"],"primary_cat":"cs.LG","authors_text":"Pranam Chatterjee, Sophia Tang, Tong Chen, Yinuo Zhang","submitted_at":"2025-05-11T18:17:44Z","abstract_excerpt":"Designing biological sequences that satisfy multiple, often conflicting, functional and biophysical criteria remains a central challenge in biomolecule engineering. While discrete flow matching models have recently shown promise for efficient sampling in high-dimensional sequence spaces, existing approaches address only single objectives or require continuous embeddings that can distort discrete distributions. We present Multi-Objective-Guided Discrete Flow Matching (MOG-DFM), a general framework to steer any pretrained discrete flow matching generator toward Pareto-efficient trade-offs across"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07086","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/2505.07086/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":"2505.07086","created_at":"2026-07-05T11:03:04.730035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.07086v2","created_at":"2026-07-05T11:03:04.730035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07086","created_at":"2026-07-05T11:03:04.730035+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVERKBFBBGWZ","created_at":"2026-07-05T11:03:04.730035+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVERKBFBBGWZIL5N","created_at":"2026-07-05T11:03:04.730035+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVERKBFB","created_at":"2026-07-05T11:03:04.730035+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24140","citing_title":"A Time-Reparameterized Cumulative Intensity Extrapolation Sampler for Discrete Flow Matching","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05829","citing_title":"MP2D: Constrained Monte Carlo Tree-Guided Diffusion for Multi-Objective Protein Sequence Design","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR","json":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR.json","graph_json":"https://pith.science/api/pith-number/VVERKBFBBGWZIL5NFX7ZIKM3HR/graph.json","events_json":"https://pith.science/api/pith-number/VVERKBFBBGWZIL5NFX7ZIKM3HR/events.json","paper":"https://pith.science/paper/VVERKBFB"},"agent_actions":{"view_html":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR","download_json":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR.json","view_paper":"https://pith.science/paper/VVERKBFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.07086&json=true","fetch_graph":"https://pith.science/api/pith-number/VVERKBFBBGWZIL5NFX7ZIKM3HR/graph.json","fetch_events":"https://pith.science/api/pith-number/VVERKBFBBGWZIL5NFX7ZIKM3HR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR/action/storage_attestation","attest_author":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR/action/author_attestation","sign_citation":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR/action/citation_signature","submit_replication":"https://pith.science/pith/VVERKBFBBGWZIL5NFX7ZIKM3HR/action/replication_record"}},"created_at":"2026-07-05T11:03:04.730035+00:00","updated_at":"2026-07-05T11:03:04.730035+00:00"}