{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6W4FRKN2HOVQ2WGM6GSTLVUB7E","short_pith_number":"pith:6W4FRKN2","schema_version":"1.0","canonical_sha256":"f5b858a9ba3bab0d58ccf1a535d681f92b0c86d7f1bcfb2d093026c39bcf112b","source":{"kind":"arxiv","id":"1211.3422","version":2},"attestation_state":"computed","paper":{"title":"Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.soft","math-ph","math.MP","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Alejandro Perdomo-Ortiz, Bryan O'Gorman, Ryan Babbush, William Macready","submitted_at":"2012-11-14T21:00:25Z","abstract_excerpt":"Optimization problems associated with the interaction of linked particles are at the heart of polymer science, protein folding and other important problems in the physical sciences. In this review we explain how to recast these problems as constraint satisfaction problems such as linear programming, maximum satisfiability, and pseudo-boolean optimization. By encoding problems this way, one can leverage substantial insight and powerful solvers from the computer science community which studies constraint programming for diverse applications such as logistics, scheduling, artificial intelligence,"},"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":"1211.3422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-14T21:00:25Z","cross_cats_sorted":["cond-mat.soft","math-ph","math.MP","physics.chem-ph"],"title_canon_sha256":"13583dce6fbd58bc39d746ac27befef20d4191608982b8d1ce664d3d72928be3","abstract_canon_sha256":"1754c4ba78fc3bbe77d769f36cfcac321b35748cafd9c33524255a030b39a737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:04.115740Z","signature_b64":"NcQUJV2r4oK1EMAldwlxv+BEvMeOxtByedZp0YpKoe8F3d+1sEF1vRLYFmyIcHmKBD2MVj2ifu15J2gTuqa0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b858a9ba3bab0d58ccf1a535d681f92b0c86d7f1bcfb2d093026c39bcf112b","last_reissued_at":"2026-05-18T02:40:04.115216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:04.115216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.soft","math-ph","math.MP","physics.chem-ph"],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, Alejandro Perdomo-Ortiz, Bryan O'Gorman, Ryan Babbush, William Macready","submitted_at":"2012-11-14T21:00:25Z","abstract_excerpt":"Optimization problems associated with the interaction of linked particles are at the heart of polymer science, protein folding and other important problems in the physical sciences. In this review we explain how to recast these problems as constraint satisfaction problems such as linear programming, maximum satisfiability, and pseudo-boolean optimization. By encoding problems this way, one can leverage substantial insight and powerful solvers from the computer science community which studies constraint programming for diverse applications such as logistics, scheduling, artificial intelligence,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3422","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":"1211.3422","created_at":"2026-05-18T02:40:04.115291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3422v2","created_at":"2026-05-18T02:40:04.115291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3422","created_at":"2026-05-18T02:40:04.115291+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W4FRKN2HOVQ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W4FRKN2HOVQ2WGM","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W4FRKN2","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02163","citing_title":"Resource-Efficient Quantum Algorithm for Protein Folding","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E","json":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E.json","graph_json":"https://pith.science/api/pith-number/6W4FRKN2HOVQ2WGM6GSTLVUB7E/graph.json","events_json":"https://pith.science/api/pith-number/6W4FRKN2HOVQ2WGM6GSTLVUB7E/events.json","paper":"https://pith.science/paper/6W4FRKN2"},"agent_actions":{"view_html":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E","download_json":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E.json","view_paper":"https://pith.science/paper/6W4FRKN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3422&json=true","fetch_graph":"https://pith.science/api/pith-number/6W4FRKN2HOVQ2WGM6GSTLVUB7E/graph.json","fetch_events":"https://pith.science/api/pith-number/6W4FRKN2HOVQ2WGM6GSTLVUB7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E/action/storage_attestation","attest_author":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E/action/author_attestation","sign_citation":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E/action/citation_signature","submit_replication":"https://pith.science/pith/6W4FRKN2HOVQ2WGM6GSTLVUB7E/action/replication_record"}},"created_at":"2026-05-18T02:40:04.115291+00:00","updated_at":"2026-05-18T02:40:04.115291+00:00"}