{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JYHHZH7VQTQFCKY3PUO3FMC6SQ","short_pith_number":"pith:JYHHZH7V","canonical_record":{"source":{"id":"1805.02974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T12:29:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c3883836fd8733d5e98022f05a7c11c53c59a3c1e89bd23f79e531f402690866","abstract_canon_sha256":"ddae6b516ccc746c7d0d9cca604e1ecbb11c9cd8f1aaaee7f25179d75bc4871e"},"schema_version":"1.0"},"canonical_sha256":"4e0e7c9ff584e0512b1b7d1db2b05e940db185d0a0d549a85ceb1bad2ab7ad23","source":{"kind":"arxiv","id":"1805.02974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02974","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02974v1","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02974","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"JYHHZH7VQTQF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JYHHZH7VQTQFCKY3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JYHHZH7V","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JYHHZH7VQTQFCKY3PUO3FMC6SQ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T12:29:21Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c3883836fd8733d5e98022f05a7c11c53c59a3c1e89bd23f79e531f402690866","abstract_canon_sha256":"ddae6b516ccc746c7d0d9cca604e1ecbb11c9cd8f1aaaee7f25179d75bc4871e"},"schema_version":"1.0"},"canonical_sha256":"4e0e7c9ff584e0512b1b7d1db2b05e940db185d0a0d549a85ceb1bad2ab7ad23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:35.063627Z","signature_b64":"EU6kx8xd2kaqFPjooEy3UZ3i2rny0MhScI6mmE91h5LQAz43sM0JbD+vSqFHaJxHxd7oqPw9jfMUHkv3ANa5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e0e7c9ff584e0512b1b7d1db2b05e940db185d0a0d549a85ceb1bad2ab7ad23","last_reissued_at":"2026-05-18T00:16:35.063028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:35.063028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02974","source_version":1,"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-05-18T00:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mv46E8FvIEzF2YYpNQIHaFFj2QXftdvaSD7PwjLyWYeHuBAvs56PMyBS+HA0CS9Bo2i02xo4AjNxIDh5WHw+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:39:33.482421Z"},"content_sha256":"6c54b2558fc027f93c619b45ebd7b387e28074e7a96e3bac22ccb637d05489f0","schema_version":"1.0","event_id":"sha256:6c54b2558fc027f93c619b45ebd7b387e28074e7a96e3bac22ccb637d05489f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JYHHZH7VQTQFCKY3PUO3FMC6SQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Omri Weinstein, Sepehr Assadi, Xiaorui Sun","submitted_at":"2018-05-08T12:29:21Z","abstract_excerpt":"A fundamental question that shrouds the emergence of massively parallel computing (MPC) platforms is how can the additional power of the MPC paradigm be leveraged to achieve faster algorithms compared to classical parallel models such as PRAM?\n  Previous research has identified the sparse graph connectivity problem as a major obstacle to such improvement: While classical logarithmic-round PRAM algorithms for finding connected components in any $n$-vertex graph have been known for more than three decades, no $o(\\log{n})$-round MPC algorithms are known for this task with truly sublinear in $n$ m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02974","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzG3CBf0tvTATIpTuWUED7vDqcfMe9VIjQNrDmDv57610ZtgexnhF1+QL6ZfKj3xicWUTUOdYN5U6y46pl+kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:39:33.482793Z"},"content_sha256":"2bbe9ab986b17741c83017d5b443d36ad23e00bd864dda2aa0fd99b8ecf36c46","schema_version":"1.0","event_id":"sha256:2bbe9ab986b17741c83017d5b443d36ad23e00bd864dda2aa0fd99b8ecf36c46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYHHZH7VQTQFCKY3PUO3FMC6SQ/bundle.json","state_url":"https://pith.science/pith/JYHHZH7VQTQFCKY3PUO3FMC6SQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYHHZH7VQTQFCKY3PUO3FMC6SQ/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-06-06T18:39:33Z","links":{"resolver":"https://pith.science/pith/JYHHZH7VQTQFCKY3PUO3FMC6SQ","bundle":"https://pith.science/pith/JYHHZH7VQTQFCKY3PUO3FMC6SQ/bundle.json","state":"https://pith.science/pith/JYHHZH7VQTQFCKY3PUO3FMC6SQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYHHZH7VQTQFCKY3PUO3FMC6SQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JYHHZH7VQTQFCKY3PUO3FMC6SQ","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":"ddae6b516ccc746c7d0d9cca604e1ecbb11c9cd8f1aaaee7f25179d75bc4871e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T12:29:21Z","title_canon_sha256":"c3883836fd8733d5e98022f05a7c11c53c59a3c1e89bd23f79e531f402690866"},"schema_version":"1.0","source":{"id":"1805.02974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02974","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02974v1","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02974","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"JYHHZH7VQTQF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JYHHZH7VQTQFCKY3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JYHHZH7V","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:2bbe9ab986b17741c83017d5b443d36ad23e00bd864dda2aa0fd99b8ecf36c46","target":"graph","created_at":"2026-05-18T00:16:35Z","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"},"paper":{"abstract_excerpt":"A fundamental question that shrouds the emergence of massively parallel computing (MPC) platforms is how can the additional power of the MPC paradigm be leveraged to achieve faster algorithms compared to classical parallel models such as PRAM?\n  Previous research has identified the sparse graph connectivity problem as a major obstacle to such improvement: While classical logarithmic-round PRAM algorithms for finding connected components in any $n$-vertex graph have been known for more than three decades, no $o(\\log{n})$-round MPC algorithms are known for this task with truly sublinear in $n$ m","authors_text":"Omri Weinstein, Sepehr Assadi, Xiaorui Sun","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T12:29:21Z","title":"Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02974","kind":"arxiv","version":1},"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:6c54b2558fc027f93c619b45ebd7b387e28074e7a96e3bac22ccb637d05489f0","target":"record","created_at":"2026-05-18T00:16:35Z","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":"ddae6b516ccc746c7d0d9cca604e1ecbb11c9cd8f1aaaee7f25179d75bc4871e","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-08T12:29:21Z","title_canon_sha256":"c3883836fd8733d5e98022f05a7c11c53c59a3c1e89bd23f79e531f402690866"},"schema_version":"1.0","source":{"id":"1805.02974","kind":"arxiv","version":1}},"canonical_sha256":"4e0e7c9ff584e0512b1b7d1db2b05e940db185d0a0d549a85ceb1bad2ab7ad23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e0e7c9ff584e0512b1b7d1db2b05e940db185d0a0d549a85ceb1bad2ab7ad23","first_computed_at":"2026-05-18T00:16:35.063028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:35.063028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EU6kx8xd2kaqFPjooEy3UZ3i2rny0MhScI6mmE91h5LQAz43sM0JbD+vSqFHaJxHxd7oqPw9jfMUHkv3ANa5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:35.063627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c54b2558fc027f93c619b45ebd7b387e28074e7a96e3bac22ccb637d05489f0","sha256:2bbe9ab986b17741c83017d5b443d36ad23e00bd864dda2aa0fd99b8ecf36c46"],"state_sha256":"77551399409ac6ae419951dfa54b7fefcb692dbea10e945a28af5df8a17afa17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELBn+5ZmJxj/u8QWUvqXYi0W44Yyau10j3M4RQFpc5Aqr5vxk/xy4y6xsV1D4WcxpyIu4NFT7eg61cw4HdJIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:39:33.484668Z","bundle_sha256":"3c780707af9212dacf4564ff387176c91f0b61c0e481ad8865ce13c5c624bf8e"}}