{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7G7AUOKFZ363ZUGUGOGPMKNKCH","short_pith_number":"pith:7G7AUOKF","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"},"canonical_sha256":"f9be0a3945cefdbcd0d4338cf629aa11f26eb79e8dece45334a0e5217e6e1abc","source":{"kind":"arxiv","id":"1406.2075","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2075","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2075v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2075","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"7G7AUOKFZ363","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7G7AUOKFZ363ZUGU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7G7AUOKF","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7G7AUOKFZ363ZUGUGOGPMKNKCH","target":"record","payload":{"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"},"canonical_sha256":"f9be0a3945cefdbcd0d4338cf629aa11f26eb79e8dece45334a0e5217e6e1abc","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"},"source_kind":"arxiv","source_id":"1406.2075","source_version":2,"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9T1aqwDmdmxj7sU2GtkY8+eqVNG8p1H1iKV7EyVfwIugM35BkyQZAX4Brs8ZkXUW9ZEKAPJXh2Hha+a+8d1IAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T11:35:55.642285Z"},"content_sha256":"fcc26a113d2930b327044ecae1004950a45aaada68154508dc170803d191deac","schema_version":"1.0","event_id":"sha256:fcc26a113d2930b327044ecae1004950a45aaada68154508dc170803d191deac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7G7AUOKFZ363ZUGUGOGPMKNKCH","target":"graph","payload":{"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"},"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZCEIY1hw/UsRSst4m1mdRlxd043u64bbAjZpb8eXPa7yk7W853JJyJiWOtlQ80gSex4RbxHe2maz8LHBBDnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T11:35:55.642660Z"},"content_sha256":"3dec613dc2f5abcaa5e18153f3c8bb3eeb3a24c7c2cd80d9486d25eb8bcfaf0a","schema_version":"1.0","event_id":"sha256:3dec613dc2f5abcaa5e18153f3c8bb3eeb3a24c7c2cd80d9486d25eb8bcfaf0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/bundle.json","state_url":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/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-23T11:35:55Z","links":{"resolver":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH","bundle":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/bundle.json","state":"https://pith.science/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7G7AUOKFZ363ZUGUGOGPMKNKCH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7G7AUOKFZ363ZUGUGOGPMKNKCH","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":"9be13d8b6c8761a43b7e5b8c8ba93f5b1d6e9efb33f2fd9400cfef692827ebed","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-09T04:30:36Z","title_canon_sha256":"f247b8b3248467ece38064d548f175ccfdd7b1ca0103f16be2ef9f3e087844d4"},"schema_version":"1.0","source":{"id":"1406.2075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2075","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2075v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2075","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"7G7AUOKFZ363","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7G7AUOKFZ363ZUGU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7G7AUOKF","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:3dec613dc2f5abcaa5e18153f3c8bb3eeb3a24c7c2cd80d9486d25eb8bcfaf0a","target":"graph","created_at":"2026-05-18T02:27:05Z","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 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)/\\","authors_text":"Alex Olshevsky, Angelia Nedic","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-09T04:30:36Z","title":"Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2075","kind":"arxiv","version":2},"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:fcc26a113d2930b327044ecae1004950a45aaada68154508dc170803d191deac","target":"record","created_at":"2026-05-18T02:27:05Z","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":"9be13d8b6c8761a43b7e5b8c8ba93f5b1d6e9efb33f2fd9400cfef692827ebed","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-09T04:30:36Z","title_canon_sha256":"f247b8b3248467ece38064d548f175ccfdd7b1ca0103f16be2ef9f3e087844d4"},"schema_version":"1.0","source":{"id":"1406.2075","kind":"arxiv","version":2}},"canonical_sha256":"f9be0a3945cefdbcd0d4338cf629aa11f26eb79e8dece45334a0e5217e6e1abc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9be0a3945cefdbcd0d4338cf629aa11f26eb79e8dece45334a0e5217e6e1abc","first_computed_at":"2026-05-18T02:27:05.431196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:05.431196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YBhqFPkQpr5gX4fbQfehZxVReegbI+xBMU9ortX8n/k8x066Lzy8b5tCIjUqANc8h8dhPyVtHpFKwzFtG4aZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:05.431624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcc26a113d2930b327044ecae1004950a45aaada68154508dc170803d191deac","sha256:3dec613dc2f5abcaa5e18153f3c8bb3eeb3a24c7c2cd80d9486d25eb8bcfaf0a"],"state_sha256":"6761a2a22ffd02d8cb4e5241dfed1ac1f2a8810dd3420ee61a098b21f6ed6111"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUW9QvmZRBd1ZTeI7+SvhWmb9xQuHPZLAPMVNjSbBCpwdZD9lkkYqggdYzPWCp7UrOS0mBdSLTW/GKzjULNqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T11:35:55.644541Z","bundle_sha256":"0e8d272ae9a91939839ee4ce37896a9fbbdf699f26b9c58fee326cc2b5a5731a"}}