{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6CRWBJUZ24TE2DJ4ZTUDDT55UT","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":"85543fa10200e440eead01fe90e02ff477f2db2112140415ba6fcb501765c727","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T14:33:34Z","title_canon_sha256":"d1e2b949c4d3631f1fca8ce3a7b3a534204e12495eb1e67e670d483377d53bd4"},"schema_version":"1.0","source":{"id":"1805.03055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03055","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03055v1","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03055","created_at":"2026-05-18T00:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"6CRWBJUZ24TE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CRWBJUZ24TE2DJ4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CRWBJUZ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:20f8695fce05f3a734a94696ae7b1e2f3e402d8e87fb4ba46519c9972f9d11b6","target":"graph","created_at":"2026-05-18T00:16:34Z","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 study graph connectivity problem in MPC model. On an undirected graph with $n$ nodes and $m$ edges, $O(\\log n)$ round connectivity algorithms have been known for over 35 years. However, no algorithms with better complexity bounds were known. In this work, we give fully scalable, faster algorithms for the connectivity problem, by parameterizing the time complexity as a function of the diameter of the graph. Our main result is a $O(\\log D \\log\\log_{m/n} n)$ time connectivity algorithm for diameter-$D$ graphs, using $\\Theta(m)$ total memory. If our algorithm can use more memory, it can termina","authors_text":"Alexandr Andoni, Clifford Stein, Peilin Zhong, Zhao Song, Zhengyu Wang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T14:33:34Z","title":"Parallel Graph Connectivity in Log Diameter Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03055","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:23e96f39d49002a52653a11188afdb8534acadd7ad9d2cc92535e186ec81ddae","target":"record","created_at":"2026-05-18T00:16:34Z","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":"85543fa10200e440eead01fe90e02ff477f2db2112140415ba6fcb501765c727","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T14:33:34Z","title_canon_sha256":"d1e2b949c4d3631f1fca8ce3a7b3a534204e12495eb1e67e670d483377d53bd4"},"schema_version":"1.0","source":{"id":"1805.03055","kind":"arxiv","version":1}},"canonical_sha256":"f0a360a699d7264d0d3ccce831cfbda4fd1cd2092df18ce2780e5898b0527822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a360a699d7264d0d3ccce831cfbda4fd1cd2092df18ce2780e5898b0527822","first_computed_at":"2026-05-18T00:16:34.762809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:34.762809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iohNcvHiNCAnC8K6zsik4yWTihHQxNygRsjUav7EcyIikCHbRVBKdyN6klkfXwFXRtHLIiFo54MCNkh4mOWLDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:34.763358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23e96f39d49002a52653a11188afdb8534acadd7ad9d2cc92535e186ec81ddae","sha256:20f8695fce05f3a734a94696ae7b1e2f3e402d8e87fb4ba46519c9972f9d11b6"],"state_sha256":"3ac04e076b92cd7a368009662407ba865245648fd449e237c62f5c132a049cc1"}