{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JKHUGCXCLPTUDMZU3XYLWSDQOZ","short_pith_number":"pith:JKHUGCXC","canonical_record":{"source":{"id":"1910.05385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T19:51:13Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"85e58ae30b5f11f00053e32f14b081616c7084677e42c4782f540fefb45da884","abstract_canon_sha256":"16858f33b538337d5e96777829f1668d74fd3cda20cebd5bfa8a6b07fff2e029"},"schema_version":"1.0"},"canonical_sha256":"4a8f430ae25be741b334ddf0bb4870767cd04209ace594a8cb0fa0d6465b3975","source":{"kind":"arxiv","id":"1910.05385","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.05385","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"1910.05385v2","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05385","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"JKHUGCXCLPTU","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"pith_short_16","alias_value":"JKHUGCXCLPTUDMZU","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"pith_short_8","alias_value":"JKHUGCXC","created_at":"2026-07-05T00:47:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JKHUGCXCLPTUDMZU3XYLWSDQOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1910.05385","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T19:51:13Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"85e58ae30b5f11f00053e32f14b081616c7084677e42c4782f540fefb45da884","abstract_canon_sha256":"16858f33b538337d5e96777829f1668d74fd3cda20cebd5bfa8a6b07fff2e029"},"schema_version":"1.0"},"canonical_sha256":"4a8f430ae25be741b334ddf0bb4870767cd04209ace594a8cb0fa0d6465b3975","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:27.875006Z","signature_b64":"GP4E6vTYQM2DwGws9K6MRij1YLycoU/ixI9WmvncDEpvR/Y5ZnwOpHYHh73IjIQrtxrBliWDLyaD18/+sM/YAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a8f430ae25be741b334ddf0bb4870767cd04209ace594a8cb0fa0d6465b3975","last_reissued_at":"2026-07-05T00:47:27.874572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:27.874572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.05385","source_version":2,"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-05T00:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnOzh6++u8FYE/VmSiHRwXA9phGUyVZQSeBfysvB/KJNebJBmfZTcgnLsENGBfZFhNp346Yqn/nuZwrDbHSrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:48:28.388178Z"},"content_sha256":"c2ac3a62e2bbeffa70068f791db662298ad6c53d77acec36e1445533423b56c7","schema_version":"1.0","event_id":"sha256:c2ac3a62e2bbeffa70068f791db662298ad6c53d77acec36e1445533423b56c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JKHUGCXCLPTUDMZU3XYLWSDQOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Massively Parallel Graph Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, Jakub {\\L}\\k{a}cki, Laxman Dhulipala, Soheil Behnezhad, Vahab Mirrokni","submitted_at":"2019-10-11T19:51:13Z","abstract_excerpt":"Identifying the connected components of a graph, apart from being a fundamental problem with countless applications, is a key primitive for many other algorithms. In this paper, we consider this problem in parallel settings. Particularly, we focus on the Massively Parallel Computations (MPC) model, which is the standard theoretical model for modern parallel frameworks such as MapReduce, Hadoop, or Spark. We consider the truly sublinear regime of MPC for graph problems where the space per machine is $n^\\delta$ for some desirably small constant $\\delta \\in (0, 1)$.\n  We present an algorithm that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05385","kind":"arxiv","version":2},"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/1910.05385/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-05T00:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vrCFSae489xaE+gbrHPTnGrbnSkdWNAKKbZZ9Kc2N7vnnx5asIPIFWVmVfHEfArTn4UV6gXkRmZl8amN0DFuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:48:28.388843Z"},"content_sha256":"1d0aea0751bb8c1aa3b94e9e7e16b142a72bdd42b40c4bed0512900717c5615d","schema_version":"1.0","event_id":"sha256:1d0aea0751bb8c1aa3b94e9e7e16b142a72bdd42b40c4bed0512900717c5615d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKHUGCXCLPTUDMZU3XYLWSDQOZ/bundle.json","state_url":"https://pith.science/pith/JKHUGCXCLPTUDMZU3XYLWSDQOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKHUGCXCLPTUDMZU3XYLWSDQOZ/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-07-05T15:48:28Z","links":{"resolver":"https://pith.science/pith/JKHUGCXCLPTUDMZU3XYLWSDQOZ","bundle":"https://pith.science/pith/JKHUGCXCLPTUDMZU3XYLWSDQOZ/bundle.json","state":"https://pith.science/pith/JKHUGCXCLPTUDMZU3XYLWSDQOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKHUGCXCLPTUDMZU3XYLWSDQOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JKHUGCXCLPTUDMZU3XYLWSDQOZ","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":"16858f33b538337d5e96777829f1668d74fd3cda20cebd5bfa8a6b07fff2e029","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T19:51:13Z","title_canon_sha256":"85e58ae30b5f11f00053e32f14b081616c7084677e42c4782f540fefb45da884"},"schema_version":"1.0","source":{"id":"1910.05385","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.05385","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"1910.05385v2","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05385","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"JKHUGCXCLPTU","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"pith_short_16","alias_value":"JKHUGCXCLPTUDMZU","created_at":"2026-07-05T00:47:27Z"},{"alias_kind":"pith_short_8","alias_value":"JKHUGCXC","created_at":"2026-07-05T00:47:27Z"}],"graph_snapshots":[{"event_id":"sha256:1d0aea0751bb8c1aa3b94e9e7e16b142a72bdd42b40c4bed0512900717c5615d","target":"graph","created_at":"2026-07-05T00:47:27Z","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/1910.05385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Identifying the connected components of a graph, apart from being a fundamental problem with countless applications, is a key primitive for many other algorithms. In this paper, we consider this problem in parallel settings. Particularly, we focus on the Massively Parallel Computations (MPC) model, which is the standard theoretical model for modern parallel frameworks such as MapReduce, Hadoop, or Spark. We consider the truly sublinear regime of MPC for graph problems where the space per machine is $n^\\delta$ for some desirably small constant $\\delta \\in (0, 1)$.\n  We present an algorithm that","authors_text":"Hossein Esfandiari, Jakub {\\L}\\k{a}cki, Laxman Dhulipala, Soheil Behnezhad, Vahab Mirrokni","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T19:51:13Z","title":"Near-Optimal Massively Parallel Graph Connectivity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05385","kind":"arxiv","version":2},"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:c2ac3a62e2bbeffa70068f791db662298ad6c53d77acec36e1445533423b56c7","target":"record","created_at":"2026-07-05T00:47:27Z","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":"16858f33b538337d5e96777829f1668d74fd3cda20cebd5bfa8a6b07fff2e029","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-11T19:51:13Z","title_canon_sha256":"85e58ae30b5f11f00053e32f14b081616c7084677e42c4782f540fefb45da884"},"schema_version":"1.0","source":{"id":"1910.05385","kind":"arxiv","version":2}},"canonical_sha256":"4a8f430ae25be741b334ddf0bb4870767cd04209ace594a8cb0fa0d6465b3975","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a8f430ae25be741b334ddf0bb4870767cd04209ace594a8cb0fa0d6465b3975","first_computed_at":"2026-07-05T00:47:27.874572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:47:27.874572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GP4E6vTYQM2DwGws9K6MRij1YLycoU/ixI9WmvncDEpvR/Y5ZnwOpHYHh73IjIQrtxrBliWDLyaD18/+sM/YAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:47:27.875006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.05385","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2ac3a62e2bbeffa70068f791db662298ad6c53d77acec36e1445533423b56c7","sha256:1d0aea0751bb8c1aa3b94e9e7e16b142a72bdd42b40c4bed0512900717c5615d"],"state_sha256":"78cb1fd4fc5f595ae7699ad8b8f9a4d253b9f480797d38da39b24b88cd59eef2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rtZ5nIe4n57LdOFchJ713F7SgWQXXTVzwHA3AdPV02etoOobC+dr22hahJYd96lfFZKKZNO1mxhJfAx9WOjoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:48:28.392137Z","bundle_sha256":"2ebaee77119d1c6940007976bbe756e6ca5b06267d3144519edca1bd4283d830"}}