{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WTMYTZ5JIIOYUIJAXPFMA475BX","short_pith_number":"pith:WTMYTZ5J","schema_version":"1.0","canonical_sha256":"b4d989e7a9421d8a2120bbcac073fd0ddb69f60e2d92df907dd5be22f54746d6","source":{"kind":"arxiv","id":"1810.13411","version":1},"attestation_state":"computed","paper":{"title":"A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher Ing, Mark Fingerhuth, Tom\\'a\\v{s} Babej","submitted_at":"2018-10-31T17:10:56Z","abstract_excerpt":"Gate-based universal quantum computers form a rapidly evolving field of quantum computing hardware technology. In previous work, we presented a quantum algorithm for lattice protein folding on a cubic lattice, tailored for quantum annealers. In this paper, we introduce a novel approach for solving the lattice protein folding problem on universal gate-based quantum computing architectures. Lattice protein models are coarse-grained representations of proteins that have been used extensively over the past thirty years to examine the principles of protein folding and design.These models can be use"},"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":"1810.13411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-31T17:10:56Z","cross_cats_sorted":[],"title_canon_sha256":"c539556a2b615974e143297466ab6bc6b47d143ed2d0bdafc4f0d0ff73bee36e","abstract_canon_sha256":"fd475d7fa093f4b34a8def8e0fc5a99f05fa700e21b33c338a419498d3f1b908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:49.377169Z","signature_b64":"4+xheKmogWfEBENdCOLQzdzKWD+jtj1221+beLeGjCBD+jtwc09V1EAmc5BpJcfNDYj4fnbe3Mo2JKp4HLuFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4d989e7a9421d8a2120bbcac073fd0ddb69f60e2d92df907dd5be22f54746d6","last_reissued_at":"2026-05-18T00:01:49.376628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:49.376628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher Ing, Mark Fingerhuth, Tom\\'a\\v{s} Babej","submitted_at":"2018-10-31T17:10:56Z","abstract_excerpt":"Gate-based universal quantum computers form a rapidly evolving field of quantum computing hardware technology. In previous work, we presented a quantum algorithm for lattice protein folding on a cubic lattice, tailored for quantum annealers. In this paper, we introduce a novel approach for solving the lattice protein folding problem on universal gate-based quantum computing architectures. Lattice protein models are coarse-grained representations of proteins that have been used extensively over the past thirty years to examine the principles of protein folding and design.These models can be use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13411","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":""},"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":"1810.13411","created_at":"2026-05-18T00:01:49.376722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13411v1","created_at":"2026-05-18T00:01:49.376722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13411","created_at":"2026-05-18T00:01:49.376722+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTMYTZ5JIIOY","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTMYTZ5JIIOYUIJA","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTMYTZ5J","created_at":"2026-05-18T12:33:01.666342+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/WTMYTZ5JIIOYUIJAXPFMA475BX","json":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX.json","graph_json":"https://pith.science/api/pith-number/WTMYTZ5JIIOYUIJAXPFMA475BX/graph.json","events_json":"https://pith.science/api/pith-number/WTMYTZ5JIIOYUIJAXPFMA475BX/events.json","paper":"https://pith.science/paper/WTMYTZ5J"},"agent_actions":{"view_html":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX","download_json":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX.json","view_paper":"https://pith.science/paper/WTMYTZ5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13411&json=true","fetch_graph":"https://pith.science/api/pith-number/WTMYTZ5JIIOYUIJAXPFMA475BX/graph.json","fetch_events":"https://pith.science/api/pith-number/WTMYTZ5JIIOYUIJAXPFMA475BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX/action/storage_attestation","attest_author":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX/action/author_attestation","sign_citation":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX/action/citation_signature","submit_replication":"https://pith.science/pith/WTMYTZ5JIIOYUIJAXPFMA475BX/action/replication_record"}},"created_at":"2026-05-18T00:01:49.376722+00:00","updated_at":"2026-05-18T00:01:49.376722+00:00"}