{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AFRVZJNR2PJOBDYJW6IEOT4VQI","short_pith_number":"pith:AFRVZJNR","schema_version":"1.0","canonical_sha256":"01635ca5b1d3d2e08f09b790474f95823d9967d79a9cbc6b98dd3768dc1ab08f","source":{"kind":"arxiv","id":"1412.3138","version":2},"attestation_state":"computed","paper":{"title":"Computational Protein Design Using AND/OR Branch-and-Bound Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS"],"primary_cat":"cs.AI","authors_text":"Jianyang Zeng, Yichao Zhou, Yuexin Wu","submitted_at":"2014-12-08T12:23:10Z","abstract_excerpt":"The computation of the global minimum energy conformation (GMEC) is an important and challenging topic in structure-based computational protein design. In this paper, we propose a new protein design algorithm based on the AND/OR branch-and-bound (AOBB) search, which is a variant of the traditional branch-and-bound search algorithm, to solve this combinatorial optimization problem. By integrating with a powerful heuristic function, AOBB is able to fully exploit the graph structure of the underlying residue interaction network of a backbone template to significantly accelerate the design process"},"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":"1412.3138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-12-08T12:23:10Z","cross_cats_sorted":["cs.CE","cs.DS"],"title_canon_sha256":"32add81aaec84edbf81fdecf5f49191da9f41bb2d9e503e5260be95e64bf7177","abstract_canon_sha256":"216302b6245a0a4f9fbc17b36cb60850ca8951dafe567ef97df915be45fc5652"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:23.109580Z","signature_b64":"sShs4JMshun4Fm1BPH2o5QLGGrMYKBQPYmc/HywNgAHIoYwUOVT0+IQ8Uvztcws7UnxD1inIMkh3p6hgAusICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01635ca5b1d3d2e08f09b790474f95823d9967d79a9cbc6b98dd3768dc1ab08f","last_reissued_at":"2026-05-18T02:29:23.109125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:23.109125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Protein Design Using AND/OR Branch-and-Bound Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.DS"],"primary_cat":"cs.AI","authors_text":"Jianyang Zeng, Yichao Zhou, Yuexin Wu","submitted_at":"2014-12-08T12:23:10Z","abstract_excerpt":"The computation of the global minimum energy conformation (GMEC) is an important and challenging topic in structure-based computational protein design. In this paper, we propose a new protein design algorithm based on the AND/OR branch-and-bound (AOBB) search, which is a variant of the traditional branch-and-bound search algorithm, to solve this combinatorial optimization problem. By integrating with a powerful heuristic function, AOBB is able to fully exploit the graph structure of the underlying residue interaction network of a backbone template to significantly accelerate the design process"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3138","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":""},"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":"1412.3138","created_at":"2026-05-18T02:29:23.109191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3138v2","created_at":"2026-05-18T02:29:23.109191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3138","created_at":"2026-05-18T02:29:23.109191+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFRVZJNR2PJO","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFRVZJNR2PJOBDYJ","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFRVZJNR","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI","json":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI.json","graph_json":"https://pith.science/api/pith-number/AFRVZJNR2PJOBDYJW6IEOT4VQI/graph.json","events_json":"https://pith.science/api/pith-number/AFRVZJNR2PJOBDYJW6IEOT4VQI/events.json","paper":"https://pith.science/paper/AFRVZJNR"},"agent_actions":{"view_html":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI","download_json":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI.json","view_paper":"https://pith.science/paper/AFRVZJNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3138&json=true","fetch_graph":"https://pith.science/api/pith-number/AFRVZJNR2PJOBDYJW6IEOT4VQI/graph.json","fetch_events":"https://pith.science/api/pith-number/AFRVZJNR2PJOBDYJW6IEOT4VQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI/action/storage_attestation","attest_author":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI/action/author_attestation","sign_citation":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI/action/citation_signature","submit_replication":"https://pith.science/pith/AFRVZJNR2PJOBDYJW6IEOT4VQI/action/replication_record"}},"created_at":"2026-05-18T02:29:23.109191+00:00","updated_at":"2026-05-18T02:29:23.109191+00:00"}