{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2SF5RAU6NANNIK2I76ICH5BG6I","short_pith_number":"pith:2SF5RAU6","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"},"canonical_sha256":"d48bd8829e681ad42b48ff9023f426f2320bf7e914e2aa27b5499fe3d971f748","source":{"kind":"arxiv","id":"2312.02332","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02332","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02332v4","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02332","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_12","alias_value":"2SF5RAU6NANN","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_16","alias_value":"2SF5RAU6NANNIK2I","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_8","alias_value":"2SF5RAU6","created_at":"2026-07-05T10:07:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2SF5RAU6NANNIK2I76ICH5BG6I","target":"record","payload":{"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"},"canonical_sha256":"d48bd8829e681ad42b48ff9023f426f2320bf7e914e2aa27b5499fe3d971f748","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"},"source_kind":"arxiv","source_id":"2312.02332","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:07:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgPexL/1KeYmkaki7N13v8KBFpCUehS/yVBHqN6J1XW1JDT1JrM5OFq5A6PgxQbZo6l5EPsUKHrke3XG8g3fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:11:29.293096Z"},"content_sha256":"08292cdbc93d931216f3e169f30df487026b246fd11bdf0f58235f45724a6413","schema_version":"1.0","event_id":"sha256:08292cdbc93d931216f3e169f30df487026b246fd11bdf0f58235f45724a6413"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2SF5RAU6NANNIK2I76ICH5BG6I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:07:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6EQuxxU/8SX43SaWzG9DrdNbJD57G6jtAklQMAkSR0gYs7lj3N3BDWRHPARukHVXR/dtHhALzlgVCSReG7gXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T22:11:29.293633Z"},"content_sha256":"3e4fcfdd3961cf0d4b652bda2fa009c426dea4f519626cc35d87dca4807ab2af","schema_version":"1.0","event_id":"sha256:3e4fcfdd3961cf0d4b652bda2fa009c426dea4f519626cc35d87dca4807ab2af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/bundle.json","state_url":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SF5RAU6NANNIK2I76ICH5BG6I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T22:11:29Z","links":{"resolver":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I","bundle":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/bundle.json","state":"https://pith.science/pith/2SF5RAU6NANNIK2I76ICH5BG6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SF5RAU6NANNIK2I76ICH5BG6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2SF5RAU6NANNIK2I76ICH5BG6I","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":"0619c6e6c7048e25056044e78f248310d581b64ea3a43412a25d03a2ad8fc6b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-04T20:33:54Z","title_canon_sha256":"ccd2e3b4e1369d4353fea78ff8429aa9bbddc0b0754626ff90969e657f71cd6a"},"schema_version":"1.0","source":{"id":"2312.02332","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02332","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02332v4","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02332","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_12","alias_value":"2SF5RAU6NANN","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_16","alias_value":"2SF5RAU6NANNIK2I","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_8","alias_value":"2SF5RAU6","created_at":"2026-07-05T10:07:00Z"}],"graph_snapshots":[{"event_id":"sha256:3e4fcfdd3961cf0d4b652bda2fa009c426dea4f519626cc35d87dca4807ab2af","target":"graph","created_at":"2026-07-05T10:07:00Z","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/2312.02332/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alireza Farhadi, Elaine Shi, S. Cliff Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-04T20:33:54Z","title":"Connected Components in Linear Work and Near-Optimal Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02332","kind":"arxiv","version":4},"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:08292cdbc93d931216f3e169f30df487026b246fd11bdf0f58235f45724a6413","target":"record","created_at":"2026-07-05T10:07:00Z","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":"0619c6e6c7048e25056044e78f248310d581b64ea3a43412a25d03a2ad8fc6b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-04T20:33:54Z","title_canon_sha256":"ccd2e3b4e1369d4353fea78ff8429aa9bbddc0b0754626ff90969e657f71cd6a"},"schema_version":"1.0","source":{"id":"2312.02332","kind":"arxiv","version":4}},"canonical_sha256":"d48bd8829e681ad42b48ff9023f426f2320bf7e914e2aa27b5499fe3d971f748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d48bd8829e681ad42b48ff9023f426f2320bf7e914e2aa27b5499fe3d971f748","first_computed_at":"2026-07-05T10:07:00.775539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:07:00.775539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LNj/9HDpMhdjeVOVc+7l0CaHOpTusGPaIDEcRSY5RD4+wXhGErKLCYqjNn4ulS86CQsGxGDuaa8b7TnC2JRoDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:07:00.775992Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.02332","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08292cdbc93d931216f3e169f30df487026b246fd11bdf0f58235f45724a6413","sha256:3e4fcfdd3961cf0d4b652bda2fa009c426dea4f519626cc35d87dca4807ab2af"],"state_sha256":"435cc54e3a76549b619dc2c97ff5810ea052c49c6916b7e5c0dad026baa70c71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTW8DXogIeZ8gzLnyq8t8yPEwLYw8br+K24fL79tnrwpecrYxIiZxgZX5+pSoGwCj+Ky3n+augtkLpdnGADlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T22:11:29.299966Z","bundle_sha256":"bb6e4314c6438ebf9302b6bd491ea26fde5e03842d9f9b0bb95e149cddaa5f93"}}