{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OFO22AKGNQVZYCMOCIM74Q7X2Y","short_pith_number":"pith:OFO22AKG","canonical_record":{"source":{"id":"1607.06883","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-23T03:22:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ff06e816202d47cbac7c80968e0706ccbc25bf426ed050fdeff4e0da577757a9","abstract_canon_sha256":"ae992d2d09ba680602ae3a92e70542c6e009b26a74d832ce4a6e163db0ed09ea"},"schema_version":"1.0"},"canonical_sha256":"715dad01466c2b9c098e1219fe43f7d609311a2e8b70d319c3822211cb3afd29","source":{"kind":"arxiv","id":"1607.06883","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06883","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06883v3","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06883","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"OFO22AKGNQVZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFO22AKGNQVZYCMO","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFO22AKG","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OFO22AKGNQVZYCMOCIM74Q7X2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06883","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-23T03:22:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ff06e816202d47cbac7c80968e0706ccbc25bf426ed050fdeff4e0da577757a9","abstract_canon_sha256":"ae992d2d09ba680602ae3a92e70542c6e009b26a74d832ce4a6e163db0ed09ea"},"schema_version":"1.0"},"canonical_sha256":"715dad01466c2b9c098e1219fe43f7d609311a2e8b70d319c3822211cb3afd29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.960271Z","signature_b64":"MJJaYZpccm5cgA1JPXe5u9E6SzCHCcCLNbaOkc6ZdKAs3nt+c0XP5t2HY9UH3eqF40+jDVheSgAaldo7sf6mCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"715dad01466c2b9c098e1219fe43f7d609311a2e8b70d319c3822211cb3afd29","last_reissued_at":"2026-05-18T00:25:11.959843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.959843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06883","source_version":3,"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-18T00:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PvWnN5mf0xyWinzhrYvPWrEnS2PB3ielVgTpgExyjT3zcPSXoS+f+BYnedLFw/xxczJbqsxX6YgI8M/PQaQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:26:11.181050Z"},"content_sha256":"7329bb7f2dbde91af06365e2cd4ddb1e00fc0eae24d010aea12a7c3482450414","schema_version":"1.0","event_id":"sha256:7329bb7f2dbde91af06365e2cd4ddb1e00fc0eae24d010aea12a7c3482450414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OFO22AKGNQVZYCMOCIM74Q7X2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Michele Scquizzato, Peter Robinson","submitted_at":"2016-07-23T03:22:38Z","abstract_excerpt":"This paper presents a randomized Las Vegas distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) time and message complexity. This algorithm runs in $\\tilde{O}(D + \\sqrt{n})$ time and exchanges $\\tilde{O}(m)$ messages (both with high probability), where $n$ is the number of nodes of the network, $D$ is the diameter, and $m$ is the number of edges. This is the first distributed MST algorithm that matches \\emph{simultaneously} the time lower bound of $\\tilde{\\Omega}(D + \\sqrt{n})$ [Elkin, SIAM J. Comput. 2006] and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06883","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":""},"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-18T00:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNjmoaX7e1OPnR1AgrkEndpWkcUK7enohJxoFcuMQMtTtmFE6DaJGWua0+AIh1TigH/ZjELKRrmvuuDmlG+JAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:26:11.181700Z"},"content_sha256":"ba89d98a380901afabe136b8adaa3782452954aa27772b59c0f3f71959a624c6","schema_version":"1.0","event_id":"sha256:ba89d98a380901afabe136b8adaa3782452954aa27772b59c0f3f71959a624c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/bundle.json","state_url":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/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-06-11T13:26:11Z","links":{"resolver":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y","bundle":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/bundle.json","state":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OFO22AKGNQVZYCMOCIM74Q7X2Y","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":"ae992d2d09ba680602ae3a92e70542c6e009b26a74d832ce4a6e163db0ed09ea","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-23T03:22:38Z","title_canon_sha256":"ff06e816202d47cbac7c80968e0706ccbc25bf426ed050fdeff4e0da577757a9"},"schema_version":"1.0","source":{"id":"1607.06883","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06883","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06883v3","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06883","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"OFO22AKGNQVZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFO22AKGNQVZYCMO","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFO22AKG","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ba89d98a380901afabe136b8adaa3782452954aa27772b59c0f3f71959a624c6","target":"graph","created_at":"2026-05-18T00:25:11Z","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":"This paper presents a randomized Las Vegas distributed algorithm that constructs a minimum spanning tree (MST) in weighted networks with optimal (up to polylogarithmic factors) time and message complexity. This algorithm runs in $\\tilde{O}(D + \\sqrt{n})$ time and exchanges $\\tilde{O}(m)$ messages (both with high probability), where $n$ is the number of nodes of the network, $D$ is the diameter, and $m$ is the number of edges. This is the first distributed MST algorithm that matches \\emph{simultaneously} the time lower bound of $\\tilde{\\Omega}(D + \\sqrt{n})$ [Elkin, SIAM J. Comput. 2006] and th","authors_text":"Gopal Pandurangan, Michele Scquizzato, Peter Robinson","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-23T03:22:38Z","title":"A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06883","kind":"arxiv","version":3},"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:7329bb7f2dbde91af06365e2cd4ddb1e00fc0eae24d010aea12a7c3482450414","target":"record","created_at":"2026-05-18T00:25:11Z","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":"ae992d2d09ba680602ae3a92e70542c6e009b26a74d832ce4a6e163db0ed09ea","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-23T03:22:38Z","title_canon_sha256":"ff06e816202d47cbac7c80968e0706ccbc25bf426ed050fdeff4e0da577757a9"},"schema_version":"1.0","source":{"id":"1607.06883","kind":"arxiv","version":3}},"canonical_sha256":"715dad01466c2b9c098e1219fe43f7d609311a2e8b70d319c3822211cb3afd29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"715dad01466c2b9c098e1219fe43f7d609311a2e8b70d319c3822211cb3afd29","first_computed_at":"2026-05-18T00:25:11.959843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.959843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MJJaYZpccm5cgA1JPXe5u9E6SzCHCcCLNbaOkc6ZdKAs3nt+c0XP5t2HY9UH3eqF40+jDVheSgAaldo7sf6mCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.960271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06883","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7329bb7f2dbde91af06365e2cd4ddb1e00fc0eae24d010aea12a7c3482450414","sha256:ba89d98a380901afabe136b8adaa3782452954aa27772b59c0f3f71959a624c6"],"state_sha256":"2485211a5c71d4bb671de41bc09b5ef37c775e2d4ca37529200cbfe33b83d9c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCSykCjmT/WnV17B//8Zpu0nM+060BZrY6ybkL9P1MOkFYsE5de9e0rL+Zr0/IxvmUbS8wKMP8+cDM5sqNxmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:26:11.184798Z","bundle_sha256":"63afe12043e568dab871e07655a39b41d6c7ba1609f6b3d42effbe4fbf644a23"}}