{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2DYGWRPIGGR2LHNE3M5O7Z5XPU","short_pith_number":"pith:2DYGWRPI","schema_version":"1.0","canonical_sha256":"d0f06b45e831a3a59da4db3aefe7b77d2765ec654c9065b3bf9df0921bb2596d","source":{"kind":"arxiv","id":"2506.00925","version":1},"attestation_state":"computed","paper":{"title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"q-bio.BM","authors_text":"Cheng Tan, Hong Chang, Mengdi Liu, Shiguang Shan, Xiaoxue Cheng, Xilin Chen, Zhangyang Gao","submitted_at":"2025-06-01T09:34:20Z","abstract_excerpt":"Designing protein sequences that fold into a target 3D structure, known as protein inverse folding, is a fundamental challenge in protein engineering. While recent deep learning methods have achieved impressive performance by recovering native sequences, they often overlook the one-to-many nature of the problem: multiple diverse sequences can fold into the same structure. This motivates the need for a generative model capable of designing diverse sequences while preserving structural consistency. To address this trade-off, we introduce ProtInvTree, the first reward-guided tree-search framework"},"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":"2506.00925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.BM","submitted_at":"2025-06-01T09:34:20Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"1aa423c6fc95e16f4a8fb65d10f391cade7ee42451273b743e75fd605f8e65b5","abstract_canon_sha256":"2883e18da904a70b5511fedd5aaf6b93012e9428725fe353e7f57ab8d79f7ef4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:42.899454Z","signature_b64":"eTFXzwEq8q8LBhm7+7GEeM6tnGDWjepIdG9UGTonCDFLnp31msyZb1NQjN2dZM0C+nrRQJkP6yr2DOrwHaI3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0f06b45e831a3a59da4db3aefe7b77d2765ec654c9065b3bf9df0921bb2596d","last_reissued_at":"2026-07-05T11:13:42.898921Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:42.898921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"q-bio.BM","authors_text":"Cheng Tan, Hong Chang, Mengdi Liu, Shiguang Shan, Xiaoxue Cheng, Xilin Chen, Zhangyang Gao","submitted_at":"2025-06-01T09:34:20Z","abstract_excerpt":"Designing protein sequences that fold into a target 3D structure, known as protein inverse folding, is a fundamental challenge in protein engineering. While recent deep learning methods have achieved impressive performance by recovering native sequences, they often overlook the one-to-many nature of the problem: multiple diverse sequences can fold into the same structure. This motivates the need for a generative model capable of designing diverse sequences while preserving structural consistency. To address this trade-off, we introduce ProtInvTree, the first reward-guided tree-search framework"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00925","kind":"arxiv","version":1},"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/2506.00925/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":"2506.00925","created_at":"2026-07-05T11:13:42.898976+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00925v1","created_at":"2026-07-05T11:13:42.898976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00925","created_at":"2026-07-05T11:13:42.898976+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DYGWRPIGGR2","created_at":"2026-07-05T11:13:42.898976+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DYGWRPIGGR2LHNE","created_at":"2026-07-05T11:13:42.898976+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DYGWRPI","created_at":"2026-07-05T11:13:42.898976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23407","citing_title":"GeoCycler: Reward-Aligned 3D Diffusion for Constraint-Conditioned Cyclic Peptide Design","ref_index":67,"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":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU","json":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU.json","graph_json":"https://pith.science/api/pith-number/2DYGWRPIGGR2LHNE3M5O7Z5XPU/graph.json","events_json":"https://pith.science/api/pith-number/2DYGWRPIGGR2LHNE3M5O7Z5XPU/events.json","paper":"https://pith.science/paper/2DYGWRPI"},"agent_actions":{"view_html":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU","download_json":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU.json","view_paper":"https://pith.science/paper/2DYGWRPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00925&json=true","fetch_graph":"https://pith.science/api/pith-number/2DYGWRPIGGR2LHNE3M5O7Z5XPU/graph.json","fetch_events":"https://pith.science/api/pith-number/2DYGWRPIGGR2LHNE3M5O7Z5XPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU/action/storage_attestation","attest_author":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU/action/author_attestation","sign_citation":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU/action/citation_signature","submit_replication":"https://pith.science/pith/2DYGWRPIGGR2LHNE3M5O7Z5XPU/action/replication_record"}},"created_at":"2026-07-05T11:13:42.898976+00:00","updated_at":"2026-07-05T11:13:42.898976+00:00"}