{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SSCWHYMKSOFR3YCFSDRCOJQQ4J","short_pith_number":"pith:SSCWHYMK","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"},"canonical_sha256":"948563e18a938b1de04590e2272610e2484ef891f064c07dcf0d71e386bf2f20","source":{"kind":"arxiv","id":"1707.08484","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08484","created_at":"2026-05-18T00:31:40Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08484v3","created_at":"2026-05-18T00:31:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08484","created_at":"2026-05-18T00:31:40Z"},{"alias_kind":"pith_short_12","alias_value":"SSCWHYMKSOFR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SSCWHYMKSOFR3YCF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SSCWHYMK","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SSCWHYMKSOFR3YCFSDRCOJQQ4J","target":"record","payload":{"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"},"canonical_sha256":"948563e18a938b1de04590e2272610e2484ef891f064c07dcf0d71e386bf2f20","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"},"source_kind":"arxiv","source_id":"1707.08484","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:31:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pkEr7dgJuX69I9qzPlEFeHtZ+soH5sPl7tQEPd9UeRTE994/NDdBBBsg8/6HbmDQPz6BFJkIN8zYD7FfxH/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:31:06.189278Z"},"content_sha256":"61cafd4491877a839a8bb5c9788c34f21a03fe81a56b500ab0cf9acd65a422b1","schema_version":"1.0","event_id":"sha256:61cafd4491877a839a8bb5c9788c34f21a03fe81a56b500ab0cf9acd65a422b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SSCWHYMKSOFR3YCFSDRCOJQQ4J","target":"graph","payload":{"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"},"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:31:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkemYlnu6V75ReQsfCLxQKmz89V9ClE80abP/Hq5wxnRxjvid9YG9rW7VSY6gMBwa7esX+jxPYQ9PriGo6w/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:31:06.189791Z"},"content_sha256":"7373e488e5d95e3be0a1a692746beedbc98c7319230689acaddabb1d483258e3","schema_version":"1.0","event_id":"sha256:7373e488e5d95e3be0a1a692746beedbc98c7319230689acaddabb1d483258e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/bundle.json","state_url":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/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-25T21:31:06Z","links":{"resolver":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J","bundle":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/bundle.json","state":"https://pith.science/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSCWHYMKSOFR3YCFSDRCOJQQ4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SSCWHYMKSOFR3YCFSDRCOJQQ4J","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":"f1cec5c02350f365dcae53c388b8d6854a734fc078965bd3a4933ac9a26ea004","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T15:04:22Z","title_canon_sha256":"c75f79e409606a3aa12f5b2741980e69a89ec399e71a8b9cef1d4a9a218e617b"},"schema_version":"1.0","source":{"id":"1707.08484","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08484","created_at":"2026-05-18T00:31:40Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08484v3","created_at":"2026-05-18T00:31:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08484","created_at":"2026-05-18T00:31:40Z"},{"alias_kind":"pith_short_12","alias_value":"SSCWHYMKSOFR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SSCWHYMKSOFR3YCF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SSCWHYMK","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7373e488e5d95e3be0a1a692746beedbc98c7319230689acaddabb1d483258e3","target":"graph","created_at":"2026-05-18T00:31:40Z","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":"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","authors_text":"Krzysztof Nowicki, Tomasz Jurdzinski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T15:04:22Z","title":"MST in O(1) Rounds of the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08484","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:61cafd4491877a839a8bb5c9788c34f21a03fe81a56b500ab0cf9acd65a422b1","target":"record","created_at":"2026-05-18T00:31:40Z","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":"f1cec5c02350f365dcae53c388b8d6854a734fc078965bd3a4933ac9a26ea004","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T15:04:22Z","title_canon_sha256":"c75f79e409606a3aa12f5b2741980e69a89ec399e71a8b9cef1d4a9a218e617b"},"schema_version":"1.0","source":{"id":"1707.08484","kind":"arxiv","version":3}},"canonical_sha256":"948563e18a938b1de04590e2272610e2484ef891f064c07dcf0d71e386bf2f20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"948563e18a938b1de04590e2272610e2484ef891f064c07dcf0d71e386bf2f20","first_computed_at":"2026-05-18T00:31:40.352855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:40.352855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uu66hN56f3UleOQ7T/FISSCTpCEQm8Pr+k7Ix+VJMlltAIDweqrPiFiYaTKkqEfBojVTuWoTm1qT7fnC78YfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:40.353504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08484","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61cafd4491877a839a8bb5c9788c34f21a03fe81a56b500ab0cf9acd65a422b1","sha256:7373e488e5d95e3be0a1a692746beedbc98c7319230689acaddabb1d483258e3"],"state_sha256":"2a1f05d7b66607073a2cf26ef84a816c7cb75cf75e5bb3959fdbffe3f8462b64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUwjy7YgzwRaAXcTlqXrMbXffyYrFJMp312ltfdsFPFFKSbO+5yCrX6QCpPSOr/CWmnjRiqgWbXV/T58KoFPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:31:06.192358Z","bundle_sha256":"a7612cef5b09faba4fa3061b1cb23c999800bbbef99aec7790a9386d3303be74"}}