{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SFB3TMUFAXQJRYBLRDH3YQRXKJ","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":"b31befb7dade38bbabd8e3d9f8f18c071cc13b687734a658a5f49239e386b93a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T21:50:06Z","title_canon_sha256":"ac918949fca7e277c59a4f1ce77b715bea760214e788629dbaa47db649d076fb"},"schema_version":"1.0","source":{"id":"1705.02031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02031","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02031v1","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02031","created_at":"2026-05-18T00:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"SFB3TMUFAXQJ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SFB3TMUFAXQJRYBL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SFB3TMUF","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:5691e69d742b1e0cd01fdc42c91c4875ba884b4034d83e90b51bdcddf64ea9c9","target":"graph","created_at":"2026-05-18T00:45:00Z","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":"Mirror Descent (MD) is a well-known method of solving non-smooth convex optimization problems. This paper analyzes the stochastic variant of MD with adaptive stepsizes. Its convergence on average is shown to be faster than with the fixed stepsizes and optimal in terms of lower bounds.","authors_text":"Anastasia Bayandina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T21:50:06Z","title":"Adaptive Stochastic Mirror Descent for Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02031","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:7f4ea015cf431b57b442bf908df73c8e3ac39f9d007f2dadb341c560d752e9d4","target":"record","created_at":"2026-05-18T00:45:00Z","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":"b31befb7dade38bbabd8e3d9f8f18c071cc13b687734a658a5f49239e386b93a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-04T21:50:06Z","title_canon_sha256":"ac918949fca7e277c59a4f1ce77b715bea760214e788629dbaa47db649d076fb"},"schema_version":"1.0","source":{"id":"1705.02031","kind":"arxiv","version":1}},"canonical_sha256":"9143b9b28505e098e02b88cfbc42375254aa4a21ebe951cfb14eb17f18850fc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9143b9b28505e098e02b88cfbc42375254aa4a21ebe951cfb14eb17f18850fc1","first_computed_at":"2026-05-18T00:45:00.771060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:00.771060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KlTx9r/I5TMuTT6ST9EJbX8mmtHgMrzw+w/tqxnUXkFcktv2tmi1sS3GMyKbLaacv+8wzw9c1IJ8KoouKvjCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:00.771480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f4ea015cf431b57b442bf908df73c8e3ac39f9d007f2dadb341c560d752e9d4","sha256:5691e69d742b1e0cd01fdc42c91c4875ba884b4034d83e90b51bdcddf64ea9c9"],"state_sha256":"2f33f61e7c3e169ee778a52d5d21307dbb1aacef048dae91ae80f6b215bfa45c"}