{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5CCEHQL4Q6EWF3TGXN2YN7TZGX","short_pith_number":"pith:5CCEHQL4","schema_version":"1.0","canonical_sha256":"e88443c17c878962ee66bb7586fe7935eb9fff53bbf80bc2c97da81c7d6da08d","source":{"kind":"arxiv","id":"1610.03897","version":2},"attestation_state":"computed","paper":{"title":"Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages","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":"2016-10-12T23:10:04Z","abstract_excerpt":"In a sequence of recent results (PODC 2015 and PODC 2016), the running time of the fastest algorithm for the \\emph{minimum spanning tree (MST)} problem in the \\emph{Congested Clique} model was first improved to $O(\\log \\log \\log n)$ from $O(\\log \\log n)$ (Hegeman et al., PODC 2015) and then to $O(\\log^* n)$ (Ghaffari and Parter, PODC 2016). All of these algorithms use $\\Theta(n^2)$ messages independent of the number of edges in the input graph.\n  This paper positively answers a question raised in Hegeman et al., and presents the first \"super-fast\" MST algorithm with $o(m)$ message complexity f"},"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":"1610.03897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-12T23:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"40d480ba91686598d2d37dbbf756f91ec563bab369a126de939bce2cf6986732","abstract_canon_sha256":"88a32ebf1a63a77637ae1914022e8d1eb69a100acd7523ed959c2bf6ac111130"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:59.726599Z","signature_b64":"HU9Lb40m7RobqzXLsVBygYf5DHr4gRdAcWzgp8+lyhiaIbcdYfH5Kcc7ZQ8GOdV4XdqWE8UEkVYeQDlAVZ3hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e88443c17c878962ee66bb7586fe7935eb9fff53bbf80bc2c97da81c7d6da08d","last_reissued_at":"2026-05-18T01:01:59.726111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:59.726111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Super-fast MST Algorithms in the Congested Clique using $o(m)$ Messages","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":"2016-10-12T23:10:04Z","abstract_excerpt":"In a sequence of recent results (PODC 2015 and PODC 2016), the running time of the fastest algorithm for the \\emph{minimum spanning tree (MST)} problem in the \\emph{Congested Clique} model was first improved to $O(\\log \\log \\log n)$ from $O(\\log \\log n)$ (Hegeman et al., PODC 2015) and then to $O(\\log^* n)$ (Ghaffari and Parter, PODC 2016). All of these algorithms use $\\Theta(n^2)$ messages independent of the number of edges in the input graph.\n  This paper positively answers a question raised in Hegeman et al., and presents the first \"super-fast\" MST algorithm with $o(m)$ message complexity f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03897","kind":"arxiv","version":2},"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":"1610.03897","created_at":"2026-05-18T01:01:59.726182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03897v2","created_at":"2026-05-18T01:01:59.726182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03897","created_at":"2026-05-18T01:01:59.726182+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CCEHQL4Q6EW","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CCEHQL4Q6EWF3TG","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CCEHQL4","created_at":"2026-05-18T12:30:01.593930+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/5CCEHQL4Q6EWF3TGXN2YN7TZGX","json":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX.json","graph_json":"https://pith.science/api/pith-number/5CCEHQL4Q6EWF3TGXN2YN7TZGX/graph.json","events_json":"https://pith.science/api/pith-number/5CCEHQL4Q6EWF3TGXN2YN7TZGX/events.json","paper":"https://pith.science/paper/5CCEHQL4"},"agent_actions":{"view_html":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX","download_json":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX.json","view_paper":"https://pith.science/paper/5CCEHQL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03897&json=true","fetch_graph":"https://pith.science/api/pith-number/5CCEHQL4Q6EWF3TGXN2YN7TZGX/graph.json","fetch_events":"https://pith.science/api/pith-number/5CCEHQL4Q6EWF3TGXN2YN7TZGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/action/storage_attestation","attest_author":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/action/author_attestation","sign_citation":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/action/citation_signature","submit_replication":"https://pith.science/pith/5CCEHQL4Q6EWF3TGXN2YN7TZGX/action/replication_record"}},"created_at":"2026-05-18T01:01:59.726182+00:00","updated_at":"2026-05-18T01:01:59.726182+00:00"}