{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SSCWHYMKSOFR3YCFSDRCOJQQ4J","short_pith_number":"pith:SSCWHYMK","schema_version":"1.0","canonical_sha256":"948563e18a938b1de04590e2272610e2484ef891f064c07dcf0d71e386bf2f20","source":{"kind":"arxiv","id":"1707.08484","version":3},"attestation_state":"computed","paper":{"title":"MST in O(1) Rounds of the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Krzysztof Nowicki, Tomasz Jurdzinski","submitted_at":"2017-07-26T15:04:22Z","abstract_excerpt":"We present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the Congested Clique model. The input graph in the Congested Clique model is a graph of n nodes, where each node initially knows only its incident edges. The communication graph is a clique with limited edge bandwidth: each two nodes (not necessarily neighbours in the input graph) can exchange $O(\\log n)$ bits.\n  As in previous works, the key part of the MST algorithm is an efficient Connected Components (CC) algorithm. However, unlike the former approach"},"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":"1707.08484","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T15:04:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c75f79e409606a3aa12f5b2741980e69a89ec399e71a8b9cef1d4a9a218e617b","abstract_canon_sha256":"f1cec5c02350f365dcae53c388b8d6854a734fc078965bd3a4933ac9a26ea004"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:40.353504Z","signature_b64":"uu66hN56f3UleOQ7T/FISSCTpCEQm8Pr+k7Ix+VJMlltAIDweqrPiFiYaTKkqEfBojVTuWoTm1qT7fnC78YfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"948563e18a938b1de04590e2272610e2484ef891f064c07dcf0d71e386bf2f20","last_reissued_at":"2026-05-18T00:31:40.352855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:40.352855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MST in O(1) Rounds of the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Krzysztof Nowicki, Tomasz Jurdzinski","submitted_at":"2017-07-26T15:04:22Z","abstract_excerpt":"We present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the Congested Clique model. The input graph in the Congested Clique model is a graph of n nodes, where each node initially knows only its incident edges. The communication graph is a clique with limited edge bandwidth: each two nodes (not necessarily neighbours in the input graph) can exchange $O(\\log n)$ bits.\n  As in previous works, the key part of the MST algorithm is an efficient Connected Components (CC) algorithm. However, unlike the former approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08484","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":"1707.08484","created_at":"2026-05-18T00:31:40.352955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08484v3","created_at":"2026-05-18T00:31:40.352955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08484","created_at":"2026-05-18T00:31:40.352955+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSCWHYMKSOFR","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSCWHYMKSOFR3YCF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSCWHYMK","created_at":"2026-05-18T12:31:43.269735+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/SSCWHYMKSOFR3YCFSDRCOJQQ4J","json":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J.json","graph_json":"https://pith.science/api/pith-number/SSCWHYMKSOFR3YCFSDRCOJQQ4J/graph.json","events_json":"https://pith.science/api/pith-number/SSCWHYMKSOFR3YCFSDRCOJQQ4J/events.json","paper":"https://pith.science/paper/SSCWHYMK"},"agent_actions":{"view_html":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J","download_json":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J.json","view_paper":"https://pith.science/paper/SSCWHYMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08484&json=true","fetch_graph":"https://pith.science/api/pith-number/SSCWHYMKSOFR3YCFSDRCOJQQ4J/graph.json","fetch_events":"https://pith.science/api/pith-number/SSCWHYMKSOFR3YCFSDRCOJQQ4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/action/storage_attestation","attest_author":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/action/author_attestation","sign_citation":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/action/citation_signature","submit_replication":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/action/replication_record"}},"created_at":"2026-05-18T00:31:40.352955+00:00","updated_at":"2026-05-18T00:31:40.352955+00:00"}