{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PPKRPD6H7ZBDZK6MUWEDKZDDRL","short_pith_number":"pith:PPKRPD6H","canonical_record":{"source":{"id":"1209.1076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-09-05T18:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"0d9c0686c3db48c4e76358ab893da89b186d412ff06f7c1d6e79dbb2035d0b89","abstract_canon_sha256":"573c3f89ef3fa0ebd40fcb96187625c74b1e4abf15619a715b0bf628e0c009ce"},"schema_version":"1.0"},"canonical_sha256":"7bd5178fc7fe423cabcca5883564638af52a85dd628aae25c948bbb1bea7d918","source":{"kind":"arxiv","id":"1209.1076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1076","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1076v1","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1076","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"PPKRPD6H7ZBD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PPKRPD6H7ZBDZK6M","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PPKRPD6H","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PPKRPD6H7ZBDZK6MUWEDKZDDRL","target":"record","payload":{"canonical_record":{"source":{"id":"1209.1076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-09-05T18:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"0d9c0686c3db48c4e76358ab893da89b186d412ff06f7c1d6e79dbb2035d0b89","abstract_canon_sha256":"573c3f89ef3fa0ebd40fcb96187625c74b1e4abf15619a715b0bf628e0c009ce"},"schema_version":"1.0"},"canonical_sha256":"7bd5178fc7fe423cabcca5883564638af52a85dd628aae25c948bbb1bea7d918","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:15.546764Z","signature_b64":"Xdpflg85D/6bGhMvmWz6DMOQT7xQArsiPZqUAPQaYFmGtdQVwrqcDVW76WGSDRti/dfmSi8mIWbcEDCfvk4oDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bd5178fc7fe423cabcca5883564638af52a85dd628aae25c948bbb1bea7d918","last_reissued_at":"2026-05-18T03:46:15.546235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:15.546235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.1076","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-18T03:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RoEwUJhXIOEGkqR0P1LT4EN7PlH+zpH0rz+Vh1dPyiKTs63smWO/JCMSHYzCx/mhCGt4xA1Iq/XhrTTl+o7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:02:39.941547Z"},"content_sha256":"1e444a3f1452cbc9c25d9fdfb3d9235a01c2153fc2983e1d9f0c068f2d2c42e3","schema_version":"1.0","event_id":"sha256:1e444a3f1452cbc9c25d9fdfb3d9235a01c2153fc2983e1d9f0c068f2d2c42e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PPKRPD6H7ZBDZK6MUWEDKZDDRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat, Sean Lawlor","submitted_at":"2012-09-05T18:45:21Z","abstract_excerpt":"We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free? Central to our analysis is a problem-specific value $r$ which quantifies the communication/computation tradeoff. We show that organizing the communication among nodes as a $k$-regular expander graph (Reingold, Vadhan, and Wigderson, 2002) yields speedups, while when all pairs of nodes communicate (as in a complete graph), there is an optimal number of processors "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1076","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-18T03:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"093IdkWHlgcBDYuV8/uv2i/e526OUof5WwvYaWLieFbSz2W2bfv7AVHlwms9GJu18kknw/9uLOJR1jYz9r2+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:02:39.942055Z"},"content_sha256":"881852e29e3c196a2226037b5393f1965096f65f98c46bfb7cf6f0ee26de368d","schema_version":"1.0","event_id":"sha256:881852e29e3c196a2226037b5393f1965096f65f98c46bfb7cf6f0ee26de368d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPKRPD6H7ZBDZK6MUWEDKZDDRL/bundle.json","state_url":"https://pith.science/pith/PPKRPD6H7ZBDZK6MUWEDKZDDRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPKRPD6H7ZBDZK6MUWEDKZDDRL/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-05-31T04:02:39Z","links":{"resolver":"https://pith.science/pith/PPKRPD6H7ZBDZK6MUWEDKZDDRL","bundle":"https://pith.science/pith/PPKRPD6H7ZBDZK6MUWEDKZDDRL/bundle.json","state":"https://pith.science/pith/PPKRPD6H7ZBDZK6MUWEDKZDDRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPKRPD6H7ZBDZK6MUWEDKZDDRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PPKRPD6H7ZBDZK6MUWEDKZDDRL","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":"573c3f89ef3fa0ebd40fcb96187625c74b1e4abf15619a715b0bf628e0c009ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-09-05T18:45:21Z","title_canon_sha256":"0d9c0686c3db48c4e76358ab893da89b186d412ff06f7c1d6e79dbb2035d0b89"},"schema_version":"1.0","source":{"id":"1209.1076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.1076","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"1209.1076v1","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.1076","created_at":"2026-05-18T03:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"PPKRPD6H7ZBD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PPKRPD6H7ZBDZK6M","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PPKRPD6H","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:881852e29e3c196a2226037b5393f1965096f65f98c46bfb7cf6f0ee26de368d","target":"graph","created_at":"2026-05-18T03:46:15Z","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":"We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free? Central to our analysis is a problem-specific value $r$ which quantifies the communication/computation tradeoff. We show that organizing the communication among nodes as a $k$-regular expander graph (Reingold, Vadhan, and Wigderson, 2002) yields speedups, while when all pairs of nodes communicate (as in a complete graph), there is an optimal number of processors ","authors_text":"Konstantinos I. Tsianos, Michael G. Rabbat, Sean Lawlor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-09-05T18:45:21Z","title":"Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.1076","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:1e444a3f1452cbc9c25d9fdfb3d9235a01c2153fc2983e1d9f0c068f2d2c42e3","target":"record","created_at":"2026-05-18T03:46:15Z","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":"573c3f89ef3fa0ebd40fcb96187625c74b1e4abf15619a715b0bf628e0c009ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-09-05T18:45:21Z","title_canon_sha256":"0d9c0686c3db48c4e76358ab893da89b186d412ff06f7c1d6e79dbb2035d0b89"},"schema_version":"1.0","source":{"id":"1209.1076","kind":"arxiv","version":1}},"canonical_sha256":"7bd5178fc7fe423cabcca5883564638af52a85dd628aae25c948bbb1bea7d918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bd5178fc7fe423cabcca5883564638af52a85dd628aae25c948bbb1bea7d918","first_computed_at":"2026-05-18T03:46:15.546235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:15.546235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xdpflg85D/6bGhMvmWz6DMOQT7xQArsiPZqUAPQaYFmGtdQVwrqcDVW76WGSDRti/dfmSi8mIWbcEDCfvk4oDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:15.546764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.1076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e444a3f1452cbc9c25d9fdfb3d9235a01c2153fc2983e1d9f0c068f2d2c42e3","sha256:881852e29e3c196a2226037b5393f1965096f65f98c46bfb7cf6f0ee26de368d"],"state_sha256":"b617b7f3e7ab8027d1497a32e61989739c29d95adc2e2af31bf77180d0a6b30f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oA4IDqmkmrqh/MSxt974aPtgwfAk965O9kSv6qx91W35UZLFu/bDaNRVFnecatZUq6mpEF9R7IkUHcSV6oa8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:02:39.945114Z","bundle_sha256":"62468e61c12565c15f3df02e065918838120814b0f2a0d405e5c24a02961ab73"}}