{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TLTUZT7O7NU3J6UZLADXEADGIN","short_pith_number":"pith:TLTUZT7O","canonical_record":{"source":{"id":"1706.05681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-18T16:17:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"570cea0935663853263f8d3738432e37651ff77cd66ad445c0d4526b56609ac5","abstract_canon_sha256":"e58b8c18a8c11777db19f1645689230e5cf587ec8544e56ee14fd644a2544733"},"schema_version":"1.0"},"canonical_sha256":"9ae74ccfeefb69b4fa99580772006643652cc473cc49cc68011603457525097f","source":{"kind":"arxiv","id":"1706.05681","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05681","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05681v2","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05681","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"TLTUZT7O7NU3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TLTUZT7O7NU3J6UZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TLTUZT7O","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TLTUZT7O7NU3J6UZLADXEADGIN","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-18T16:17:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"570cea0935663853263f8d3738432e37651ff77cd66ad445c0d4526b56609ac5","abstract_canon_sha256":"e58b8c18a8c11777db19f1645689230e5cf587ec8544e56ee14fd644a2544733"},"schema_version":"1.0"},"canonical_sha256":"9ae74ccfeefb69b4fa99580772006643652cc473cc49cc68011603457525097f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:47.668255Z","signature_b64":"3khqdqgqNSkVKXLaSnD2ZeQhnzfMVuT/HhjEki7CEXb0pwk2uY+Cios4qg7+vcfXnHKFCuqwn6JhMxiLTG5KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ae74ccfeefb69b4fa99580772006643652cc473cc49cc68011603457525097f","last_reissued_at":"2026-05-18T00:10:47.667611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:47.667611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05681","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:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkgNOQbpZE3vilV+PYnbdXGMvBXRhiGOgsAnrvJQsOq5RwWe565upRnOYAi3z7t/cRl+JS0KfMLHZN/+KjS8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:36:24.169252Z"},"content_sha256":"4ed4f3527bfd03f3a862b726ab05c58a8a18354c5e36161acb2795aa0f35cb3b","schema_version":"1.0","event_id":"sha256:4ed4f3527bfd03f3a862b726ab05c58a8a18354c5e36161acb2795aa0f35cb3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TLTUZT7O7NU3J6UZLADXEADGIN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the convergence of mirror descent beyond stochastic convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Nicholas Bambos, Panayotis Mertikopoulos, Peter Glynn, Stephen Boyd, Zhengyuan Zhou","submitted_at":"2017-06-18T16:17:03Z","abstract_excerpt":"In this paper, we examine the convergence of mirror descent in a class of stochastic optimization problems that are not necessarily convex (or even quasi-convex), and which we call variationally coherent. Since the standard technique of \"ergodic averaging\" offers no tangible benefits beyond convex programming, we focus directly on the algorithm's last generated sample (its \"last iterate\"), and we show that it converges with probabiility $1$ if the underlying problem is coherent. We further consider a localized version of variational coherence which ensures local convergence of stochastic mirro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05681","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:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCj3d7SQNtA+GmLvQonjJDHDJX8seQsufrx0LmA3rUQZIUS1rciBM71Q2RYd3B7qNasUEHXomzM6Gn0SwKfdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:36:24.169955Z"},"content_sha256":"d2bf86189b6e8b01383fdcb6d6a161b5a4a363a2d0df73b2333c91e8ee902d5b","schema_version":"1.0","event_id":"sha256:d2bf86189b6e8b01383fdcb6d6a161b5a4a363a2d0df73b2333c91e8ee902d5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLTUZT7O7NU3J6UZLADXEADGIN/bundle.json","state_url":"https://pith.science/pith/TLTUZT7O7NU3J6UZLADXEADGIN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLTUZT7O7NU3J6UZLADXEADGIN/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-05-30T12:36:24Z","links":{"resolver":"https://pith.science/pith/TLTUZT7O7NU3J6UZLADXEADGIN","bundle":"https://pith.science/pith/TLTUZT7O7NU3J6UZLADXEADGIN/bundle.json","state":"https://pith.science/pith/TLTUZT7O7NU3J6UZLADXEADGIN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLTUZT7O7NU3J6UZLADXEADGIN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TLTUZT7O7NU3J6UZLADXEADGIN","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":"e58b8c18a8c11777db19f1645689230e5cf587ec8544e56ee14fd644a2544733","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-18T16:17:03Z","title_canon_sha256":"570cea0935663853263f8d3738432e37651ff77cd66ad445c0d4526b56609ac5"},"schema_version":"1.0","source":{"id":"1706.05681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05681","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05681v2","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05681","created_at":"2026-05-18T00:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"TLTUZT7O7NU3","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TLTUZT7O7NU3J6UZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TLTUZT7O","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:d2bf86189b6e8b01383fdcb6d6a161b5a4a363a2d0df73b2333c91e8ee902d5b","target":"graph","created_at":"2026-05-18T00:10:47Z","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 examine the convergence of mirror descent in a class of stochastic optimization problems that are not necessarily convex (or even quasi-convex), and which we call variationally coherent. Since the standard technique of \"ergodic averaging\" offers no tangible benefits beyond convex programming, we focus directly on the algorithm's last generated sample (its \"last iterate\"), and we show that it converges with probabiility $1$ if the underlying problem is coherent. We further consider a localized version of variational coherence which ensures local convergence of stochastic mirro","authors_text":"Nicholas Bambos, Panayotis Mertikopoulos, Peter Glynn, Stephen Boyd, Zhengyuan Zhou","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-18T16:17:03Z","title":"On the convergence of mirror descent beyond stochastic convex programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05681","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:4ed4f3527bfd03f3a862b726ab05c58a8a18354c5e36161acb2795aa0f35cb3b","target":"record","created_at":"2026-05-18T00:10:47Z","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":"e58b8c18a8c11777db19f1645689230e5cf587ec8544e56ee14fd644a2544733","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-18T16:17:03Z","title_canon_sha256":"570cea0935663853263f8d3738432e37651ff77cd66ad445c0d4526b56609ac5"},"schema_version":"1.0","source":{"id":"1706.05681","kind":"arxiv","version":2}},"canonical_sha256":"9ae74ccfeefb69b4fa99580772006643652cc473cc49cc68011603457525097f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ae74ccfeefb69b4fa99580772006643652cc473cc49cc68011603457525097f","first_computed_at":"2026-05-18T00:10:47.667611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:47.667611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3khqdqgqNSkVKXLaSnD2ZeQhnzfMVuT/HhjEki7CEXb0pwk2uY+Cios4qg7+vcfXnHKFCuqwn6JhMxiLTG5KBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:47.668255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ed4f3527bfd03f3a862b726ab05c58a8a18354c5e36161acb2795aa0f35cb3b","sha256:d2bf86189b6e8b01383fdcb6d6a161b5a4a363a2d0df73b2333c91e8ee902d5b"],"state_sha256":"c794c9020fa9543e5f5b3b7fd9b02d7c63a416f21e7f029d986c883981bf45b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmp0hQqAZXw43q7wuqR356Bl3/aJo5hJHj4oa8s1z5zeSSjdl17mD1sNd3ZUrh3qnxxHGpYIdVUDeScNILq2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:36:24.173778Z","bundle_sha256":"ef7dbd23a8707c0649686a3f397ff67b9d9c0e1429066205934124c20ff98f1c"}}