{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BUWQWJ2T4OJPAXF4QS4F5TFN55","short_pith_number":"pith:BUWQWJ2T","schema_version":"1.0","canonical_sha256":"0d2d0b2753e392f05cbc84b85eccadef502573a67345f39e671490329416ecd4","source":{"kind":"arxiv","id":"2107.07532","version":3},"attestation_state":"computed","paper":{"title":"Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Margaret Martonosi, Martin Suchara, Michael A. Perlin, Pranav Gokhale, Teague Tomesh, Zain H. Saleem","submitted_at":"2021-07-15T18:00:32Z","abstract_excerpt":"Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed architectures composed of many networked quantum computers have been proposed as a viable path to scalability. Such systems will need algorithms and compilers that are tailored to their distributed architectures. In this work we introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large combinatorial optimization prob"},"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":"2107.07532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-07-15T18:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"a882323c7c3332da30b46b1501c4a28a87f4bc5f9303be0840aa7ae9b55167f7","abstract_canon_sha256":"94f6e3de663e23196c4e665a23af81cf3708b1f98ea4d4d99e8331248a7ba656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:05.675546Z","signature_b64":"JEz+M87+bKx9xr7G+iyd3fTD2IfFgSXQOP4SwSxjEA1OYttQX6nG7iwAuFv9VstSP/9/hijzmhA3ocs3xvmCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d2d0b2753e392f05cbc84b85eccadef502573a67345f39e671490329416ecd4","last_reissued_at":"2026-07-05T07:00:05.675050Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:05.675050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Margaret Martonosi, Martin Suchara, Michael A. Perlin, Pranav Gokhale, Teague Tomesh, Zain H. Saleem","submitted_at":"2021-07-15T18:00:32Z","abstract_excerpt":"Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed architectures composed of many networked quantum computers have been proposed as a viable path to scalability. Such systems will need algorithms and compilers that are tailored to their distributed architectures. In this work we introduce the Quantum Divide and Conquer Algorithm (QDCA), a hybrid variational approach to mapping large combinatorial optimization prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.07532","kind":"arxiv","version":3},"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/2107.07532/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":"2107.07532","created_at":"2026-07-05T07:00:05.675107+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.07532v3","created_at":"2026-07-05T07:00:05.675107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.07532","created_at":"2026-07-05T07:00:05.675107+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUWQWJ2T4OJP","created_at":"2026-07-05T07:00:05.675107+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUWQWJ2T4OJPAXF4","created_at":"2026-07-05T07:00:05.675107+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUWQWJ2T","created_at":"2026-07-05T07:00:05.675107+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23074","citing_title":"Networked Quantum Services","ref_index":198,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55","json":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55.json","graph_json":"https://pith.science/api/pith-number/BUWQWJ2T4OJPAXF4QS4F5TFN55/graph.json","events_json":"https://pith.science/api/pith-number/BUWQWJ2T4OJPAXF4QS4F5TFN55/events.json","paper":"https://pith.science/paper/BUWQWJ2T"},"agent_actions":{"view_html":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55","download_json":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55.json","view_paper":"https://pith.science/paper/BUWQWJ2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.07532&json=true","fetch_graph":"https://pith.science/api/pith-number/BUWQWJ2T4OJPAXF4QS4F5TFN55/graph.json","fetch_events":"https://pith.science/api/pith-number/BUWQWJ2T4OJPAXF4QS4F5TFN55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55/action/storage_attestation","attest_author":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55/action/author_attestation","sign_citation":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55/action/citation_signature","submit_replication":"https://pith.science/pith/BUWQWJ2T4OJPAXF4QS4F5TFN55/action/replication_record"}},"created_at":"2026-07-05T07:00:05.675107+00:00","updated_at":"2026-07-05T07:00:05.675107+00:00"}