{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:V47ACXYIZYWWDJEPMI5PSWDCLZ","short_pith_number":"pith:V47ACXYI","schema_version":"1.0","canonical_sha256":"af3e015f08ce2d61a48f623af958625e5bc4d1cd7a7db8acb0c715baee3f0b8c","source":{"kind":"arxiv","id":"2003.00614","version":3},"attestation_state":"computed","paper":{"title":"Connected Components on a PRAM in Log Diameter Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Peilin Zhong, Robert E. Tarjan, S. Cliff Liu","submitted_at":"2020-03-02T00:00:11Z","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"},"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":"2003.00614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-02T00:00:11Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f226a06f31932029628cf62453f05427ef7304c9fd070d5374c1494357401a5e","abstract_canon_sha256":"ceeeb8c9b96c9766ab94bb13f3d48defccdb2ec734391c3a1c9c1c4ea01406eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:53.192560Z","signature_b64":"G5HfQlGtTONEOr93laKRBTCtEhMA3m7IHC6ULtfvSN0ttlaNx97jSTJ3XGBUYrl9l6PNV3ECApds/zyhGAMtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3e015f08ce2d61a48f623af958625e5bc4d1cd7a7db8acb0c715baee3f0b8c","last_reissued_at":"2026-07-05T02:33:53.192081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:53.192081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connected Components on a PRAM in Log Diameter Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Peilin Zhong, Robert E. Tarjan, S. Cliff Liu","submitted_at":"2020-03-02T00:00:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00614","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.00614/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2003.00614","created_at":"2026-07-05T02:33:53.192128+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.00614v3","created_at":"2026-07-05T02:33:53.192128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00614","created_at":"2026-07-05T02:33:53.192128+00:00"},{"alias_kind":"pith_short_12","alias_value":"V47ACXYIZYWW","created_at":"2026-07-05T02:33:53.192128+00:00"},{"alias_kind":"pith_short_16","alias_value":"V47ACXYIZYWWDJEP","created_at":"2026-07-05T02:33:53.192128+00:00"},{"alias_kind":"pith_short_8","alias_value":"V47ACXYI","created_at":"2026-07-05T02:33:53.192128+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/V47ACXYIZYWWDJEPMI5PSWDCLZ","json":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ.json","graph_json":"https://pith.science/api/pith-number/V47ACXYIZYWWDJEPMI5PSWDCLZ/graph.json","events_json":"https://pith.science/api/pith-number/V47ACXYIZYWWDJEPMI5PSWDCLZ/events.json","paper":"https://pith.science/paper/V47ACXYI"},"agent_actions":{"view_html":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ","download_json":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ.json","view_paper":"https://pith.science/paper/V47ACXYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.00614&json=true","fetch_graph":"https://pith.science/api/pith-number/V47ACXYIZYWWDJEPMI5PSWDCLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/V47ACXYIZYWWDJEPMI5PSWDCLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ/action/storage_attestation","attest_author":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ/action/author_attestation","sign_citation":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ/action/citation_signature","submit_replication":"https://pith.science/pith/V47ACXYIZYWWDJEPMI5PSWDCLZ/action/replication_record"}},"created_at":"2026-07-05T02:33:53.192128+00:00","updated_at":"2026-07-05T02:33:53.192128+00:00"}