{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UWD6V4TE4ZBGNJJCOKX24AGVNU","short_pith_number":"pith:UWD6V4TE","canonical_record":{"source":{"id":"1307.1879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-07T16:02:22Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ecffdd9c9a1e248bc403af55b63630f117c0d565b260c6b5cb861e4af2a92da8","abstract_canon_sha256":"0f81fb803d8c171a905e6814880bf95571d57a62db8972ffe6bf1be0e88197fd"},"schema_version":"1.0"},"canonical_sha256":"a587eaf264e64266a52272afae00d56d304a23d6fceffa2877f5e56ce8ebd721","source":{"kind":"arxiv","id":"1307.1879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1879","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1879v1","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1879","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"UWD6V4TE4ZBG","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UWD6V4TE4ZBGNJJC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UWD6V4TE","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UWD6V4TE4ZBGNJJCOKX24AGVNU","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-07T16:02:22Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ecffdd9c9a1e248bc403af55b63630f117c0d565b260c6b5cb861e4af2a92da8","abstract_canon_sha256":"0f81fb803d8c171a905e6814880bf95571d57a62db8972ffe6bf1be0e88197fd"},"schema_version":"1.0"},"canonical_sha256":"a587eaf264e64266a52272afae00d56d304a23d6fceffa2877f5e56ce8ebd721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:03.262545Z","signature_b64":"RrPSmi41F5Cm2HEWcjxlUhLQ/wcUg0+PZfPcS6g0nfXbfYF394o7t2iKoDXUN66eD0jbOauG62m9YdhQ+2bEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a587eaf264e64266a52272afae00d56d304a23d6fceffa2877f5e56ce8ebd721","last_reissued_at":"2026-05-18T03:19:03.261980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:03.261980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1879","source_version":1,"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-18T03:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdxIbxGh9qX2fhfxahuOqeL3dXxiF16tujbba/u7rygGBOw7Q5yDtYnuvNNPtJxXFzqHZTTO2aUx7CpYss0CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:49:23.571413Z"},"content_sha256":"849a065bf60cf5edcfaca83779381c715f261851698fc8360d2bce0bee2d937e","schema_version":"1.0","event_id":"sha256:849a065bf60cf5edcfaca83779381c715f261851698fc8360d2bce0bee2d937e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UWD6V4TE4ZBGNJJCOKX24AGVNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Soomin Lee","submitted_at":"2013-07-07T16:02:22Z","abstract_excerpt":"This paper considers stochastic subgradient mirror-descent method for solving constrained convex minimization problems. In particular, a stochastic subgradient mirror-descent method with weighted iterate-averaging is investigated and its per-iterate convergence rate is analyzed. The novel part of the approach is in the choice of weights that are used to construct the averages. Through the use of these weighted averages, we show that the known optimal rates can be obtained with simpler algorithms than those currently existing in the literature. Specifically, by suitably choosing the stepsize va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1879","kind":"arxiv","version":1},"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-18T03:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uh3Ik5t/uhiSxJRQ2fwnUb0Dtl6XO03UtsDbGZnPitgj7V1UzlpKSO97nLbJE6sRi3YEpj/a0XFUs9Krlcg4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:49:23.572105Z"},"content_sha256":"5da0a25d6679c2b2a0ba5caca248e0c563f661bdcf5657c808a392382ac7f657","schema_version":"1.0","event_id":"sha256:5da0a25d6679c2b2a0ba5caca248e0c563f661bdcf5657c808a392382ac7f657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWD6V4TE4ZBGNJJCOKX24AGVNU/bundle.json","state_url":"https://pith.science/pith/UWD6V4TE4ZBGNJJCOKX24AGVNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWD6V4TE4ZBGNJJCOKX24AGVNU/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-08T16:49:23Z","links":{"resolver":"https://pith.science/pith/UWD6V4TE4ZBGNJJCOKX24AGVNU","bundle":"https://pith.science/pith/UWD6V4TE4ZBGNJJCOKX24AGVNU/bundle.json","state":"https://pith.science/pith/UWD6V4TE4ZBGNJJCOKX24AGVNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWD6V4TE4ZBGNJJCOKX24AGVNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UWD6V4TE4ZBGNJJCOKX24AGVNU","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":"0f81fb803d8c171a905e6814880bf95571d57a62db8972ffe6bf1be0e88197fd","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-07T16:02:22Z","title_canon_sha256":"ecffdd9c9a1e248bc403af55b63630f117c0d565b260c6b5cb861e4af2a92da8"},"schema_version":"1.0","source":{"id":"1307.1879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1879","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1879v1","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1879","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"UWD6V4TE4ZBG","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UWD6V4TE4ZBGNJJC","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UWD6V4TE","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:5da0a25d6679c2b2a0ba5caca248e0c563f661bdcf5657c808a392382ac7f657","target":"graph","created_at":"2026-05-18T03:19:03Z","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":"This paper considers stochastic subgradient mirror-descent method for solving constrained convex minimization problems. In particular, a stochastic subgradient mirror-descent method with weighted iterate-averaging is investigated and its per-iterate convergence rate is analyzed. The novel part of the approach is in the choice of weights that are used to construct the averages. Through the use of these weighted averages, we show that the known optimal rates can be obtained with simpler algorithms than those currently existing in the literature. Specifically, by suitably choosing the stepsize va","authors_text":"Angelia Nedich, Soomin Lee","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-07T16:02:22Z","title":"On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1879","kind":"arxiv","version":1},"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:849a065bf60cf5edcfaca83779381c715f261851698fc8360d2bce0bee2d937e","target":"record","created_at":"2026-05-18T03:19:03Z","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":"0f81fb803d8c171a905e6814880bf95571d57a62db8972ffe6bf1be0e88197fd","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-07T16:02:22Z","title_canon_sha256":"ecffdd9c9a1e248bc403af55b63630f117c0d565b260c6b5cb861e4af2a92da8"},"schema_version":"1.0","source":{"id":"1307.1879","kind":"arxiv","version":1}},"canonical_sha256":"a587eaf264e64266a52272afae00d56d304a23d6fceffa2877f5e56ce8ebd721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a587eaf264e64266a52272afae00d56d304a23d6fceffa2877f5e56ce8ebd721","first_computed_at":"2026-05-18T03:19:03.261980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:03.261980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RrPSmi41F5Cm2HEWcjxlUhLQ/wcUg0+PZfPcS6g0nfXbfYF394o7t2iKoDXUN66eD0jbOauG62m9YdhQ+2bEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:03.262545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:849a065bf60cf5edcfaca83779381c715f261851698fc8360d2bce0bee2d937e","sha256:5da0a25d6679c2b2a0ba5caca248e0c563f661bdcf5657c808a392382ac7f657"],"state_sha256":"196c32f07411ea3712637f97ec40a83e7df7b0f6b4dbbc800957920f21041837"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKFiKKZCmekBhj8M5XCr+FxBbxdUqNbD1V07iL6wgPWnnkIMViVPB2kbTiqMnEyJ4CmAGsrGlu5BZXI4CCkqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:49:23.575903Z","bundle_sha256":"6ca2f61c33a8b3c428770c66ab48f3cd9ed1efbf59911d28c979ab09f0733add"}}