{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IRBEA65XS4YXOKI5524ZPI6CMM","short_pith_number":"pith:IRBEA65X","schema_version":"1.0","canonical_sha256":"4442407bb7973177291deeb997a3c263339a71efa8a0bfea32b1a3075fdc5b1a","source":{"kind":"arxiv","id":"2003.06739","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.06739","created_at":"2026-07-05T01:22:00.767722+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.06739v3","created_at":"2026-07-05T01:22:00.767722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.06739","created_at":"2026-07-05T01:22:00.767722+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRBEA65XS4YX","created_at":"2026-07-05T01:22:00.767722+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRBEA65XS4YXOKI5","created_at":"2026-07-05T01:22:00.767722+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRBEA65X","created_at":"2026-07-05T01:22:00.767722+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/IRBEA65XS4YXOKI5524ZPI6CMM","json":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM.json","graph_json":"https://pith.science/api/pith-number/IRBEA65XS4YXOKI5524ZPI6CMM/graph.json","events_json":"https://pith.science/api/pith-number/IRBEA65XS4YXOKI5524ZPI6CMM/events.json","paper":"https://pith.science/paper/IRBEA65X"},"agent_actions":{"view_html":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM","download_json":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM.json","view_paper":"https://pith.science/paper/IRBEA65X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.06739&json=true","fetch_graph":"https://pith.science/api/pith-number/IRBEA65XS4YXOKI5524ZPI6CMM/graph.json","fetch_events":"https://pith.science/api/pith-number/IRBEA65XS4YXOKI5524ZPI6CMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/action/storage_attestation","attest_author":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/action/author_attestation","sign_citation":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/action/citation_signature","submit_replication":"https://pith.science/pith/IRBEA65XS4YXOKI5524ZPI6CMM/action/replication_record"}},"created_at":"2026-07-05T01:22:00.767722+00:00","updated_at":"2026-07-05T01:22:00.767722+00:00"}