{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:562HZXEJOI5KOPOVEW2NSDMPHL","short_pith_number":"pith:562HZXEJ","schema_version":"1.0","canonical_sha256":"efb47cdc89723aa73dd525b4d90d8f3ac498e8c98530c68e8ce8a98dcf2838da","source":{"kind":"arxiv","id":"2312.15026","version":1},"attestation_state":"computed","paper":{"title":"QUBO Dual Bounds via SDP Plane Projection Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Apostolos Chalkis, Boro Sofranac, Thomas Kleinert","submitted_at":"2023-12-22T19:24:45Z","abstract_excerpt":"In this paper, we present a new method to solve a certain type of Semidefinite Programming (SDP) problems. These types of SDPs naturally arise in the Quadratic Convex Reformulation (QCR) method and can be used to obtain dual bounds of Quadratic Unconstrained Binary Optimization (QUBO) problems. QUBO problems have recently become the focus of attention in the quantum computing and optimization communities as they are well suited to both gate-based and annealing-based quantum computers on one side, and can encompass an exceptional variety of combinatorial optimization problems on the other. Our "},"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":"2312.15026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-22T19:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"3dc7fa671c31f9735553b46c3c2ae0596fc7d8a6c32b59904bb465ed786b883b","abstract_canon_sha256":"48f3a481efd28bfdf2b1e45f4a6f0000ab470985148393d49dc232e75a581479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:29.991462Z","signature_b64":"k9NM+Xo6Nh3oZbUWUfDMeAHDYA6y3dy6h8IfzTrQbymWk9oBfuUnxsBZPSKu5V68fItYg7aaNWlzg6pwmCe6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efb47cdc89723aa73dd525b4d90d8f3ac498e8c98530c68e8ce8a98dcf2838da","last_reissued_at":"2026-07-05T07:27:29.990978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:29.990978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QUBO Dual Bounds via SDP Plane Projection Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Apostolos Chalkis, Boro Sofranac, Thomas Kleinert","submitted_at":"2023-12-22T19:24:45Z","abstract_excerpt":"In this paper, we present a new method to solve a certain type of Semidefinite Programming (SDP) problems. These types of SDPs naturally arise in the Quadratic Convex Reformulation (QCR) method and can be used to obtain dual bounds of Quadratic Unconstrained Binary Optimization (QUBO) problems. QUBO problems have recently become the focus of attention in the quantum computing and optimization communities as they are well suited to both gate-based and annealing-based quantum computers on one side, and can encompass an exceptional variety of combinatorial optimization problems on the other. Our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15026","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/2312.15026/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":"2312.15026","created_at":"2026-07-05T07:27:29.991048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.15026v1","created_at":"2026-07-05T07:27:29.991048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15026","created_at":"2026-07-05T07:27:29.991048+00:00"},{"alias_kind":"pith_short_12","alias_value":"562HZXEJOI5K","created_at":"2026-07-05T07:27:29.991048+00:00"},{"alias_kind":"pith_short_16","alias_value":"562HZXEJOI5KOPOV","created_at":"2026-07-05T07:27:29.991048+00:00"},{"alias_kind":"pith_short_8","alias_value":"562HZXEJ","created_at":"2026-07-05T07:27:29.991048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.19221","citing_title":"VeloxQ: A Fast and Efficient QUBO Solver","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL","json":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL.json","graph_json":"https://pith.science/api/pith-number/562HZXEJOI5KOPOVEW2NSDMPHL/graph.json","events_json":"https://pith.science/api/pith-number/562HZXEJOI5KOPOVEW2NSDMPHL/events.json","paper":"https://pith.science/paper/562HZXEJ"},"agent_actions":{"view_html":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL","download_json":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL.json","view_paper":"https://pith.science/paper/562HZXEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.15026&json=true","fetch_graph":"https://pith.science/api/pith-number/562HZXEJOI5KOPOVEW2NSDMPHL/graph.json","fetch_events":"https://pith.science/api/pith-number/562HZXEJOI5KOPOVEW2NSDMPHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL/action/storage_attestation","attest_author":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL/action/author_attestation","sign_citation":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL/action/citation_signature","submit_replication":"https://pith.science/pith/562HZXEJOI5KOPOVEW2NSDMPHL/action/replication_record"}},"created_at":"2026-07-05T07:27:29.991048+00:00","updated_at":"2026-07-05T07:27:29.991048+00:00"}