{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OVQQK55CEK6RZQ6BCR3LGRYD5G","short_pith_number":"pith:OVQQK55C","schema_version":"1.0","canonical_sha256":"75610577a222bd1cc3c11476b34703e99ea89de02a2f088392d05e19eed77b95","source":{"kind":"arxiv","id":"2207.11674","version":2},"attestation_state":"computed","paper":{"title":"AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Shabani, Anbang Wu, Gushu Li, Hezi Zhang, Yuan Xie, Yufei Ding","submitted_at":"2022-07-24T06:49:58Z","abstract_excerpt":"Distributed quantum computing (DQC) is a promising approach to extending the computational power of near-term quantum devices. However, the non-local quantum communication between quantum devices is much more expensive and error-prone than the local quantum communication within each quantum device. Previous work on the DQC communication optimization focus on optimizing the communication protocol for each individual non-local gate and then adopt quantum compilation designs which are designed for local multi-qubit gates (such as controlled-x or CX gates) in a single quantum computer. The communi"},"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":"2207.11674","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-24T06:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"5767713a1e349b7c8d1fdf5a34f9046884f1422d5cf1f88f6528bbecfc59e88b","abstract_canon_sha256":"040f6a69da402eca08025b4daf4ad388d27c93dd5afd376e6709ef9d92b3d992"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:20.793061Z","signature_b64":"gijWpIiC6G43ZU2n0JwYAPb1D97Xm8Go0F6LYnHTZprA0n3iyksNuD0W62f397LmIUrRhaNptftHkOgumXYzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75610577a222bd1cc3c11476b34703e99ea89de02a2f088392d05e19eed77b95","last_reissued_at":"2026-07-05T05:09:20.792547Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:20.792547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AutoComm: A Framework for Enabling Efficient Communication in Distributed Quantum Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alireza Shabani, Anbang Wu, Gushu Li, Hezi Zhang, Yuan Xie, Yufei Ding","submitted_at":"2022-07-24T06:49:58Z","abstract_excerpt":"Distributed quantum computing (DQC) is a promising approach to extending the computational power of near-term quantum devices. However, the non-local quantum communication between quantum devices is much more expensive and error-prone than the local quantum communication within each quantum device. Previous work on the DQC communication optimization focus on optimizing the communication protocol for each individual non-local gate and then adopt quantum compilation designs which are designed for local multi-qubit gates (such as controlled-x or CX gates) in a single quantum computer. The communi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11674","kind":"arxiv","version":2},"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/2207.11674/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":"2207.11674","created_at":"2026-07-05T05:09:20.792612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11674v2","created_at":"2026-07-05T05:09:20.792612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11674","created_at":"2026-07-05T05:09:20.792612+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVQQK55CEK6R","created_at":"2026-07-05T05:09:20.792612+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVQQK55CEK6RZQ6B","created_at":"2026-07-05T05:09:20.792612+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVQQK55C","created_at":"2026-07-05T05:09:20.792612+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21960","citing_title":"dSABRE: A SABRE-Style Router for Multi-Core Distributed Quantum Computers","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20013","citing_title":"Assessing System Capabilities and Bottlenecks of an Early Fault-Tolerant Bicycle Architecture","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G","json":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G.json","graph_json":"https://pith.science/api/pith-number/OVQQK55CEK6RZQ6BCR3LGRYD5G/graph.json","events_json":"https://pith.science/api/pith-number/OVQQK55CEK6RZQ6BCR3LGRYD5G/events.json","paper":"https://pith.science/paper/OVQQK55C"},"agent_actions":{"view_html":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G","download_json":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G.json","view_paper":"https://pith.science/paper/OVQQK55C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11674&json=true","fetch_graph":"https://pith.science/api/pith-number/OVQQK55CEK6RZQ6BCR3LGRYD5G/graph.json","fetch_events":"https://pith.science/api/pith-number/OVQQK55CEK6RZQ6BCR3LGRYD5G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G/action/storage_attestation","attest_author":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G/action/author_attestation","sign_citation":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G/action/citation_signature","submit_replication":"https://pith.science/pith/OVQQK55CEK6RZQ6BCR3LGRYD5G/action/replication_record"}},"created_at":"2026-07-05T05:09:20.792612+00:00","updated_at":"2026-07-05T05:09:20.792612+00:00"}