{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3ZK7QLAH5NZDEFJPVXCVBPPT6O","short_pith_number":"pith:3ZK7QLAH","schema_version":"1.0","canonical_sha256":"de55f82c07eb7232152fadc550bdf3f3bc2780bdb99958bfca28059fdad8c32d","source":{"kind":"arxiv","id":"2312.08940","version":1},"attestation_state":"computed","paper":{"title":"A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Michael Bortz, Raoul Heese, Tobias Seidel, Zongji Li","submitted_at":"2023-12-14T13:47:57Z","abstract_excerpt":"Current quantum computers can only solve optimization problems of a very limited size. For larger problems, decomposition methods are required in which the original problem is broken down into several smaller sub-problems. These are then solved on the quantum computer and their solutions are merged into a final solution for the original problem. Often, these decomposition methods do not take the specific problem structure into account. In this paper, we present a tailored method using a divide-and-conquer strategy to solve the number partitioning problem (NPP) with a large number of variables."},"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.08940","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2023-12-14T13:47:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d3a566a367fcae4f786e849a360c8853d4bd584b069e9fb3f4291113e13836c3","abstract_canon_sha256":"08cc8ba0a0f2c9238f1f542050472c491758c858939636bf997208b605b49d8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:17.791787Z","signature_b64":"P43uQCW5oxED71mHu8gFqAf3sCXuHAIq+pqBbirOow0DnhpHkyE6JGQXKoJBv8Ryr8Clk7HxYIKOYeJ/3LdpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de55f82c07eb7232152fadc550bdf3f3bc2780bdb99958bfca28059fdad8c32d","last_reissued_at":"2026-07-05T10:55:17.790516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:17.790516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Michael Bortz, Raoul Heese, Tobias Seidel, Zongji Li","submitted_at":"2023-12-14T13:47:57Z","abstract_excerpt":"Current quantum computers can only solve optimization problems of a very limited size. For larger problems, decomposition methods are required in which the original problem is broken down into several smaller sub-problems. These are then solved on the quantum computer and their solutions are merged into a final solution for the original problem. Often, these decomposition methods do not take the specific problem structure into account. In this paper, we present a tailored method using a divide-and-conquer strategy to solve the number partitioning problem (NPP) with a large number of variables."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.08940","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.08940/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.08940","created_at":"2026-07-05T10:55:17.790574+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.08940v1","created_at":"2026-07-05T10:55:17.790574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08940","created_at":"2026-07-05T10:55:17.790574+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZK7QLAH5NZD","created_at":"2026-07-05T10:55:17.790574+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZK7QLAH5NZDEFJP","created_at":"2026-07-05T10:55:17.790574+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZK7QLAH","created_at":"2026-07-05T10:55:17.790574+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08102","citing_title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O","json":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O.json","graph_json":"https://pith.science/api/pith-number/3ZK7QLAH5NZDEFJPVXCVBPPT6O/graph.json","events_json":"https://pith.science/api/pith-number/3ZK7QLAH5NZDEFJPVXCVBPPT6O/events.json","paper":"https://pith.science/paper/3ZK7QLAH"},"agent_actions":{"view_html":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O","download_json":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O.json","view_paper":"https://pith.science/paper/3ZK7QLAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.08940&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZK7QLAH5NZDEFJPVXCVBPPT6O/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZK7QLAH5NZDEFJPVXCVBPPT6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O/action/storage_attestation","attest_author":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O/action/author_attestation","sign_citation":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O/action/citation_signature","submit_replication":"https://pith.science/pith/3ZK7QLAH5NZDEFJPVXCVBPPT6O/action/replication_record"}},"created_at":"2026-07-05T10:55:17.790574+00:00","updated_at":"2026-07-05T10:55:17.790574+00:00"}