{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7AYM5UJSIESNWUSZPXPAKLDXCU","short_pith_number":"pith:7AYM5UJS","canonical_record":{"source":{"id":"1409.8277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-09-29T15:17:52Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"2e8978df0dcca2042bd2cfe23011e62137875894629733f64c2f097cfd9f64ea","abstract_canon_sha256":"0eb81d4ee3a1187a9747f0671f652e876699a6d50e472a6f40f2d48c3423804f"},"schema_version":"1.0"},"canonical_sha256":"f830ced1324124db52597dde052c771523b873ccba334b5182e5611df6f854ec","source":{"kind":"arxiv","id":"1409.8277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8277","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8277v2","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8277","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"7AYM5UJSIESN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7AYM5UJSIESNWUSZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7AYM5UJS","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7AYM5UJSIESNWUSZPXPAKLDXCU","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-09-29T15:17:52Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"2e8978df0dcca2042bd2cfe23011e62137875894629733f64c2f097cfd9f64ea","abstract_canon_sha256":"0eb81d4ee3a1187a9747f0671f652e876699a6d50e472a6f40f2d48c3423804f"},"schema_version":"1.0"},"canonical_sha256":"f830ced1324124db52597dde052c771523b873ccba334b5182e5611df6f854ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:35.497054Z","signature_b64":"KletwiqA+NXXGJPatPcIm/LzTwu9unrhQ0BLQm+Ih6VxS9x7pjPBNTv3Gk5ZG7eBbs0p+cy554Gczs818coeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f830ced1324124db52597dde052c771523b873ccba334b5182e5611df6f854ec","last_reissued_at":"2026-05-18T01:34:35.496526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:35.496526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8277","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-18T01:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/dAKpR7IvLq6vMDM3isUsJdZCisZd34zVOkIRXoxZ1+A7P8BjMUhfZhKEVfeDy1as3VbOgrYlu4O/MTDf4iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:21:44.649483Z"},"content_sha256":"e2bea88d92377e13f0b9fd0b2c2ea7ff89607190b5fa1de44cfb12462271549c","schema_version":"1.0","event_id":"sha256:e2bea88d92377e13f0b9fd0b2c2ea7ff89607190b5fa1de44cfb12462271549c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7AYM5UJSIESNWUSZPXPAKLDXCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Subgradient Algorithms for Strongly Convex Optimization over Distributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.NA","authors_text":"Muhammed O. Sayin, N. Denizcan Vanli, Suleyman S. Kozat","submitted_at":"2014-09-29T15:17:52Z","abstract_excerpt":"We study diffusion and consensus based optimization of a sum of unknown convex objective functions over distributed networks. The only access to these functions is through stochastic gradient oracles, each of which is only available at a different node, and a limited number of gradient oracle calls is allowed at each node. In this framework, we introduce a convex optimization algorithm based on the stochastic gradient descent (SGD) updates. Particularly, we use a carefully designed time-dependent weighted averaging of the SGD iterates, which yields a convergence rate of $O\\left(\\frac{N\\sqrt{N}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8277","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-18T01:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEe0rDslwxd/leQheChjzD1txRsv1VO5alaDN7kzJAEw83zSDQbhR5l31W9gQvmfLNJNETH5FAbNKSavnsdtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:21:44.649828Z"},"content_sha256":"d1721cc45d1987a4f7a5b2623c816a62fb3b7206b17fcea808b93144c743be7f","schema_version":"1.0","event_id":"sha256:d1721cc45d1987a4f7a5b2623c816a62fb3b7206b17fcea808b93144c743be7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AYM5UJSIESNWUSZPXPAKLDXCU/bundle.json","state_url":"https://pith.science/pith/7AYM5UJSIESNWUSZPXPAKLDXCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AYM5UJSIESNWUSZPXPAKLDXCU/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-25T22:21:44Z","links":{"resolver":"https://pith.science/pith/7AYM5UJSIESNWUSZPXPAKLDXCU","bundle":"https://pith.science/pith/7AYM5UJSIESNWUSZPXPAKLDXCU/bundle.json","state":"https://pith.science/pith/7AYM5UJSIESNWUSZPXPAKLDXCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AYM5UJSIESNWUSZPXPAKLDXCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7AYM5UJSIESNWUSZPXPAKLDXCU","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":"0eb81d4ee3a1187a9747f0671f652e876699a6d50e472a6f40f2d48c3423804f","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-09-29T15:17:52Z","title_canon_sha256":"2e8978df0dcca2042bd2cfe23011e62137875894629733f64c2f097cfd9f64ea"},"schema_version":"1.0","source":{"id":"1409.8277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8277","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8277v2","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8277","created_at":"2026-05-18T01:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"7AYM5UJSIESN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7AYM5UJSIESNWUSZ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7AYM5UJS","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d1721cc45d1987a4f7a5b2623c816a62fb3b7206b17fcea808b93144c743be7f","target":"graph","created_at":"2026-05-18T01:34:35Z","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 diffusion and consensus based optimization of a sum of unknown convex objective functions over distributed networks. The only access to these functions is through stochastic gradient oracles, each of which is only available at a different node, and a limited number of gradient oracle calls is allowed at each node. In this framework, we introduce a convex optimization algorithm based on the stochastic gradient descent (SGD) updates. Particularly, we use a carefully designed time-dependent weighted averaging of the SGD iterates, which yields a convergence rate of $O\\left(\\frac{N\\sqrt{N}","authors_text":"Muhammed O. Sayin, N. Denizcan Vanli, Suleyman S. Kozat","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-09-29T15:17:52Z","title":"Stochastic Subgradient Algorithms for Strongly Convex Optimization over Distributed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8277","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:e2bea88d92377e13f0b9fd0b2c2ea7ff89607190b5fa1de44cfb12462271549c","target":"record","created_at":"2026-05-18T01:34:35Z","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":"0eb81d4ee3a1187a9747f0671f652e876699a6d50e472a6f40f2d48c3423804f","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-09-29T15:17:52Z","title_canon_sha256":"2e8978df0dcca2042bd2cfe23011e62137875894629733f64c2f097cfd9f64ea"},"schema_version":"1.0","source":{"id":"1409.8277","kind":"arxiv","version":2}},"canonical_sha256":"f830ced1324124db52597dde052c771523b873ccba334b5182e5611df6f854ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f830ced1324124db52597dde052c771523b873ccba334b5182e5611df6f854ec","first_computed_at":"2026-05-18T01:34:35.496526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:35.496526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KletwiqA+NXXGJPatPcIm/LzTwu9unrhQ0BLQm+Ih6VxS9x7pjPBNTv3Gk5ZG7eBbs0p+cy554Gczs818coeAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:35.497054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2bea88d92377e13f0b9fd0b2c2ea7ff89607190b5fa1de44cfb12462271549c","sha256:d1721cc45d1987a4f7a5b2623c816a62fb3b7206b17fcea808b93144c743be7f"],"state_sha256":"955861a7bb1a6dbe89e2a0eda1498b296b5993cba7725cd2de545b2362266cc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJiRUxLBtE4KOWCurKVCU5Ckc4l2QyKjrgI/LjwlkynbiUgx3INGeHp0u6kGa1dD+as3YOiSz0jws+f05fjRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:21:44.651823Z","bundle_sha256":"8c0304d534b415334ba7fefc14d52fe1175ed230372f038a76dee305018b7e6e"}}