{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OFO22AKGNQVZYCMOCIM74Q7X2Y","short_pith_number":"pith:OFO22AKG","schema_version":"1.0","canonical_sha256":"715dad01466c2b9c098e1219fe43f7d609311a2e8b70d319c3822211cb3afd29","source":{"kind":"arxiv","id":"1607.06883","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.06883","created_at":"2026-05-18T00:25:11.959910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06883v3","created_at":"2026-05-18T00:25:11.959910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06883","created_at":"2026-05-18T00:25:11.959910+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFO22AKGNQVZ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFO22AKGNQVZYCMO","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFO22AKG","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y","json":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y.json","graph_json":"https://pith.science/api/pith-number/OFO22AKGNQVZYCMOCIM74Q7X2Y/graph.json","events_json":"https://pith.science/api/pith-number/OFO22AKGNQVZYCMOCIM74Q7X2Y/events.json","paper":"https://pith.science/paper/OFO22AKG"},"agent_actions":{"view_html":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y","download_json":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y.json","view_paper":"https://pith.science/paper/OFO22AKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06883&json=true","fetch_graph":"https://pith.science/api/pith-number/OFO22AKGNQVZYCMOCIM74Q7X2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/OFO22AKGNQVZYCMOCIM74Q7X2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/action/storage_attestation","attest_author":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/action/author_attestation","sign_citation":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/action/citation_signature","submit_replication":"https://pith.science/pith/OFO22AKGNQVZYCMOCIM74Q7X2Y/action/replication_record"}},"created_at":"2026-05-18T00:25:11.959910+00:00","updated_at":"2026-05-18T00:25:11.959910+00:00"}