{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GLXASRSQERX74Q3BPXAPFVU4OE","short_pith_number":"pith:GLXASRSQ","schema_version":"1.0","canonical_sha256":"32ee094650246ffe43617dc0f2d69c71027f044a40b43bc324fc12bfd4ffa654","source":{"kind":"arxiv","id":"1602.08481","version":7},"attestation_state":"computed","paper":{"title":"On the Distributed Complexity of Large-Scale Graph Computations","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":"2016-02-26T20:57:30Z","abstract_excerpt":"Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some 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 {\\em rounds} of the computation.\n  Our main contrib"},"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":"1602.08481","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T20:57:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8393d2114b69002b360b593e2c1e19cd137abd7f1e9ae6c025bd62b28cffaa15","abstract_canon_sha256":"a2f27dabe6907bfdefeff7a73c8924d389686ee26300c4bb9ce518953f73a8ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:48.086745Z","signature_b64":"zKxRef4T/3qxizHNB7PKEix0WfcW44hX+8TmJf8bsXvZLDS9hZ9DozY58m1TN4XXzO6qt+x0RTOn06JSTDPADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32ee094650246ffe43617dc0f2d69c71027f044a40b43bc324fc12bfd4ffa654","last_reissued_at":"2026-05-18T00:09:48.086033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:48.086033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Distributed Complexity of Large-Scale Graph Computations","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":"2016-02-26T20:57:30Z","abstract_excerpt":"Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some 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 {\\em rounds} of the computation.\n  Our main contrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08481","kind":"arxiv","version":7},"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":"1602.08481","created_at":"2026-05-18T00:09:48.086146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08481v7","created_at":"2026-05-18T00:09:48.086146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08481","created_at":"2026-05-18T00:09:48.086146+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLXASRSQERX7","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLXASRSQERX74Q3B","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLXASRSQ","created_at":"2026-05-18T12:30:19.053100+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/GLXASRSQERX74Q3BPXAPFVU4OE","json":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE.json","graph_json":"https://pith.science/api/pith-number/GLXASRSQERX74Q3BPXAPFVU4OE/graph.json","events_json":"https://pith.science/api/pith-number/GLXASRSQERX74Q3BPXAPFVU4OE/events.json","paper":"https://pith.science/paper/GLXASRSQ"},"agent_actions":{"view_html":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE","download_json":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE.json","view_paper":"https://pith.science/paper/GLXASRSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08481&json=true","fetch_graph":"https://pith.science/api/pith-number/GLXASRSQERX74Q3BPXAPFVU4OE/graph.json","fetch_events":"https://pith.science/api/pith-number/GLXASRSQERX74Q3BPXAPFVU4OE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/action/storage_attestation","attest_author":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/action/author_attestation","sign_citation":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/action/citation_signature","submit_replication":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/action/replication_record"}},"created_at":"2026-05-18T00:09:48.086146+00:00","updated_at":"2026-05-18T00:09:48.086146+00:00"}