{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:J3P4F3W73ZLMBKQGT4LLBBICKW","short_pith_number":"pith:J3P4F3W7","schema_version":"1.0","canonical_sha256":"4edfc2eedfde56c0aa069f16b0850255845b8bb35b0f164c68ec3c523a1a6135","source":{"kind":"arxiv","id":"2509.11040","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel de Roux, David E. Bernal Neira, Zedong Peng","submitted_at":"2025-09-14T02:10:16Z","abstract_excerpt":"Quantum algorithms have shown promise in solving Quadratic Unconstrained Binary Optimization (QUBO) problems, benefiting from their connection to the transverse field Ising model. Various Ising solvers, both classical and quantum, have emerged to tackle such problems efficiently but lack global optimality guarantees and often suffer from hardware limitations such as limited qubit availability. In this work, we propose a hybrid branch-and-bound (B&B) framework that integrates Ising solvers as heuristics within a classical B&B algorithm. Unlike prior theoretical studies, our work presents a prac"},"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":"2509.11040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-14T02:10:16Z","cross_cats_sorted":[],"title_canon_sha256":"17f49d9a891ea6471dbf95e6bc590767f5de5c7f84d442b7a442e1071386ac7b","abstract_canon_sha256":"54328aaddc71edf144a9eec1d519955402877ec2ac859bcf28044ab15d6355ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:32.433725Z","signature_b64":"vEkDvtv7k2n8I1/w+bFJgFpmj4WzwcSaKPL3BgyQttxg8lvqdmHyYOfdKdDjoorvirsdLctpPU5EZxIIZV0ECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4edfc2eedfde56c0aa069f16b0850255845b8bb35b0f164c68ec3c523a1a6135","last_reissued_at":"2026-07-05T12:11:32.433226Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:32.433226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel de Roux, David E. Bernal Neira, Zedong Peng","submitted_at":"2025-09-14T02:10:16Z","abstract_excerpt":"Quantum algorithms have shown promise in solving Quadratic Unconstrained Binary Optimization (QUBO) problems, benefiting from their connection to the transverse field Ising model. Various Ising solvers, both classical and quantum, have emerged to tackle such problems efficiently but lack global optimality guarantees and often suffer from hardware limitations such as limited qubit availability. In this work, we propose a hybrid branch-and-bound (B&B) framework that integrates Ising solvers as heuristics within a classical B&B algorithm. Unlike prior theoretical studies, our work presents a prac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.11040","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/2509.11040/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":"2509.11040","created_at":"2026-07-05T12:11:32.433283+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.11040v1","created_at":"2026-07-05T12:11:32.433283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.11040","created_at":"2026-07-05T12:11:32.433283+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3P4F3W73ZLM","created_at":"2026-07-05T12:11:32.433283+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3P4F3W73ZLMBKQG","created_at":"2026-07-05T12:11:32.433283+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3P4F3W7","created_at":"2026-07-05T12:11:32.433283+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05169","citing_title":"Ising-Machine-Assisted Large Neighborhood Search with Flexibly Tunable Subproblem Size","ref_index":52,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW","json":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW.json","graph_json":"https://pith.science/api/pith-number/J3P4F3W73ZLMBKQGT4LLBBICKW/graph.json","events_json":"https://pith.science/api/pith-number/J3P4F3W73ZLMBKQGT4LLBBICKW/events.json","paper":"https://pith.science/paper/J3P4F3W7"},"agent_actions":{"view_html":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW","download_json":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW.json","view_paper":"https://pith.science/paper/J3P4F3W7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.11040&json=true","fetch_graph":"https://pith.science/api/pith-number/J3P4F3W73ZLMBKQGT4LLBBICKW/graph.json","fetch_events":"https://pith.science/api/pith-number/J3P4F3W73ZLMBKQGT4LLBBICKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW/action/storage_attestation","attest_author":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW/action/author_attestation","sign_citation":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW/action/citation_signature","submit_replication":"https://pith.science/pith/J3P4F3W73ZLMBKQGT4LLBBICKW/action/replication_record"}},"created_at":"2026-07-05T12:11:32.433283+00:00","updated_at":"2026-07-05T12:11:32.433283+00:00"}