{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2SF5RAU6NANNIK2I76ICH5BG6I","short_pith_number":"pith:2SF5RAU6","schema_version":"1.0","canonical_sha256":"d48bd8829e681ad42b48ff9023f426f2320bf7e914e2aa27b5499fe3d971f748","source":{"kind":"arxiv","id":"2312.02332","version":4},"attestation_state":"computed","paper":{"title":"Connected Components in Linear Work and Near-Optimal Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alireza Farhadi, Elaine Shi, S. Cliff Liu","submitted_at":"2023-12-04T20:33:54Z","abstract_excerpt":"Computing the connected components of a graph is a fundamental problem in algorithmic graph theory. A major question in this area is whether we can compute connected components in $o(\\log n)$ parallel time. Recent works showed an affirmative answer in the Massively Parallel Computation (MPC) model for a wide class of graphs. Specifically, Behnezhad et al. (FOCS'19) showed that connected components can be computed in $O(\\log d + \\log \\log n)$ rounds in the MPC model. More recently, Liu et al. (SPAA'20) showed that the same result can be achieved in the standard PRAM model but their result incur"},"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":"2312.02332","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-04T20:33:54Z","cross_cats_sorted":[],"title_canon_sha256":"ccd2e3b4e1369d4353fea78ff8429aa9bbddc0b0754626ff90969e657f71cd6a","abstract_canon_sha256":"0619c6e6c7048e25056044e78f248310d581b64ea3a43412a25d03a2ad8fc6b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:00.775992Z","signature_b64":"LNj/9HDpMhdjeVOVc+7l0CaHOpTusGPaIDEcRSY5RD4+wXhGErKLCYqjNn4ulS86CQsGxGDuaa8b7TnC2JRoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d48bd8829e681ad42b48ff9023f426f2320bf7e914e2aa27b5499fe3d971f748","last_reissued_at":"2026-07-05T10:07:00.775539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:00.775539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connected Components in Linear Work and Near-Optimal Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alireza Farhadi, Elaine Shi, S. Cliff Liu","submitted_at":"2023-12-04T20:33:54Z","abstract_excerpt":"Computing the connected components of a graph is a fundamental problem in algorithmic graph theory. A major question in this area is whether we can compute connected components in $o(\\log n)$ parallel time. Recent works showed an affirmative answer in the Massively Parallel Computation (MPC) model for a wide class of graphs. Specifically, Behnezhad et al. (FOCS'19) showed that connected components can be computed in $O(\\log d + \\log \\log n)$ rounds in the MPC model. More recently, Liu et al. (SPAA'20) showed that the same result can be achieved in the standard PRAM model but their result incur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02332","kind":"arxiv","version":4},"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/2312.02332/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":"2312.02332","created_at":"2026-07-05T10:07:00.775598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.02332v4","created_at":"2026-07-05T10:07:00.775598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02332","created_at":"2026-07-05T10:07:00.775598+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SF5RAU6NANN","created_at":"2026-07-05T10:07:00.775598+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SF5RAU6NANNIK2I","created_at":"2026-07-05T10:07:00.775598+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SF5RAU6","created_at":"2026-07-05T10:07:00.775598+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/2SF5RAU6NANNIK2I76ICH5BG6I","json":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I.json","graph_json":"https://pith.science/api/pith-number/2SF5RAU6NANNIK2I76ICH5BG6I/graph.json","events_json":"https://pith.science/api/pith-number/2SF5RAU6NANNIK2I76ICH5BG6I/events.json","paper":"https://pith.science/paper/2SF5RAU6"},"agent_actions":{"view_html":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I","download_json":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I.json","view_paper":"https://pith.science/paper/2SF5RAU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.02332&json=true","fetch_graph":"https://pith.science/api/pith-number/2SF5RAU6NANNIK2I76ICH5BG6I/graph.json","fetch_events":"https://pith.science/api/pith-number/2SF5RAU6NANNIK2I76ICH5BG6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/action/storage_attestation","attest_author":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/action/author_attestation","sign_citation":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/action/citation_signature","submit_replication":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/action/replication_record"}},"created_at":"2026-07-05T10:07:00.775598+00:00","updated_at":"2026-07-05T10:07:00.775598+00:00"}