{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JHWVEIKHFEOTPC22QQ3FYYI374","short_pith_number":"pith:JHWVEIKH","schema_version":"1.0","canonical_sha256":"49ed522147291d378b5a84365c611bff1e73d50e96aee44b0c03380df0ff4a13","source":{"kind":"arxiv","id":"2302.11185","version":1},"attestation_state":"computed","paper":{"title":"Quantum annealing with inequality constraints: the set cover problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Hristo N. Djidjev","submitted_at":"2023-02-22T07:39:51Z","abstract_excerpt":"This paper presents two novel approaches for solving the set cover problem (SCP) with multiple inequality constraints on quantum annealers. The first method uses the augmented Lagrangian approach to represent the constraints, while the second method employs a higher-order binary optimization (HUBO) formulation. Our experimental analysis demonstrate that both approaches outperform the standard approach with slack variables for solving problems with inequality constraints on D-Wave quantum annealers. The results show that the augmented Lagrangian method can be successfully used to implement a la"},"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":"2302.11185","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-02-22T07:39:51Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"ce2d0072accabdbd6fd90cc80d764b63640d11f7d83e19dce9817defbb96fbd4","abstract_canon_sha256":"64a2d59426a091dc594d82ac50db961945d7ffecaa16fa69621e8f9fbfd7b644"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:31.397584Z","signature_b64":"Cmw5pdCMM0pBapdakQQ1WWSkOuEARnRaNNgo3rH2M1gRp8jKR75lTf+8mT6j/snC+bUQ6eHMzcu1J6hzpOYqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49ed522147291d378b5a84365c611bff1e73d50e96aee44b0c03380df0ff4a13","last_reissued_at":"2026-07-05T05:44:31.397190Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:31.397190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum annealing with inequality constraints: the set cover problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Hristo N. Djidjev","submitted_at":"2023-02-22T07:39:51Z","abstract_excerpt":"This paper presents two novel approaches for solving the set cover problem (SCP) with multiple inequality constraints on quantum annealers. The first method uses the augmented Lagrangian approach to represent the constraints, while the second method employs a higher-order binary optimization (HUBO) formulation. Our experimental analysis demonstrate that both approaches outperform the standard approach with slack variables for solving problems with inequality constraints on D-Wave quantum annealers. The results show that the augmented Lagrangian method can be successfully used to implement a la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11185","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/2302.11185/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":"2302.11185","created_at":"2026-07-05T05:44:31.397247+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.11185v1","created_at":"2026-07-05T05:44:31.397247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11185","created_at":"2026-07-05T05:44:31.397247+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHWVEIKHFEOT","created_at":"2026-07-05T05:44:31.397247+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHWVEIKHFEOTPC22","created_at":"2026-07-05T05:44:31.397247+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHWVEIKH","created_at":"2026-07-05T05:44:31.397247+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.07501","citing_title":"A compact QUBO encoding of computational logic formulae demonstrated on cryptography constructions","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374","json":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374.json","graph_json":"https://pith.science/api/pith-number/JHWVEIKHFEOTPC22QQ3FYYI374/graph.json","events_json":"https://pith.science/api/pith-number/JHWVEIKHFEOTPC22QQ3FYYI374/events.json","paper":"https://pith.science/paper/JHWVEIKH"},"agent_actions":{"view_html":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374","download_json":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374.json","view_paper":"https://pith.science/paper/JHWVEIKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.11185&json=true","fetch_graph":"https://pith.science/api/pith-number/JHWVEIKHFEOTPC22QQ3FYYI374/graph.json","fetch_events":"https://pith.science/api/pith-number/JHWVEIKHFEOTPC22QQ3FYYI374/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374/action/storage_attestation","attest_author":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374/action/author_attestation","sign_citation":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374/action/citation_signature","submit_replication":"https://pith.science/pith/JHWVEIKHFEOTPC22QQ3FYYI374/action/replication_record"}},"created_at":"2026-07-05T05:44:31.397247+00:00","updated_at":"2026-07-05T05:44:31.397247+00:00"}