{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GCWJMLOGQJPF4FERLTURPZHZ6M","short_pith_number":"pith:GCWJMLOG","canonical_record":{"source":{"id":"1207.5211","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-22T09:55:59Z","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"title_canon_sha256":"db4c1a75bad6e762cb8625799e2160a9731e0b113b73b9775b58c8fcfe0e00b4","abstract_canon_sha256":"dc3b364fa246c41e06d4a1a63b7f641ac243f13d25c84cd2a0bd9f1dc24a06ec"},"schema_version":"1.0"},"canonical_sha256":"30ac962dc6825e5e14915ce917e4f9f33a59dcf898e6cb1bd5860918066005b1","source":{"kind":"arxiv","id":"1207.5211","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5211","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5211v5","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5211","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"GCWJMLOGQJPF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GCWJMLOGQJPF4FER","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GCWJMLOG","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GCWJMLOGQJPF4FERLTURPZHZ6M","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5211","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-22T09:55:59Z","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"title_canon_sha256":"db4c1a75bad6e762cb8625799e2160a9731e0b113b73b9775b58c8fcfe0e00b4","abstract_canon_sha256":"dc3b364fa246c41e06d4a1a63b7f641ac243f13d25c84cd2a0bd9f1dc24a06ec"},"schema_version":"1.0"},"canonical_sha256":"30ac962dc6825e5e14915ce917e4f9f33a59dcf898e6cb1bd5860918066005b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:14.512893Z","signature_b64":"mcMKXcmTFK5j/4v/7LasG+idJLllLbltdhjW9kaJkHwvSWsQLKwj5Dhz/yutRV7mkCXCaPLfJUwyMtpWCDQtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30ac962dc6825e5e14915ce917e4f9f33a59dcf898e6cb1bd5860918066005b1","last_reissued_at":"2026-05-18T02:52:14.512159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:14.512159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5211","source_version":5,"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-05-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XqhwnOoX45v9feIl5+sWfIiwiOxSjadipr6Ehzblh3PCcoSGUzZSxiK5Te9b7Z9SE4IXsarom7hblOL6u9h8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:35:25.636720Z"},"content_sha256":"b8d01fae3e28b2d0903164c89d1a99f026d0b8c7edeba057bd4c4c4411d16fc2","schema_version":"1.0","event_id":"sha256:b8d01fae3e28b2d0903164c89d1a99f026d0b8c7edeba057bd4c4c4411d16fc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GCWJMLOGQJPF4FERLTURPZHZ6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Quantum Communication Speed Up Distributed Computation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","quant-ph"],"primary_cat":"cs.DC","authors_text":"Danupon Nanongkai, Gopal Pandurangan, Hartmut Klauck, Michael Elkin","submitted_at":"2012-07-22T09:55:59Z","abstract_excerpt":"The focus of this paper is on {\\em quantum distributed} computation, where we investigate whether quantum communication can help in {\\em speeding up} distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication {\\em does not} help in substantially speeding up distributed algorithms for these problems compared to the classical setting.\n  In order to obtain this result, we extend the technique of Das Sarma et al. [SICOMP 2012] to obtain a uniform approach to prove non-trivial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5211","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":""},"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-05-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIvXaVro6Sx5udVjdFzEYvyLzyoSJNtXrrzSLh1f2xsgVKbR02l7Z1cOGSLlHoVT9g5xnADuCUJe5OLqlsZtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:35:25.637407Z"},"content_sha256":"9e8be5da75a6c22d953079186ba5da797e5372748a63ffcfd203247a1c1de00d","schema_version":"1.0","event_id":"sha256:9e8be5da75a6c22d953079186ba5da797e5372748a63ffcfd203247a1c1de00d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCWJMLOGQJPF4FERLTURPZHZ6M/bundle.json","state_url":"https://pith.science/pith/GCWJMLOGQJPF4FERLTURPZHZ6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCWJMLOGQJPF4FERLTURPZHZ6M/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-05-27T05:35:25Z","links":{"resolver":"https://pith.science/pith/GCWJMLOGQJPF4FERLTURPZHZ6M","bundle":"https://pith.science/pith/GCWJMLOGQJPF4FERLTURPZHZ6M/bundle.json","state":"https://pith.science/pith/GCWJMLOGQJPF4FERLTURPZHZ6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCWJMLOGQJPF4FERLTURPZHZ6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GCWJMLOGQJPF4FERLTURPZHZ6M","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":"dc3b364fa246c41e06d4a1a63b7f641ac243f13d25c84cd2a0bd9f1dc24a06ec","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-22T09:55:59Z","title_canon_sha256":"db4c1a75bad6e762cb8625799e2160a9731e0b113b73b9775b58c8fcfe0e00b4"},"schema_version":"1.0","source":{"id":"1207.5211","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5211","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5211v5","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5211","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"GCWJMLOGQJPF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GCWJMLOGQJPF4FER","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GCWJMLOG","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:9e8be5da75a6c22d953079186ba5da797e5372748a63ffcfd203247a1c1de00d","target":"graph","created_at":"2026-05-18T02:52:14Z","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"},"paper":{"abstract_excerpt":"The focus of this paper is on {\\em quantum distributed} computation, where we investigate whether quantum communication can help in {\\em speeding up} distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication {\\em does not} help in substantially speeding up distributed algorithms for these problems compared to the classical setting.\n  In order to obtain this result, we extend the technique of Das Sarma et al. [SICOMP 2012] to obtain a uniform approach to prove non-trivial","authors_text":"Danupon Nanongkai, Gopal Pandurangan, Hartmut Klauck, Michael Elkin","cross_cats":["cs.CC","cs.DS","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-22T09:55:59Z","title":"Can Quantum Communication Speed Up Distributed Computation?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5211","kind":"arxiv","version":5},"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:b8d01fae3e28b2d0903164c89d1a99f026d0b8c7edeba057bd4c4c4411d16fc2","target":"record","created_at":"2026-05-18T02:52:14Z","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":"dc3b364fa246c41e06d4a1a63b7f641ac243f13d25c84cd2a0bd9f1dc24a06ec","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-22T09:55:59Z","title_canon_sha256":"db4c1a75bad6e762cb8625799e2160a9731e0b113b73b9775b58c8fcfe0e00b4"},"schema_version":"1.0","source":{"id":"1207.5211","kind":"arxiv","version":5}},"canonical_sha256":"30ac962dc6825e5e14915ce917e4f9f33a59dcf898e6cb1bd5860918066005b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30ac962dc6825e5e14915ce917e4f9f33a59dcf898e6cb1bd5860918066005b1","first_computed_at":"2026-05-18T02:52:14.512159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:14.512159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mcMKXcmTFK5j/4v/7LasG+idJLllLbltdhjW9kaJkHwvSWsQLKwj5Dhz/yutRV7mkCXCaPLfJUwyMtpWCDQtBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:14.512893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5211","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8d01fae3e28b2d0903164c89d1a99f026d0b8c7edeba057bd4c4c4411d16fc2","sha256:9e8be5da75a6c22d953079186ba5da797e5372748a63ffcfd203247a1c1de00d"],"state_sha256":"e37e15a41389baf21025c0b7b486bec7a4a651f03bae5b5fcbcb09c3167f58c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYSWxgYjLhv+QFKU8YUCCMPLWrgbtOGFl+4Ca58VCEvryc7RXUIzBTEH1bszukmrfs0+Obk+RW3Msx33tt3nAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:35:25.641092Z","bundle_sha256":"cecba418ea5966640f737aa59cd01fca4dd2a2125b802fc5b4be67b7d3ab8c90"}}