{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7PZOPT7Y67DMSDWZAWSA3CG6GZ","short_pith_number":"pith:7PZOPT7Y","schema_version":"1.0","canonical_sha256":"fbf2e7cff8f7c6c90ed905a40d88de36516852ba2aed0a049b359c61ee3c1f37","source":{"kind":"arxiv","id":"2101.07813","version":1},"attestation_state":"computed","paper":{"title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Gian Giacomo Guerreschi","submitted_at":"2021-01-19T19:00:40Z","abstract_excerpt":"Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several approximate methods have been devised to reduce such cost. With the growing maturity of quantum computing, quantum algorithms have been proposed to speed up the solution by using either quantum annealers or universal quantum computers. Here we apply the divide-and-conquer approach to reduce the original problem to a collection of smaller problems whose solutions"},"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":"2101.07813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-01-19T19:00:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"efb5368adb8fa29e7eae3dcd81cc01c39cbabcadf49a4b48f4b9b849e8307ee1","abstract_canon_sha256":"c5545d710e4b567c3e115c35dd7a1cc97f8b9a2b2b81e5f16dcbd29bcb0b244b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:22.393658Z","signature_b64":"IUwz+FCco2heJTZjplcJo9FfZB5YD0snAAZ61G3EFxZ9orG+UHsJqeucC36JzI8U0bBMEWyF7yiDGdfat/SRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbf2e7cff8f7c6c90ed905a40d88de36516852ba2aed0a049b359c61ee3c1f37","last_reissued_at":"2026-07-05T02:08:22.393255Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:22.393255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Gian Giacomo Guerreschi","submitted_at":"2021-01-19T19:00:40Z","abstract_excerpt":"Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several approximate methods have been devised to reduce such cost. With the growing maturity of quantum computing, quantum algorithms have been proposed to speed up the solution by using either quantum annealers or universal quantum computers. Here we apply the divide-and-conquer approach to reduce the original problem to a collection of smaller problems whose solutions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07813","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/2101.07813/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":"2101.07813","created_at":"2026-07-05T02:08:22.393326+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.07813v1","created_at":"2026-07-05T02:08:22.393326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07813","created_at":"2026-07-05T02:08:22.393326+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PZOPT7Y67DM","created_at":"2026-07-05T02:08:22.393326+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PZOPT7Y67DMSDWZ","created_at":"2026-07-05T02:08:22.393326+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PZOPT7Y","created_at":"2026-07-05T02:08:22.393326+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ","json":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ.json","graph_json":"https://pith.science/api/pith-number/7PZOPT7Y67DMSDWZAWSA3CG6GZ/graph.json","events_json":"https://pith.science/api/pith-number/7PZOPT7Y67DMSDWZAWSA3CG6GZ/events.json","paper":"https://pith.science/paper/7PZOPT7Y"},"agent_actions":{"view_html":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ","download_json":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ.json","view_paper":"https://pith.science/paper/7PZOPT7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.07813&json=true","fetch_graph":"https://pith.science/api/pith-number/7PZOPT7Y67DMSDWZAWSA3CG6GZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7PZOPT7Y67DMSDWZAWSA3CG6GZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ/action/storage_attestation","attest_author":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ/action/author_attestation","sign_citation":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ/action/citation_signature","submit_replication":"https://pith.science/pith/7PZOPT7Y67DMSDWZAWSA3CG6GZ/action/replication_record"}},"created_at":"2026-07-05T02:08:22.393326+00:00","updated_at":"2026-07-05T02:08:22.393326+00:00"}