{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CEONRCCFDZE7I6ZL24355TJUAA","short_pith_number":"pith:CEONRCCF","schema_version":"1.0","canonical_sha256":"111cd888451e49f47b2bd737decd3400226781b1005bfc1e4fce7a5094de603b","source":{"kind":"arxiv","id":"1503.02353","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.02353","created_at":"2026-05-18T01:11:27.482519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02353v3","created_at":"2026-05-18T01:11:27.482519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02353","created_at":"2026-05-18T01:11:27.482519+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEONRCCFDZE7","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEONRCCFDZE7I6ZL","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEONRCCF","created_at":"2026-05-18T12:29:14.074870+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/CEONRCCFDZE7I6ZL24355TJUAA","json":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA.json","graph_json":"https://pith.science/api/pith-number/CEONRCCFDZE7I6ZL24355TJUAA/graph.json","events_json":"https://pith.science/api/pith-number/CEONRCCFDZE7I6ZL24355TJUAA/events.json","paper":"https://pith.science/paper/CEONRCCF"},"agent_actions":{"view_html":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA","download_json":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA.json","view_paper":"https://pith.science/paper/CEONRCCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02353&json=true","fetch_graph":"https://pith.science/api/pith-number/CEONRCCFDZE7I6ZL24355TJUAA/graph.json","fetch_events":"https://pith.science/api/pith-number/CEONRCCFDZE7I6ZL24355TJUAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/action/storage_attestation","attest_author":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/action/author_attestation","sign_citation":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/action/citation_signature","submit_replication":"https://pith.science/pith/CEONRCCFDZE7I6ZL24355TJUAA/action/replication_record"}},"created_at":"2026-05-18T01:11:27.482519+00:00","updated_at":"2026-05-18T01:11:27.482519+00:00"}