{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CEONRCCFDZE7I6ZL24355TJUAA","short_pith_number":"pith:CEONRCCF","canonical_record":{"source":{"id":"1503.02353","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-09T01:16:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8302e16a08090afb1b5948645385381b066485df598bd5cf22fbf901474a5e2d","abstract_canon_sha256":"8d4c97e2ccdf8e1beb5700610b0f31aced8dd407b157a5ef907c3f4616a05a87"},"schema_version":"1.0"},"canonical_sha256":"111cd888451e49f47b2bd737decd3400226781b1005bfc1e4fce7a5094de603b","source":{"kind":"arxiv","id":"1503.02353","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02353","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02353v3","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02353","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"pith_short_12","alias_value":"CEONRCCFDZE7","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CEONRCCFDZE7I6ZL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CEONRCCF","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CEONRCCFDZE7I6ZL24355TJUAA","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02353","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-09T01:16:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8302e16a08090afb1b5948645385381b066485df598bd5cf22fbf901474a5e2d","abstract_canon_sha256":"8d4c97e2ccdf8e1beb5700610b0f31aced8dd407b157a5ef907c3f4616a05a87"},"schema_version":"1.0"},"canonical_sha256":"111cd888451e49f47b2bd737decd3400226781b1005bfc1e4fce7a5094de603b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:27.483198Z","signature_b64":"JcmQK+QxRB4TQ6yDm2hpe9c2RtxfBSKwBN57BJyZpBi7NCWH6LN3nXDQGF2GYVrPCezuyIayBlxPkWHZvJ5+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111cd888451e49f47b2bd737decd3400226781b1005bfc1e4fce7a5094de603b","last_reissued_at":"2026-05-18T01:11:27.482377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:27.482377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02353","source_version":3,"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-18T01:11:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30MQR6uc90Zqz1FgJrvfd4HaUrhTd0HA1RR+mwE0Jwhmn/f0elU6Mb9SMTMyjrUkIXIAHzovSu5xk3hwpd55BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:41.752188Z"},"content_sha256":"0e8a75397cade10376918b73d561608022fc73139b8ceba5440c4bb88aab9e38","schema_version":"1.0","event_id":"sha256:0e8a75397cade10376918b73d561608022fc73139b8ceba5440c4bb88aab9e38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CEONRCCFDZE7I6ZL24355TJUAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Distributed Algorithms for Connectivity and MST in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gopal Pandurangan, Michele Scquizzato, Peter Robinson","submitted_at":"2015-03-09T01:16:06Z","abstract_excerpt":"Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where $k \\geq 2$ machines jointly perform computations on graphs with $n$ nodes (typically, $n \\gg k$). The input graph is assumed to be initially randomly partitioned among the $k$ machines, a common implementation in many real-world systems. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation.\n  Our main result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02353","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":""},"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-18T01:11:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8odAzjqGANzOG6hbRgy7WQiBiln2+Sqc5gXpNKHRJYTPgRc0tz3oPpFE1vxbcx6m5u+IM1A7pMxSXcU7ucfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:01:41.752939Z"},"content_sha256":"6529eead7a300ab2e1b8557726329d167cfb427361dacbbe5d153b897e623d54","schema_version":"1.0","event_id":"sha256:6529eead7a300ab2e1b8557726329d167cfb427361dacbbe5d153b897e623d54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/bundle.json","state_url":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEONRCCFDZE7I6ZL24355TJUAA/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-11T10:01:41Z","links":{"resolver":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA","bundle":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/bundle.json","state":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEONRCCFDZE7I6ZL24355TJUAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CEONRCCFDZE7I6ZL24355TJUAA","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":"8d4c97e2ccdf8e1beb5700610b0f31aced8dd407b157a5ef907c3f4616a05a87","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-09T01:16:06Z","title_canon_sha256":"8302e16a08090afb1b5948645385381b066485df598bd5cf22fbf901474a5e2d"},"schema_version":"1.0","source":{"id":"1503.02353","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02353","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02353v3","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02353","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"pith_short_12","alias_value":"CEONRCCFDZE7","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CEONRCCFDZE7I6ZL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CEONRCCF","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:6529eead7a300ab2e1b8557726329d167cfb427361dacbbe5d153b897e623d54","target":"graph","created_at":"2026-05-18T01:11: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"},"paper":{"abstract_excerpt":"Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of fundamental graph problems in a message-passing model for distributed computing where $k \\geq 2$ machines jointly perform computations on graphs with $n$ nodes (typically, $n \\gg k$). The input graph is assumed to be initially randomly partitioned among the $k$ machines, a common implementation in many real-world systems. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation.\n  Our main result","authors_text":"Gopal Pandurangan, Michele Scquizzato, Peter Robinson","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-09T01:16:06Z","title":"Fast Distributed Algorithms for Connectivity and MST in Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02353","kind":"arxiv","version":3},"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:0e8a75397cade10376918b73d561608022fc73139b8ceba5440c4bb88aab9e38","target":"record","created_at":"2026-05-18T01:11: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":"8d4c97e2ccdf8e1beb5700610b0f31aced8dd407b157a5ef907c3f4616a05a87","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-09T01:16:06Z","title_canon_sha256":"8302e16a08090afb1b5948645385381b066485df598bd5cf22fbf901474a5e2d"},"schema_version":"1.0","source":{"id":"1503.02353","kind":"arxiv","version":3}},"canonical_sha256":"111cd888451e49f47b2bd737decd3400226781b1005bfc1e4fce7a5094de603b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"111cd888451e49f47b2bd737decd3400226781b1005bfc1e4fce7a5094de603b","first_computed_at":"2026-05-18T01:11:27.482377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:27.482377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JcmQK+QxRB4TQ6yDm2hpe9c2RtxfBSKwBN57BJyZpBi7NCWH6LN3nXDQGF2GYVrPCezuyIayBlxPkWHZvJ5+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:27.483198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02353","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e8a75397cade10376918b73d561608022fc73139b8ceba5440c4bb88aab9e38","sha256:6529eead7a300ab2e1b8557726329d167cfb427361dacbbe5d153b897e623d54"],"state_sha256":"c68a285432b4ae308f70bd5976b96b676805b238b1e89387f54362a74e5311ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMwIebo2yNvz/GId/T0XnnPbVIWua1k6ZPNSHcg59/q+abcH3pB1CD8U4I46rc/hxeqI2n4GSsDcikvzC1UJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:01:41.757286Z","bundle_sha256":"435cc094f01baa94bd68644fd8ca751f317e8aeacdb5e34fddab0f4394b9dfa7"}}