{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D7QJPLGJT6CSYVPDXFYPXP26OG","short_pith_number":"pith:D7QJPLGJ","schema_version":"1.0","canonical_sha256":"1fe097acc99f852c55e3b970fbbf5e71bce2a17f6b2c7559b85eaecdace7b24a","source":{"kind":"arxiv","id":"1412.2333","version":1},"attestation_state":"computed","paper":{"title":"Minimum-weight Spanning Tree Construction in $O(\\log \\log \\log n)$ Rounds on the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Sriram V. Pemmaraju, Vivek B. Sardeshmukh","submitted_at":"2014-12-07T09:29:42Z","abstract_excerpt":"This paper considers the \\textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O(\\log \\log \\log n)$ rounds, with high probability. Prior to this, the fastest MST algorithm in this model was a deterministic algorithm due to Lotker et al.~(SIAM J on Comp, 2005) from about a decade ago. A key step along the way to designing this MST algorithm is a \\textit{connectivity verification} algorithm that not only runs in $O(\\log \\log \\log n)$ rounds with high probability, but also has low message complexity. This allows the fast computation of "},"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":"1412.2333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-07T09:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"0b9ee6236a63c070f3d40e08292b01b0495c74255963b8cd236df85394e992dc","abstract_canon_sha256":"5042b9332fbc8bd506f1f612082d5eca903687e0484f315e5518276b841fd163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:58.283418Z","signature_b64":"oyZjN9/oD24DaGmT9P5lgJb/gCKPHEWEgvsTl/PYjnIb7PSa7VOwjvgILz6Wa/oszrcVIiv5LH3/QS/XMLXwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fe097acc99f852c55e3b970fbbf5e71bce2a17f6b2c7559b85eaecdace7b24a","last_reissued_at":"2026-05-18T02:31:58.282796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:58.282796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum-weight Spanning Tree Construction in $O(\\log \\log \\log n)$ Rounds on the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Sriram V. Pemmaraju, Vivek B. Sardeshmukh","submitted_at":"2014-12-07T09:29:42Z","abstract_excerpt":"This paper considers the \\textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O(\\log \\log \\log n)$ rounds, with high probability. Prior to this, the fastest MST algorithm in this model was a deterministic algorithm due to Lotker et al.~(SIAM J on Comp, 2005) from about a decade ago. A key step along the way to designing this MST algorithm is a \\textit{connectivity verification} algorithm that not only runs in $O(\\log \\log \\log n)$ rounds with high probability, but also has low message complexity. This allows the fast computation of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2333","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":""},"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":"1412.2333","created_at":"2026-05-18T02:31:58.282886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2333v1","created_at":"2026-05-18T02:31:58.282886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2333","created_at":"2026-05-18T02:31:58.282886+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7QJPLGJT6CS","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7QJPLGJT6CSYVPD","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7QJPLGJ","created_at":"2026-05-18T12:28:25.294606+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/D7QJPLGJT6CSYVPDXFYPXP26OG","json":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG.json","graph_json":"https://pith.science/api/pith-number/D7QJPLGJT6CSYVPDXFYPXP26OG/graph.json","events_json":"https://pith.science/api/pith-number/D7QJPLGJT6CSYVPDXFYPXP26OG/events.json","paper":"https://pith.science/paper/D7QJPLGJ"},"agent_actions":{"view_html":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG","download_json":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG.json","view_paper":"https://pith.science/paper/D7QJPLGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2333&json=true","fetch_graph":"https://pith.science/api/pith-number/D7QJPLGJT6CSYVPDXFYPXP26OG/graph.json","fetch_events":"https://pith.science/api/pith-number/D7QJPLGJT6CSYVPDXFYPXP26OG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/action/storage_attestation","attest_author":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/action/author_attestation","sign_citation":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/action/citation_signature","submit_replication":"https://pith.science/pith/D7QJPLGJT6CSYVPDXFYPXP26OG/action/replication_record"}},"created_at":"2026-05-18T02:31:58.282886+00:00","updated_at":"2026-05-18T02:31:58.282886+00:00"}