{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IH5URLBN642OINJH3XDMQXOPJP","short_pith_number":"pith:IH5URLBN","schema_version":"1.0","canonical_sha256":"41fb48ac2df734e43527ddc6c85dcf4bd505237dc55dcf5295f3c36516ebdf57","source":{"kind":"arxiv","id":"1605.02022","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.02022","created_at":"2026-05-18T01:15:30.598895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02022v1","created_at":"2026-05-18T01:15:30.598895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02022","created_at":"2026-05-18T01:15:30.598895+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH5URLBN642O","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH5URLBN642OINJH","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH5URLBN","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17961","citing_title":"The Task Completion Problem and its Application to Crash-Resilient Computation","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP","json":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP.json","graph_json":"https://pith.science/api/pith-number/IH5URLBN642OINJH3XDMQXOPJP/graph.json","events_json":"https://pith.science/api/pith-number/IH5URLBN642OINJH3XDMQXOPJP/events.json","paper":"https://pith.science/paper/IH5URLBN"},"agent_actions":{"view_html":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP","download_json":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP.json","view_paper":"https://pith.science/paper/IH5URLBN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02022&json=true","fetch_graph":"https://pith.science/api/pith-number/IH5URLBN642OINJH3XDMQXOPJP/graph.json","fetch_events":"https://pith.science/api/pith-number/IH5URLBN642OINJH3XDMQXOPJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/action/storage_attestation","attest_author":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/action/author_attestation","sign_citation":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/action/citation_signature","submit_replication":"https://pith.science/pith/IH5URLBN642OINJH3XDMQXOPJP/action/replication_record"}},"created_at":"2026-05-18T01:15:30.598895+00:00","updated_at":"2026-05-18T01:15:30.598895+00:00"}