{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CRWB2SXTI235GNPS75AXUJXQMD","short_pith_number":"pith:CRWB2SXT","schema_version":"1.0","canonical_sha256":"146c1d4af346b7d335f2ff417a26f060fbfc31232d9d03f54ee384d742b568a1","source":{"kind":"arxiv","id":"1509.05001","version":2},"attestation_state":"computed","paper":{"title":"Solving constrained quadratic binary problems via quantum adiabatic evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","quant-ph"],"primary_cat":"math.OC","authors_text":"Brad Woods, Ehsan Iranmanesh, Pooya Ronagh","submitted_at":"2015-09-16T19:06:18Z","abstract_excerpt":"Quantum adiabatic evolution is perceived as useful for binary quadratic programming problems that are a priori unconstrained. For constrained problems, it is a common practice to relax linear equality constraints as penalty terms in the objective function. However, there has not yet been proposed a method for efficiently dealing with inequality constraints using the quantum adiabatic approach. In this paper, we give a method for solving the Lagrangian dual of a binary quadratic programming (BQP) problem in the presence of inequality constraints and employ this procedure within a branch-and-bou"},"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":"1509.05001","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-16T19:06:18Z","cross_cats_sorted":["cs.ET","quant-ph"],"title_canon_sha256":"1363cdea1ae8ae43de72b03bf9e4e633e00168f9da09ef6866d1ff408c3bf257","abstract_canon_sha256":"aec65098dd6d5173da536dd40ddb5ff24dea2875245516dc04923c534e0a2187"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:57.412218Z","signature_b64":"ofDSSb19cUtkVYR+yHnxXa5OmG0VdsKISs+NpR39ukPPeea4T5LU4v0RFI+zdTz9vS4mRT+d/mpkdqjpvcWlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146c1d4af346b7d335f2ff417a26f060fbfc31232d9d03f54ee384d742b568a1","last_reissued_at":"2026-05-18T00:23:57.411332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:57.411332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving constrained quadratic binary problems via quantum adiabatic evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","quant-ph"],"primary_cat":"math.OC","authors_text":"Brad Woods, Ehsan Iranmanesh, Pooya Ronagh","submitted_at":"2015-09-16T19:06:18Z","abstract_excerpt":"Quantum adiabatic evolution is perceived as useful for binary quadratic programming problems that are a priori unconstrained. For constrained problems, it is a common practice to relax linear equality constraints as penalty terms in the objective function. However, there has not yet been proposed a method for efficiently dealing with inequality constraints using the quantum adiabatic approach. In this paper, we give a method for solving the Lagrangian dual of a binary quadratic programming (BQP) problem in the presence of inequality constraints and employ this procedure within a branch-and-bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05001","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":"1509.05001","created_at":"2026-05-18T00:23:57.411642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05001v2","created_at":"2026-05-18T00:23:57.411642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05001","created_at":"2026-05-18T00:23:57.411642+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRWB2SXTI235","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRWB2SXTI235GNPS","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRWB2SXT","created_at":"2026-05-18T12:29:17.054201+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/CRWB2SXTI235GNPS75AXUJXQMD","json":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD.json","graph_json":"https://pith.science/api/pith-number/CRWB2SXTI235GNPS75AXUJXQMD/graph.json","events_json":"https://pith.science/api/pith-number/CRWB2SXTI235GNPS75AXUJXQMD/events.json","paper":"https://pith.science/paper/CRWB2SXT"},"agent_actions":{"view_html":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD","download_json":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD.json","view_paper":"https://pith.science/paper/CRWB2SXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05001&json=true","fetch_graph":"https://pith.science/api/pith-number/CRWB2SXTI235GNPS75AXUJXQMD/graph.json","fetch_events":"https://pith.science/api/pith-number/CRWB2SXTI235GNPS75AXUJXQMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD/action/storage_attestation","attest_author":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD/action/author_attestation","sign_citation":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD/action/citation_signature","submit_replication":"https://pith.science/pith/CRWB2SXTI235GNPS75AXUJXQMD/action/replication_record"}},"created_at":"2026-05-18T00:23:57.411642+00:00","updated_at":"2026-05-18T00:23:57.411642+00:00"}