{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PTQVC74VA2UCACNDU5J6AWUJA5","short_pith_number":"pith:PTQVC74V","schema_version":"1.0","canonical_sha256":"7ce1517f9506a82009a3a753e05a89074c26ee2e019683e4cc13bc46c659dfe6","source":{"kind":"arxiv","id":"1901.00924","version":1},"attestation_state":"computed","paper":{"title":"Improving solutions by embedding larger subproblems in a D-Wave quantum annealer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"quant-ph","authors_text":"Masayoshi Terabe, Masayuki Ohzeki, Shinichiro Taguchi, Shuntaro Okada","submitted_at":"2019-01-02T15:36:57Z","abstract_excerpt":"Quantum annealing is a heuristic algorithm that solves combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware implementation of this algorithm. However, in general, we cannot embed all the logical variables of a large-scale problem, since the number of available qubits is limited. In order to handle a large problem, qbsolv has been proposed as a method for partitioning the original large problem into subproblems that are embeddable in the D-Wave quantum annealer, and it then iteratively optimizes the subproblems using the quantum annealer. Multiple logical variable"},"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":"1901.00924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-02T15:36:57Z","cross_cats_sorted":["physics.data-an"],"title_canon_sha256":"b6efc7aa16b4a5ae3e26fbdf8a2f0e77fb165faf0965e0edf4e7abe6068c0937","abstract_canon_sha256":"284b6fd08e04a4e04a0fc3838fb8a111877fc46e2bd52d992adca8fee0821f80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:54.942469Z","signature_b64":"eZWLYi3S9rzwbJ+v/HoW4zZdKlEtZFYAQoEPP9ygCRoE36LUjOLzOBvcyg7g5nZ9NbFuu1hfdqXaEuhzypv9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce1517f9506a82009a3a753e05a89074c26ee2e019683e4cc13bc46c659dfe6","last_reissued_at":"2026-05-17T23:49:54.941978Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:54.941978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving solutions by embedding larger subproblems in a D-Wave quantum annealer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an"],"primary_cat":"quant-ph","authors_text":"Masayoshi Terabe, Masayuki Ohzeki, Shinichiro Taguchi, Shuntaro Okada","submitted_at":"2019-01-02T15:36:57Z","abstract_excerpt":"Quantum annealing is a heuristic algorithm that solves combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware implementation of this algorithm. However, in general, we cannot embed all the logical variables of a large-scale problem, since the number of available qubits is limited. In order to handle a large problem, qbsolv has been proposed as a method for partitioning the original large problem into subproblems that are embeddable in the D-Wave quantum annealer, and it then iteratively optimizes the subproblems using the quantum annealer. Multiple logical variable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00924","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":""},"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":"1901.00924","created_at":"2026-05-17T23:49:54.942113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00924v1","created_at":"2026-05-17T23:49:54.942113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00924","created_at":"2026-05-17T23:49:54.942113+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTQVC74VA2UC","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTQVC74VA2UCACND","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTQVC74V","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5","json":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5.json","graph_json":"https://pith.science/api/pith-number/PTQVC74VA2UCACNDU5J6AWUJA5/graph.json","events_json":"https://pith.science/api/pith-number/PTQVC74VA2UCACNDU5J6AWUJA5/events.json","paper":"https://pith.science/paper/PTQVC74V"},"agent_actions":{"view_html":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5","download_json":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5.json","view_paper":"https://pith.science/paper/PTQVC74V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00924&json=true","fetch_graph":"https://pith.science/api/pith-number/PTQVC74VA2UCACNDU5J6AWUJA5/graph.json","fetch_events":"https://pith.science/api/pith-number/PTQVC74VA2UCACNDU5J6AWUJA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5/action/storage_attestation","attest_author":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5/action/author_attestation","sign_citation":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5/action/citation_signature","submit_replication":"https://pith.science/pith/PTQVC74VA2UCACNDU5J6AWUJA5/action/replication_record"}},"created_at":"2026-05-17T23:49:54.942113+00:00","updated_at":"2026-05-17T23:49:54.942113+00:00"}