{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3SHMVME3LIL5EAZKAEAYYFXVPC","short_pith_number":"pith:3SHMVME3","canonical_record":{"source":{"id":"1610.04702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-15T07:52:04Z","cross_cats_sorted":[],"title_canon_sha256":"d1414ef29a0ec54efa88982bf3876225055cd050c274efc3f7d91e7a5d5c59a2","abstract_canon_sha256":"16a03808dd38fe199a85eedb308b5010ff9c20a8bd9d88c0e504682794934ecd"},"schema_version":"1.0"},"canonical_sha256":"dc8ecab09b5a17d2032a01018c16f578a3c1fd7d440f60ebf8eb8c5d4d425e55","source":{"kind":"arxiv","id":"1610.04702","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04702","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04702v2","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04702","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"3SHMVME3LIL5","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SHMVME3LIL5EAZK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SHMVME3","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3SHMVME3LIL5EAZKAEAYYFXVPC","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-15T07:52:04Z","cross_cats_sorted":[],"title_canon_sha256":"d1414ef29a0ec54efa88982bf3876225055cd050c274efc3f7d91e7a5d5c59a2","abstract_canon_sha256":"16a03808dd38fe199a85eedb308b5010ff9c20a8bd9d88c0e504682794934ecd"},"schema_version":"1.0"},"canonical_sha256":"dc8ecab09b5a17d2032a01018c16f578a3c1fd7d440f60ebf8eb8c5d4d425e55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:33.273978Z","signature_b64":"Mq3EZLOezmlBySkv/nE91Uy12Jmm/17mcqzCLUHd1uffUR5qXSMfSu7/Z1D84V+36v88HAtk8UjBrMNHvBJjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8ecab09b5a17d2032a01018c16f578a3c1fd7d440f60ebf8eb8c5d4d425e55","last_reissued_at":"2026-05-18T00:07:33.273434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:33.273434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04702","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-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0j1pqmaAo6dtjSnX7if6c0Id7rOiWylwf5n5HE+9mOuOmDoA0jFhHdfVo+7Wjp9beKujaNRTcd0pLYhLuRYZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:32.803163Z"},"content_sha256":"31922f87d296f2524ba961b96058ed2cd0e36af1d712c654b71a2fd61ac4626c","schema_version":"1.0","event_id":"sha256:31922f87d296f2524ba961b96058ed2cd0e36af1d712c654b71a2fd61ac4626c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3SHMVME3LIL5EAZKAEAYYFXVPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Distributed Stochastic Mirror Descent for Strongly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel W. C. Ho, Deming Yuan, Guoping Jiang, Yiguang Hong","submitted_at":"2016-10-15T07:52:04Z","abstract_excerpt":"In this paper we consider convergence rate problems for stochastic strongly-convex optimization in the non-Euclidean sense with a constraint set over a time-varying multi-agent network. We propose two efficient non-Euclidean stochastic subgradient descent algorithms based on the Bregman divergence as distance-measuring function rather than the Euclidean distances that were employed by the standard distributed stochastic projected subgradient algorithms. For distributed optimization of nonsmooth and strongly convex functions whose only stochastic subgradients are available, the first algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04702","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-18T00:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ih5s8qYz7VzHhxvazmKiMV8khurZG2lDQnAik0uXLJsdW6c2FE6KA7DXvwWUbezlUtMs8+oeseU82xaWlCCKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:32.803647Z"},"content_sha256":"20ed948e3e5a4768369623d908a7b1038e4a219422afb2e69774030c985561b7","schema_version":"1.0","event_id":"sha256:20ed948e3e5a4768369623d908a7b1038e4a219422afb2e69774030c985561b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SHMVME3LIL5EAZKAEAYYFXVPC/bundle.json","state_url":"https://pith.science/pith/3SHMVME3LIL5EAZKAEAYYFXVPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SHMVME3LIL5EAZKAEAYYFXVPC/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-09T00:23:32Z","links":{"resolver":"https://pith.science/pith/3SHMVME3LIL5EAZKAEAYYFXVPC","bundle":"https://pith.science/pith/3SHMVME3LIL5EAZKAEAYYFXVPC/bundle.json","state":"https://pith.science/pith/3SHMVME3LIL5EAZKAEAYYFXVPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SHMVME3LIL5EAZKAEAYYFXVPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3SHMVME3LIL5EAZKAEAYYFXVPC","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":"16a03808dd38fe199a85eedb308b5010ff9c20a8bd9d88c0e504682794934ecd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-15T07:52:04Z","title_canon_sha256":"d1414ef29a0ec54efa88982bf3876225055cd050c274efc3f7d91e7a5d5c59a2"},"schema_version":"1.0","source":{"id":"1610.04702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04702","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04702v2","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04702","created_at":"2026-05-18T00:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"3SHMVME3LIL5","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SHMVME3LIL5EAZK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SHMVME3","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:20ed948e3e5a4768369623d908a7b1038e4a219422afb2e69774030c985561b7","target":"graph","created_at":"2026-05-18T00:07:33Z","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":"In this paper we consider convergence rate problems for stochastic strongly-convex optimization in the non-Euclidean sense with a constraint set over a time-varying multi-agent network. We propose two efficient non-Euclidean stochastic subgradient descent algorithms based on the Bregman divergence as distance-measuring function rather than the Euclidean distances that were employed by the standard distributed stochastic projected subgradient algorithms. For distributed optimization of nonsmooth and strongly convex functions whose only stochastic subgradients are available, the first algorithm ","authors_text":"Daniel W. C. Ho, Deming Yuan, Guoping Jiang, Yiguang Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-15T07:52:04Z","title":"Optimal Distributed Stochastic Mirror Descent for Strongly Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04702","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:31922f87d296f2524ba961b96058ed2cd0e36af1d712c654b71a2fd61ac4626c","target":"record","created_at":"2026-05-18T00:07:33Z","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":"16a03808dd38fe199a85eedb308b5010ff9c20a8bd9d88c0e504682794934ecd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-15T07:52:04Z","title_canon_sha256":"d1414ef29a0ec54efa88982bf3876225055cd050c274efc3f7d91e7a5d5c59a2"},"schema_version":"1.0","source":{"id":"1610.04702","kind":"arxiv","version":2}},"canonical_sha256":"dc8ecab09b5a17d2032a01018c16f578a3c1fd7d440f60ebf8eb8c5d4d425e55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc8ecab09b5a17d2032a01018c16f578a3c1fd7d440f60ebf8eb8c5d4d425e55","first_computed_at":"2026-05-18T00:07:33.273434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:33.273434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mq3EZLOezmlBySkv/nE91Uy12Jmm/17mcqzCLUHd1uffUR5qXSMfSu7/Z1D84V+36v88HAtk8UjBrMNHvBJjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:33.273978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31922f87d296f2524ba961b96058ed2cd0e36af1d712c654b71a2fd61ac4626c","sha256:20ed948e3e5a4768369623d908a7b1038e4a219422afb2e69774030c985561b7"],"state_sha256":"68d3b2d9777f3af0de55e65f3a068eb85015422da1844ebb8ca7ba9ee09e2114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jGepKk3BDCEdg1/2fyS0bDKNkT/DvVNiCb4lI/dHN4lpGdzAV2Om50bLg9Jwh1O4xVBoEzcFY3IBujHWYAtRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:23:32.806827Z","bundle_sha256":"6cac523f349f0a7575cd321d95045d08e6fc4bb727667b74164d0b70481e9c61"}}