{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IRBEA65XS4YXOKI5524ZPI6CMM","short_pith_number":"pith:IRBEA65X","canonical_record":{"source":{"id":"2003.06739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-15T02:26:35Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"b15e6612485bd916636e62759044b87c9d129003607c2d60fad90d4df6281bdd","abstract_canon_sha256":"68b10f2e1433054667584e75ccc23ba155b944f449d316d1a2fb512f44712886"},"schema_version":"1.0"},"canonical_sha256":"4442407bb7973177291deeb997a3c263339a71efa8a0bfea32b1a3075fdc5b1a","source":{"kind":"arxiv","id":"2003.06739","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.06739","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"2003.06739v3","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.06739","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"IRBEA65XS4YX","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"pith_short_16","alias_value":"IRBEA65XS4YXOKI5","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"pith_short_8","alias_value":"IRBEA65X","created_at":"2026-07-05T01:22:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IRBEA65XS4YXOKI5524ZPI6CMM","target":"record","payload":{"canonical_record":{"source":{"id":"2003.06739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-15T02:26:35Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"b15e6612485bd916636e62759044b87c9d129003607c2d60fad90d4df6281bdd","abstract_canon_sha256":"68b10f2e1433054667584e75ccc23ba155b944f449d316d1a2fb512f44712886"},"schema_version":"1.0"},"canonical_sha256":"4442407bb7973177291deeb997a3c263339a71efa8a0bfea32b1a3075fdc5b1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:00.768153Z","signature_b64":"xj4jd90PnoPOQ71MhfzKd1I7WfwNL6J2JvDlCG1JfOHFCmgWEXMeHLX3R6FsvfMxkhgZWeQ9XW8bcsyzmx3RAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4442407bb7973177291deeb997a3c263339a71efa8a0bfea32b1a3075fdc5b1a","last_reissued_at":"2026-07-05T01:22:00.767665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:00.767665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.06739","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-07-05T01:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPEZoHPParlnwogYv+94qBTiWGim+5uynbzmu2b2Fy2eDawNSQAbErUU4xfHTJi+Pz5pTjMj0eTXcNJP77wbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:41:03.998897Z"},"content_sha256":"758c8390c8ffa817f11e71cb227d612d85a4989998930b61d267852696853268","schema_version":"1.0","event_id":"sha256:758c8390c8ffa817f11e71cb227d612d85a4989998930b61d267852696853268"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IRBEA65XS4YXOKI5524ZPI6CMM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Network Independence and Step-Size for A Distributed Subgradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky","submitted_at":"2020-03-15T02:26:35Z","abstract_excerpt":"We consider whether distributed subgradient methods can achieve a linear speedup over a centralized subgradient method. While it might be hoped that distributed network of $n$ nodes that can compute $n$ times more subgradients in parallel compared to a single node might, as a result, be $n$ times faster, existing bounds for distributed optimization methods are often consistent with a slowdown rather than speedup compared to a single node.\n  We show that a distributed subgradient method has this \"linear speedup\" property when using a class of square-summable-but-not-summable step-sizes which in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.06739","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.06739/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2FUwR80IWDd1AJtEGSXIFNx5Y6tC7FBcegrqMOs+OkU6S67Ow2Sqfu8uHed3+sL4l4e1YdFKe209FAX0MWvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T03:41:03.999702Z"},"content_sha256":"b40afe28a2bc930c4ad749e68710d2536985117e6b0f84f812a9af88e0cac23a","schema_version":"1.0","event_id":"sha256:b40afe28a2bc930c4ad749e68710d2536985117e6b0f84f812a9af88e0cac23a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/bundle.json","state_url":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRBEA65XS4YXOKI5524ZPI6CMM/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-08-07T03:41:04Z","links":{"resolver":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM","bundle":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/bundle.json","state":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRBEA65XS4YXOKI5524ZPI6CMM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IRBEA65XS4YXOKI5524ZPI6CMM","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":"68b10f2e1433054667584e75ccc23ba155b944f449d316d1a2fb512f44712886","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-15T02:26:35Z","title_canon_sha256":"b15e6612485bd916636e62759044b87c9d129003607c2d60fad90d4df6281bdd"},"schema_version":"1.0","source":{"id":"2003.06739","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.06739","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"2003.06739v3","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.06739","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"IRBEA65XS4YX","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"pith_short_16","alias_value":"IRBEA65XS4YXOKI5","created_at":"2026-07-05T01:22:00Z"},{"alias_kind":"pith_short_8","alias_value":"IRBEA65X","created_at":"2026-07-05T01:22:00Z"}],"graph_snapshots":[{"event_id":"sha256:b40afe28a2bc930c4ad749e68710d2536985117e6b0f84f812a9af88e0cac23a","target":"graph","created_at":"2026-07-05T01:22:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2003.06739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider whether distributed subgradient methods can achieve a linear speedup over a centralized subgradient method. While it might be hoped that distributed network of $n$ nodes that can compute $n$ times more subgradients in parallel compared to a single node might, as a result, be $n$ times faster, existing bounds for distributed optimization methods are often consistent with a slowdown rather than speedup compared to a single node.\n  We show that a distributed subgradient method has this \"linear speedup\" property when using a class of square-summable-but-not-summable step-sizes which in","authors_text":"Alex Olshevsky","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-15T02:26:35Z","title":"Asymptotic Network Independence and Step-Size for A Distributed Subgradient Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.06739","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:758c8390c8ffa817f11e71cb227d612d85a4989998930b61d267852696853268","target":"record","created_at":"2026-07-05T01:22:00Z","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":"68b10f2e1433054667584e75ccc23ba155b944f449d316d1a2fb512f44712886","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-03-15T02:26:35Z","title_canon_sha256":"b15e6612485bd916636e62759044b87c9d129003607c2d60fad90d4df6281bdd"},"schema_version":"1.0","source":{"id":"2003.06739","kind":"arxiv","version":3}},"canonical_sha256":"4442407bb7973177291deeb997a3c263339a71efa8a0bfea32b1a3075fdc5b1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4442407bb7973177291deeb997a3c263339a71efa8a0bfea32b1a3075fdc5b1a","first_computed_at":"2026-07-05T01:22:00.767665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:22:00.767665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xj4jd90PnoPOQ71MhfzKd1I7WfwNL6J2JvDlCG1JfOHFCmgWEXMeHLX3R6FsvfMxkhgZWeQ9XW8bcsyzmx3RAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:22:00.768153Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.06739","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:758c8390c8ffa817f11e71cb227d612d85a4989998930b61d267852696853268","sha256:b40afe28a2bc930c4ad749e68710d2536985117e6b0f84f812a9af88e0cac23a"],"state_sha256":"ede1fc3a93137538d8b8ecc0cc151042140f9e16f21568233fa7830f16acfb0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrhOf2IZfS/s4hDNmDf8vRcKDZj62fr6xnSFWH95YMicaYukxpNEmVvAjW9TQjNlzdPgU9mv9Uxd+bB3Ia2vCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T03:41:04.006268Z","bundle_sha256":"4c105698dd1b2854bf381fb05e7fea3b38d8de7b4d38cdd6441f615e9dddefa8"}}