{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:V47ACXYIZYWWDJEPMI5PSWDCLZ","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":"ceeeb8c9b96c9766ab94bb13f3d48defccdb2ec734391c3a1c9c1c4ea01406eb","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T00:00:11Z","title_canon_sha256":"f226a06f31932029628cf62453f05427ef7304c9fd070d5374c1494357401a5e"},"schema_version":"1.0","source":{"id":"2003.00614","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.00614","created_at":"2026-07-05T02:33:53Z"},{"alias_kind":"arxiv_version","alias_value":"2003.00614v3","created_at":"2026-07-05T02:33:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00614","created_at":"2026-07-05T02:33:53Z"},{"alias_kind":"pith_short_12","alias_value":"V47ACXYIZYWW","created_at":"2026-07-05T02:33:53Z"},{"alias_kind":"pith_short_16","alias_value":"V47ACXYIZYWWDJEP","created_at":"2026-07-05T02:33:53Z"},{"alias_kind":"pith_short_8","alias_value":"V47ACXYI","created_at":"2026-07-05T02:33:53Z"}],"graph_snapshots":[{"event_id":"sha256:986eeb48927e9c7c467d76cd4e023e3d23df72930173d3c7bca8f00894cc3aa2","target":"graph","created_at":"2026-07-05T02:33:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.00614/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an $O(\\log d + \\log\\log_{m/n} n)$-time randomized PRAM algorithm for computing the connected components of an $n$-vertex, $m$-edge undirected graph with maximum component diameter $d$. The algorithm runs on an ARBITRARY CRCW (concurrent-read, concurrent-write with arbitrary write resolution) PRAM using $O(m)$ processors. The time bound holds with good probability.\n  Our algorithm is based on the breakthrough results of Andoni et al. [FOCS'18] and Behnezhad et al. [FOCS'19]. Their algorithms run on the more powerful MPC model and rely on sorting and computing prefix sums in $O(1)$ ti","authors_text":"Peilin Zhong, Robert E. Tarjan, S. Cliff Liu","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T00:00:11Z","title":"Connected Components on a PRAM in Log Diameter Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00614","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:174aba9d78df0ae771dbb822db1124348d9b3aa7f138b1f1684101d03802b8fb","target":"record","created_at":"2026-07-05T02:33:53Z","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":"ceeeb8c9b96c9766ab94bb13f3d48defccdb2ec734391c3a1c9c1c4ea01406eb","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T00:00:11Z","title_canon_sha256":"f226a06f31932029628cf62453f05427ef7304c9fd070d5374c1494357401a5e"},"schema_version":"1.0","source":{"id":"2003.00614","kind":"arxiv","version":3}},"canonical_sha256":"af3e015f08ce2d61a48f623af958625e5bc4d1cd7a7db8acb0c715baee3f0b8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af3e015f08ce2d61a48f623af958625e5bc4d1cd7a7db8acb0c715baee3f0b8c","first_computed_at":"2026-07-05T02:33:53.192081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:33:53.192081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G5HfQlGtTONEOr93laKRBTCtEhMA3m7IHC6ULtfvSN0ttlaNx97jSTJ3XGBUYrl9l6PNV3ECApds/zyhGAMtAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:33:53.192560Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.00614","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:174aba9d78df0ae771dbb822db1124348d9b3aa7f138b1f1684101d03802b8fb","sha256:986eeb48927e9c7c467d76cd4e023e3d23df72930173d3c7bca8f00894cc3aa2"],"state_sha256":"f6d70d6029a1d916bcdbbdf50bd45ba3beff7ec5aa68847bde51cc61ea822478"}