{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XMDROXHQTQGMUKVRWSPGILKGFP","short_pith_number":"pith:XMDROXHQ","schema_version":"1.0","canonical_sha256":"bb07175cf09c0cca2ab1b49e642d462bc39fb56362fe8e97ec4407d5e7460d67","source":{"kind":"arxiv","id":"2409.12675","version":5},"attestation_state":"computed","paper":{"title":"Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dimitra Simeonidou, Juan Marcelo Parra-Ullauri, Romerson D. Oliveira, Rui Wang, Sima Bahrani","submitted_at":"2024-09-19T11:39:46Z","abstract_excerpt":"Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors in terms of computational capability. However, realising the full potential of DQC requires effective resource management and circuit scheduling. This involves efficiently assigning each circuit to a subset of quantum processing units (QPUs), based on factors such as their computational power and connectivity. In heterogeneous DQC networks with arbitrary connectivity topologies and non-identical QPUs, this becomes a complex challenge. This paper addre"},"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":"2409.12675","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-09-19T11:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"5179e900accf47b898c0e0cb7c2261ee3f35691be90a2de468c1dcb579c82804","abstract_canon_sha256":"e657e15e20b3f66b1ceee451fd0e048311fd29490adab8a444eff2ed9c2c6323"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:13.871904Z","signature_b64":"OiiHtA33nY5eaWydrcC/vcP8KyDsK8dCNx6T98ETEZinYW1JiqzD42/SB323PqUTsOlrtjdNJ3v10QQrophdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb07175cf09c0cca2ab1b49e642d462bc39fb56362fe8e97ec4407d5e7460d67","last_reissued_at":"2026-05-22T01:03:13.870984Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:13.870984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Management and Circuit Scheduling for Distributed Quantum Computing Interconnect Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dimitra Simeonidou, Juan Marcelo Parra-Ullauri, Romerson D. Oliveira, Rui Wang, Sima Bahrani","submitted_at":"2024-09-19T11:39:46Z","abstract_excerpt":"Distributed quantum computing (DQC) has emerged as a promising approach to overcome the scalability limitations of monolithic quantum processors in terms of computational capability. However, realising the full potential of DQC requires effective resource management and circuit scheduling. This involves efficiently assigning each circuit to a subset of quantum processing units (QPUs), based on factors such as their computational power and connectivity. In heterogeneous DQC networks with arbitrary connectivity topologies and non-identical QPUs, this becomes a complex challenge. This paper addre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12675","kind":"arxiv","version":5},"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/2409.12675/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":"2409.12675","created_at":"2026-05-22T01:03:13.871101+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12675v5","created_at":"2026-05-22T01:03:13.871101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12675","created_at":"2026-05-22T01:03:13.871101+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMDROXHQTQGM","created_at":"2026-05-22T01:03:13.871101+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMDROXHQTQGMUKVR","created_at":"2026-05-22T01:03:13.871101+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMDROXHQ","created_at":"2026-05-22T01:03:13.871101+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18298","citing_title":"Optimizing Resource Allocation in a Distributed Quantum Computing Cloud: A Game-Theoretic Approach","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP","json":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP.json","graph_json":"https://pith.science/api/pith-number/XMDROXHQTQGMUKVRWSPGILKGFP/graph.json","events_json":"https://pith.science/api/pith-number/XMDROXHQTQGMUKVRWSPGILKGFP/events.json","paper":"https://pith.science/paper/XMDROXHQ"},"agent_actions":{"view_html":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP","download_json":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP.json","view_paper":"https://pith.science/paper/XMDROXHQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12675&json=true","fetch_graph":"https://pith.science/api/pith-number/XMDROXHQTQGMUKVRWSPGILKGFP/graph.json","fetch_events":"https://pith.science/api/pith-number/XMDROXHQTQGMUKVRWSPGILKGFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP/action/storage_attestation","attest_author":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP/action/author_attestation","sign_citation":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP/action/citation_signature","submit_replication":"https://pith.science/pith/XMDROXHQTQGMUKVRWSPGILKGFP/action/replication_record"}},"created_at":"2026-05-22T01:03:13.871101+00:00","updated_at":"2026-05-22T01:03:13.871101+00:00"}