{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:LNELYFQUHZSMUHRMOUMI2WVVZK","short_pith_number":"pith:LNELYFQU","canonical_record":{"source":{"id":"2210.02887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-09-16T02:44:52Z","cross_cats_sorted":["cs.GT","quant-ph"],"title_canon_sha256":"1ba91d0382e47417d902c8538d531cafa6b95b0cc52ee95b1f4e9ed6c83e37b8","abstract_canon_sha256":"8b09e73b6eb67dafab1cd8ebca40eb11cd8f5e084d19ba7d82bb95e86593502b"},"schema_version":"1.0"},"canonical_sha256":"5b48bc16143e64ca1e2c75188d5ab5ca8b7dc08f8fc0a8b1adfe8b87459fe5a4","source":{"kind":"arxiv","id":"2210.02887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.02887","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2210.02887v1","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02887","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"LNELYFQUHZSM","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"LNELYFQUHZSMUHRM","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"LNELYFQU","created_at":"2026-07-05T05:04:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:LNELYFQUHZSMUHRMOUMI2WVVZK","target":"record","payload":{"canonical_record":{"source":{"id":"2210.02887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-09-16T02:44:52Z","cross_cats_sorted":["cs.GT","quant-ph"],"title_canon_sha256":"1ba91d0382e47417d902c8538d531cafa6b95b0cc52ee95b1f4e9ed6c83e37b8","abstract_canon_sha256":"8b09e73b6eb67dafab1cd8ebca40eb11cd8f5e084d19ba7d82bb95e86593502b"},"schema_version":"1.0"},"canonical_sha256":"5b48bc16143e64ca1e2c75188d5ab5ca8b7dc08f8fc0a8b1adfe8b87459fe5a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:05.047461Z","signature_b64":"EQeYdkHmLQ2RbjdFUfsAR6m/i7+lRl9kkk3t5oHprG0/RKOE396QF+0mMJ+QFRbA7y1TVqRVZgMtoqJ+lOdQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b48bc16143e64ca1e2c75188d5ab5ca8b7dc08f8fc0a8b1adfe8b87459fe5a4","last_reissued_at":"2026-07-05T05:04:05.047119Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:05.047119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.02887","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAJo4FIpDvP+XcNKWWt18/Yw/IXvTCwkuLxgXjXMnFbJLDVoNGpwc6mtBMw4wsb07KSSS8VnSKgaGyvZTMesDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:09:30.355424Z"},"content_sha256":"cc7af30838e6c2ad156b27882cbe26d07a997a3c81218caa4a1c0899f5edb7f3","schema_version":"1.0","event_id":"sha256:cc7af30838e6c2ad156b27882cbe26d07a997a3c81218caa4a1c0899f5edb7f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:LNELYFQUHZSMUHRMOUMI2WVVZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","quant-ph"],"primary_cat":"cs.DC","authors_text":"Dusit Niyato, Han Yu, Jiawen Kang, Minrui Xu, Napat Ngoenriang, Xuemin (Sherman) Shen","submitted_at":"2022-09-16T02:44:52Z","abstract_excerpt":"With the advantages of high-speed parallel processing, quantum computers can efficiently solve large-scale complex optimization problems in future networks. However, due to the uncertain qubit fidelity and quantum channel noise, distributed quantum computing which relies on quantum networks connected through entanglement faces a lot of challenges for exchanging information across quantum computers. In this paper, we propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Firstly, we describe "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02887","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/2210.02887/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2l4g0U12Nazbs/OUY37e0Q5ocBXfMkexQgHrq6vv51PBX9jvCNWz4WQLvjLl3SJ/OFdwd+YdRJlUkK2xBBBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T09:09:30.356465Z"},"content_sha256":"0f19198b0b1bb3e9c886bbe3d9129cfd9b3e97fea312f381ab92282a54d09fa2","schema_version":"1.0","event_id":"sha256:0f19198b0b1bb3e9c886bbe3d9129cfd9b3e97fea312f381ab92282a54d09fa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNELYFQUHZSMUHRMOUMI2WVVZK/bundle.json","state_url":"https://pith.science/pith/LNELYFQUHZSMUHRMOUMI2WVVZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNELYFQUHZSMUHRMOUMI2WVVZK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-01T09:09:30Z","links":{"resolver":"https://pith.science/pith/LNELYFQUHZSMUHRMOUMI2WVVZK","bundle":"https://pith.science/pith/LNELYFQUHZSMUHRMOUMI2WVVZK/bundle.json","state":"https://pith.science/pith/LNELYFQUHZSMUHRMOUMI2WVVZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNELYFQUHZSMUHRMOUMI2WVVZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LNELYFQUHZSMUHRMOUMI2WVVZK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8b09e73b6eb67dafab1cd8ebca40eb11cd8f5e084d19ba7d82bb95e86593502b","cross_cats_sorted":["cs.GT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-09-16T02:44:52Z","title_canon_sha256":"1ba91d0382e47417d902c8538d531cafa6b95b0cc52ee95b1f4e9ed6c83e37b8"},"schema_version":"1.0","source":{"id":"2210.02887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.02887","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"2210.02887v1","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02887","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"LNELYFQUHZSM","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"pith_short_16","alias_value":"LNELYFQUHZSMUHRM","created_at":"2026-07-05T05:04:05Z"},{"alias_kind":"pith_short_8","alias_value":"LNELYFQU","created_at":"2026-07-05T05:04:05Z"}],"graph_snapshots":[{"event_id":"sha256:0f19198b0b1bb3e9c886bbe3d9129cfd9b3e97fea312f381ab92282a54d09fa2","target":"graph","created_at":"2026-07-05T05:04:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.02887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"With the advantages of high-speed parallel processing, quantum computers can efficiently solve large-scale complex optimization problems in future networks. However, due to the uncertain qubit fidelity and quantum channel noise, distributed quantum computing which relies on quantum networks connected through entanglement faces a lot of challenges for exchanging information across quantum computers. In this paper, we propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Firstly, we describe ","authors_text":"Dusit Niyato, Han Yu, Jiawen Kang, Minrui Xu, Napat Ngoenriang, Xuemin (Sherman) Shen","cross_cats":["cs.GT","quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-09-16T02:44:52Z","title":"DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02887","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cc7af30838e6c2ad156b27882cbe26d07a997a3c81218caa4a1c0899f5edb7f3","target":"record","created_at":"2026-07-05T05:04:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8b09e73b6eb67dafab1cd8ebca40eb11cd8f5e084d19ba7d82bb95e86593502b","cross_cats_sorted":["cs.GT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2022-09-16T02:44:52Z","title_canon_sha256":"1ba91d0382e47417d902c8538d531cafa6b95b0cc52ee95b1f4e9ed6c83e37b8"},"schema_version":"1.0","source":{"id":"2210.02887","kind":"arxiv","version":1}},"canonical_sha256":"5b48bc16143e64ca1e2c75188d5ab5ca8b7dc08f8fc0a8b1adfe8b87459fe5a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b48bc16143e64ca1e2c75188d5ab5ca8b7dc08f8fc0a8b1adfe8b87459fe5a4","first_computed_at":"2026-07-05T05:04:05.047119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:05.047119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EQeYdkHmLQ2RbjdFUfsAR6m/i7+lRl9kkk3t5oHprG0/RKOE396QF+0mMJ+QFRbA7y1TVqRVZgMtoqJ+lOdQDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:05.047461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.02887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc7af30838e6c2ad156b27882cbe26d07a997a3c81218caa4a1c0899f5edb7f3","sha256:0f19198b0b1bb3e9c886bbe3d9129cfd9b3e97fea312f381ab92282a54d09fa2"],"state_sha256":"a9398b058be1cde9d56a24ae58a8c81b1382b538881e70c5f53a915705221f0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KqIArzMEc+5FyMoTBUrBEs+HsciAgmFZ1jbC4KzZrmVZkiyki30FET7hfE4YXbvuFVZ52atYivt5yES/N0pMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T09:09:30.371153Z","bundle_sha256":"89dcf9dc1cb9e79f0d1728eee1192baf2f98a83de34e11bf977d3b7e6fb74a32"}}