{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IH5URLBN642OINJH3XDMQXOPJP","short_pith_number":"pith:IH5URLBN","canonical_record":{"source":{"id":"1605.02022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T18:22:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e781c8339b2914bdeac9692845f64c832acb468acc99e8452a3f8fb8ae40d7e4","abstract_canon_sha256":"f21ac670c10ddc397b29705b874a2a0ce68d02e1770781bd986d5254273d99f0"},"schema_version":"1.0"},"canonical_sha256":"41fb48ac2df734e43527ddc6c85dcf4bd505237dc55dcf5295f3c36516ebdf57","source":{"kind":"arxiv","id":"1605.02022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02022","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02022v1","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02022","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"IH5URLBN642O","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IH5URLBN642OINJH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IH5URLBN","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IH5URLBN642OINJH3XDMQXOPJP","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T18:22:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e781c8339b2914bdeac9692845f64c832acb468acc99e8452a3f8fb8ae40d7e4","abstract_canon_sha256":"f21ac670c10ddc397b29705b874a2a0ce68d02e1770781bd986d5254273d99f0"},"schema_version":"1.0"},"canonical_sha256":"41fb48ac2df734e43527ddc6c85dcf4bd505237dc55dcf5295f3c36516ebdf57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:30.599476Z","signature_b64":"IRWgau5ekSWcY59ytoxVA+PklC3Y0gR2pSKxLTd8gPexA6xMQP52826UGVPxEBssHCiZwr/gJeuJH2E4BoloBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fb48ac2df734e43527ddc6c85dcf4bd505237dc55dcf5295f3c36516ebdf57","last_reissued_at":"2026-05-18T01:15:30.598809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:30.598809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02022","source_version":1,"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-18T01:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLuS7fVh9uOva4FAN5BG6MEqof4RIKbHjL66ewcHdkv5EkWuP3xJZNL+QUCswAMr4vfbb4Ts1hnoQQn/RkE/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:11:23.846308Z"},"content_sha256":"7cd04e0bdbec047e446f20f1181eb42c6743699391bbf65da3a436136ef42024","schema_version":"1.0","event_id":"sha256:7cd04e0bdbec047e446f20f1181eb42c6743699391bbf65da3a436136ef42024"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IH5URLBN642OINJH3XDMQXOPJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic MST Sparsification in the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Janne H. Korhonen","submitted_at":"2016-05-06T18:22:34Z","abstract_excerpt":"We give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to $n^{1+\\varepsilon}$ while preserving the minimum spanning forest, where $\\varepsilon > 0$ is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a general improvement. As a byproduct, we also obtain a simple alternative proof showing that MST can be computed deterministically in $O(\\log \\log n)$ rounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02022","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"},"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-18T01:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"123uGuWr01MRLuCi12LK4XjX6uXYJQ6A/3mAi26Pctm57qSG9CgSbn/CBSsPm5T9DkLq8vfVG/NZEa6VIFfBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:11:23.846677Z"},"content_sha256":"538ddb28ccd2f16061e7f797c22ad402c3869caeca8600738e8f339f72ac2239","schema_version":"1.0","event_id":"sha256:538ddb28ccd2f16061e7f797c22ad402c3869caeca8600738e8f339f72ac2239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/bundle.json","state_url":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH5URLBN642OINJH3XDMQXOPJP/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-08T23:11:23Z","links":{"resolver":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP","bundle":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/bundle.json","state":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH5URLBN642OINJH3XDMQXOPJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IH5URLBN642OINJH3XDMQXOPJP","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":"f21ac670c10ddc397b29705b874a2a0ce68d02e1770781bd986d5254273d99f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T18:22:34Z","title_canon_sha256":"e781c8339b2914bdeac9692845f64c832acb468acc99e8452a3f8fb8ae40d7e4"},"schema_version":"1.0","source":{"id":"1605.02022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02022","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02022v1","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02022","created_at":"2026-05-18T01:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"IH5URLBN642O","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IH5URLBN642OINJH","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IH5URLBN","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:538ddb28ccd2f16061e7f797c22ad402c3869caeca8600738e8f339f72ac2239","target":"graph","created_at":"2026-05-18T01:15:30Z","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 give a simple deterministic constant-round algorithm in the congested clique model for reducing the number of edges in a graph to $n^{1+\\varepsilon}$ while preserving the minimum spanning forest, where $\\varepsilon > 0$ is any constant. This implies that in the congested clique model, it is sufficient to improve MST and other connectivity algorithms on graphs with slightly superlinear number of edges to obtain a general improvement. As a byproduct, we also obtain a simple alternative proof showing that MST can be computed deterministically in $O(\\log \\log n)$ rounds.","authors_text":"Janne H. Korhonen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T18:22:34Z","title":"Deterministic MST Sparsification in the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02022","kind":"arxiv","version":1},"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:7cd04e0bdbec047e446f20f1181eb42c6743699391bbf65da3a436136ef42024","target":"record","created_at":"2026-05-18T01:15:30Z","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":"f21ac670c10ddc397b29705b874a2a0ce68d02e1770781bd986d5254273d99f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-06T18:22:34Z","title_canon_sha256":"e781c8339b2914bdeac9692845f64c832acb468acc99e8452a3f8fb8ae40d7e4"},"schema_version":"1.0","source":{"id":"1605.02022","kind":"arxiv","version":1}},"canonical_sha256":"41fb48ac2df734e43527ddc6c85dcf4bd505237dc55dcf5295f3c36516ebdf57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41fb48ac2df734e43527ddc6c85dcf4bd505237dc55dcf5295f3c36516ebdf57","first_computed_at":"2026-05-18T01:15:30.598809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:30.598809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IRWgau5ekSWcY59ytoxVA+PklC3Y0gR2pSKxLTd8gPexA6xMQP52826UGVPxEBssHCiZwr/gJeuJH2E4BoloBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:30.599476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cd04e0bdbec047e446f20f1181eb42c6743699391bbf65da3a436136ef42024","sha256:538ddb28ccd2f16061e7f797c22ad402c3869caeca8600738e8f339f72ac2239"],"state_sha256":"2080c4a1b36a2ba8b663909e1a81f9b9c279ac17339f4719b6b3b2418461fc6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UqwvvuwzTVEioCIhFxgj7Wvu/tgzj4qlO7ZALd+pZuRDvv4yhPKacdaUt6kjtFRTu1ual1TgXnF/KsC3w8rDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:11:23.848558Z","bundle_sha256":"11f6dff69f67a475dc3d9bc90256a2642af73b479ae4e88feb60e7007d6967ce"}}