{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7G7AUOKFZ363ZUGUGOGPMKNKCH","short_pith_number":"pith:7G7AUOKF","schema_version":"1.0","canonical_sha256":"f9be0a3945cefdbcd0d4338cf629aa11f26eb79e8dece45334a0e5217e6e1abc","source":{"kind":"arxiv","id":"1406.2075","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedic","submitted_at":"2014-06-09T04:30:36Z","abstract_excerpt":"We investigate the convergence rate of the recently proposed subgradient-push method for distributed optimization over time-varying directed graphs. The subgradient-push method can be implemented in a distributed way without requiring knowledge of either the number of agents or the graph sequence; each node is only required to know its out-degree at each time. Our main result is a convergence rate of $O \\left((\\ln t)/t \\right)$ for strongly convex functions with Lipschitz gradients even if only stochastic gradient samples are available; this is asymptotically faster than the $O \\left((\\ln t)/\\"},"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":"1406.2075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-09T04:30:36Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"f247b8b3248467ece38064d548f175ccfdd7b1ca0103f16be2ef9f3e087844d4","abstract_canon_sha256":"9be13d8b6c8761a43b7e5b8c8ba93f5b1d6e9efb33f2fd9400cfef692827ebed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:05.431624Z","signature_b64":"YBhqFPkQpr5gX4fbQfehZxVReegbI+xBMU9ortX8n/k8x066Lzy8b5tCIjUqANc8h8dhPyVtHpFKwzFtG4aZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9be0a3945cefdbcd0d4338cf629aa11f26eb79e8dece45334a0e5217e6e1abc","last_reissued_at":"2026-05-18T02:27:05.431196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:05.431196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Alex Olshevsky, Angelia Nedic","submitted_at":"2014-06-09T04:30:36Z","abstract_excerpt":"We investigate the convergence rate of the recently proposed subgradient-push method for distributed optimization over time-varying directed graphs. The subgradient-push method can be implemented in a distributed way without requiring knowledge of either the number of agents or the graph sequence; each node is only required to know its out-degree at each time. Our main result is a convergence rate of $O \\left((\\ln t)/t \\right)$ for strongly convex functions with Lipschitz gradients even if only stochastic gradient samples are available; this is asymptotically faster than the $O \\left((\\ln t)/\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2075","kind":"arxiv","version":2},"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":"1406.2075","created_at":"2026-05-18T02:27:05.431261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2075v2","created_at":"2026-05-18T02:27:05.431261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2075","created_at":"2026-05-18T02:27:05.431261+00:00"},{"alias_kind":"pith_short_12","alias_value":"7G7AUOKFZ363","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7G7AUOKFZ363ZUGU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7G7AUOKF","created_at":"2026-05-18T12:28:16.859392+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/7G7AUOKFZ363ZUGUGOGPMKNKCH","json":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH.json","graph_json":"https://pith.science/api/pith-number/7G7AUOKFZ363ZUGUGOGPMKNKCH/graph.json","events_json":"https://pith.science/api/pith-number/7G7AUOKFZ363ZUGUGOGPMKNKCH/events.json","paper":"https://pith.science/paper/7G7AUOKF"},"agent_actions":{"view_html":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH","download_json":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH.json","view_paper":"https://pith.science/paper/7G7AUOKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2075&json=true","fetch_graph":"https://pith.science/api/pith-number/7G7AUOKFZ363ZUGUGOGPMKNKCH/graph.json","fetch_events":"https://pith.science/api/pith-number/7G7AUOKFZ363ZUGUGOGPMKNKCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/action/storage_attestation","attest_author":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/action/author_attestation","sign_citation":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/action/citation_signature","submit_replication":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/action/replication_record"}},"created_at":"2026-05-18T02:27:05.431261+00:00","updated_at":"2026-05-18T02:27:05.431261+00:00"}