{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GLXASRSQERX74Q3BPXAPFVU4OE","short_pith_number":"pith:GLXASRSQ","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"},"canonical_sha256":"32ee094650246ffe43617dc0f2d69c71027f044a40b43bc324fc12bfd4ffa654","source":{"kind":"arxiv","id":"1602.08481","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08481v7","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"GLXASRSQERX7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GLXASRSQERX74Q3B","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GLXASRSQ","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GLXASRSQERX74Q3BPXAPFVU4OE","target":"record","payload":{"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"},"canonical_sha256":"32ee094650246ffe43617dc0f2d69c71027f044a40b43bc324fc12bfd4ffa654","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"},"source_kind":"arxiv","source_id":"1602.08481","source_version":7,"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:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tohoco0RGIJ3Sdf/YTOzDRkzjtYEUihijNLjNVpX2JSZawD93uM00NRC+MsvOZSCC5SFwLFVLWFtKQVoOLd+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:07:04.882254Z"},"content_sha256":"f03c53184e26593969f55ff441ab1933593a15391db7a78338b9ae6a5bd885e6","schema_version":"1.0","event_id":"sha256:f03c53184e26593969f55ff441ab1933593a15391db7a78338b9ae6a5bd885e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GLXASRSQERX74Q3BPXAPFVU4OE","target":"graph","payload":{"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"},"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:09:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jvHGN7wnySI4aIO1pyNCjEdppp2Sknun6NcRTimGcfqklbPh1wf43YAO9EncbgboqfBusp0iX8y5/NHrGRvCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:07:04.882633Z"},"content_sha256":"2763a6949a0f48d14a9ea1b677a1ba8c7151388bdfc9113ea46c5e0808efd8fc","schema_version":"1.0","event_id":"sha256:2763a6949a0f48d14a9ea1b677a1ba8c7151388bdfc9113ea46c5e0808efd8fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/bundle.json","state_url":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLXASRSQERX74Q3BPXAPFVU4OE/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-11T22:07:04Z","links":{"resolver":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE","bundle":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/bundle.json","state":"https://pith.science/pith/GLXASRSQERX74Q3BPXAPFVU4OE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLXASRSQERX74Q3BPXAPFVU4OE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GLXASRSQERX74Q3BPXAPFVU4OE","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":"a2f27dabe6907bfdefeff7a73c8924d389686ee26300c4bb9ce518953f73a8ed","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T20:57:30Z","title_canon_sha256":"8393d2114b69002b360b593e2c1e19cd137abd7f1e9ae6c025bd62b28cffaa15"},"schema_version":"1.0","source":{"id":"1602.08481","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08481v7","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08481","created_at":"2026-05-18T00:09:48Z"},{"alias_kind":"pith_short_12","alias_value":"GLXASRSQERX7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GLXASRSQERX74Q3B","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GLXASRSQ","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2763a6949a0f48d14a9ea1b677a1ba8c7151388bdfc9113ea46c5e0808efd8fc","target":"graph","created_at":"2026-05-18T00:09:48Z","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 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","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":"2016-02-26T20:57:30Z","title":"On the Distributed Complexity of Large-Scale Graph Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08481","kind":"arxiv","version":7},"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:f03c53184e26593969f55ff441ab1933593a15391db7a78338b9ae6a5bd885e6","target":"record","created_at":"2026-05-18T00:09:48Z","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":"a2f27dabe6907bfdefeff7a73c8924d389686ee26300c4bb9ce518953f73a8ed","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-26T20:57:30Z","title_canon_sha256":"8393d2114b69002b360b593e2c1e19cd137abd7f1e9ae6c025bd62b28cffaa15"},"schema_version":"1.0","source":{"id":"1602.08481","kind":"arxiv","version":7}},"canonical_sha256":"32ee094650246ffe43617dc0f2d69c71027f044a40b43bc324fc12bfd4ffa654","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32ee094650246ffe43617dc0f2d69c71027f044a40b43bc324fc12bfd4ffa654","first_computed_at":"2026-05-18T00:09:48.086033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:48.086033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zKxRef4T/3qxizHNB7PKEix0WfcW44hX+8TmJf8bsXvZLDS9hZ9DozY58m1TN4XXzO6qt+x0RTOn06JSTDPADw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:48.086745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08481","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f03c53184e26593969f55ff441ab1933593a15391db7a78338b9ae6a5bd885e6","sha256:2763a6949a0f48d14a9ea1b677a1ba8c7151388bdfc9113ea46c5e0808efd8fc"],"state_sha256":"08db8c55fdb31a8c250ebcc105648241f4ac30cbd061173756185f582b19f49b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxPgIwIwhf2dWq7t0xvRC2PT12ZYNE6kdxD+YJfDd2esBHCdBzsZTkiDZG4heir4JwVJm1xcIpo2oa85i4+PDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:07:04.885154Z","bundle_sha256":"c3dfa74735667aed607e97041e6e15a5d2a8a07d7a609781deb0148ff45c84d2"}}