{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:42W3RUMPPERD72OI7GJEM6SHTJ","short_pith_number":"pith:42W3RUMP","canonical_record":{"source":{"id":"1710.04718","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-12T20:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"c233d01e7d72088fa53529877e30c8c7bc57130302f31fd14fb24d5812a6d2eb","abstract_canon_sha256":"6b51402f3670b71b8d48e75a4169a686647200bc3b68fa28ac4e1b65880b1392"},"schema_version":"1.0"},"canonical_sha256":"e6adb8d18f79223fe9c8f992467a479a6648c66e431ce276a00e5b50e464c23b","source":{"kind":"arxiv","id":"1710.04718","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04718","created_at":"2026-05-18T00:08:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04718v3","created_at":"2026-05-18T00:08:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04718","created_at":"2026-05-18T00:08:15Z"},{"alias_kind":"pith_short_12","alias_value":"42W3RUMPPERD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"42W3RUMPPERD72OI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"42W3RUMP","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:42W3RUMPPERD72OI7GJEM6SHTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04718","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-12T20:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"c233d01e7d72088fa53529877e30c8c7bc57130302f31fd14fb24d5812a6d2eb","abstract_canon_sha256":"6b51402f3670b71b8d48e75a4169a686647200bc3b68fa28ac4e1b65880b1392"},"schema_version":"1.0"},"canonical_sha256":"e6adb8d18f79223fe9c8f992467a479a6648c66e431ce276a00e5b50e464c23b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:15.877440Z","signature_b64":"2WwYMwxkGp2VSXCIYlYg1K3gppX8FX09DS+NwUL+zH2W4lxUhAA5RZAMAFiK89BHqBn0TuSijg7ZxHbbflUhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6adb8d18f79223fe9c8f992467a479a6648c66e431ce276a00e5b50e464c23b","last_reissued_at":"2026-05-18T00:08:15.876937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:15.876937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04718","source_version":3,"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:08:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AB6iN84xa+twm/J/T0vtBePdJoEzq/C8Vh7wXu23vnUriH5ymeGNXWFV5X6tz/TS5yJ2v3BHMCBmnTTDM/osAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:31:44.565267Z"},"content_sha256":"cc73d5b5a1d469e0fa2a034c2d33649e64765a777364712231d24258dd4b12a9","schema_version":"1.0","event_id":"sha256:cc73d5b5a1d469e0fa2a034c2d33649e64765a777364712231d24258dd4b12a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:42W3RUMPPERD72OI7GJEM6SHTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"\"Relative-Continuity\" for Non-Lipschitz Non-Smooth Convex Optimization using Stochastic (or Deterministic) Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu","submitted_at":"2017-10-12T20:56:25Z","abstract_excerpt":"The usual approach to developing and analyzing first-order methods for non-smooth (stochastic or deterministic) convex optimization assumes that the objective function is uniformly Lipschitz continuous with parameter $M_f$. However, in many settings the non-differentiable convex function $f(\\cdot)$ is not uniformly Lipschitz continuous -- for example (i) the classical support vector machine (SVM) problem, (ii) the problem of minimizing the maximum of convex quadratic functions, and even (iii) the univariate setting with $f(x) := \\max\\{0, x\\} + x^2$. Herein we develop a notion of \"relative cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04718","kind":"arxiv","version":3},"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:08:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/d1ZD5/SFFlhypig0PiaWY289RcgcAIIBZCCtb5rKV9oxy+HLSPfxS6jWOfKL7bzFp7KKieuybAIAnnJQ1YbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:31:44.565641Z"},"content_sha256":"7f200bd40140a8b8b7952d7361ef97fb958c8ed46b55c02529d3669788cc3399","schema_version":"1.0","event_id":"sha256:7f200bd40140a8b8b7952d7361ef97fb958c8ed46b55c02529d3669788cc3399"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/bundle.json","state_url":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42W3RUMPPERD72OI7GJEM6SHTJ/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-12T08:31:44Z","links":{"resolver":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ","bundle":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/bundle.json","state":"https://pith.science/pith/42W3RUMPPERD72OI7GJEM6SHTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42W3RUMPPERD72OI7GJEM6SHTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:42W3RUMPPERD72OI7GJEM6SHTJ","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":"6b51402f3670b71b8d48e75a4169a686647200bc3b68fa28ac4e1b65880b1392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-12T20:56:25Z","title_canon_sha256":"c233d01e7d72088fa53529877e30c8c7bc57130302f31fd14fb24d5812a6d2eb"},"schema_version":"1.0","source":{"id":"1710.04718","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04718","created_at":"2026-05-18T00:08:15Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04718v3","created_at":"2026-05-18T00:08:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04718","created_at":"2026-05-18T00:08:15Z"},{"alias_kind":"pith_short_12","alias_value":"42W3RUMPPERD","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"42W3RUMPPERD72OI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"42W3RUMP","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:7f200bd40140a8b8b7952d7361ef97fb958c8ed46b55c02529d3669788cc3399","target":"graph","created_at":"2026-05-18T00:08:15Z","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":"The usual approach to developing and analyzing first-order methods for non-smooth (stochastic or deterministic) convex optimization assumes that the objective function is uniformly Lipschitz continuous with parameter $M_f$. However, in many settings the non-differentiable convex function $f(\\cdot)$ is not uniformly Lipschitz continuous -- for example (i) the classical support vector machine (SVM) problem, (ii) the problem of minimizing the maximum of convex quadratic functions, and even (iii) the univariate setting with $f(x) := \\max\\{0, x\\} + x^2$. Herein we develop a notion of \"relative cont","authors_text":"Haihao Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-12T20:56:25Z","title":"\"Relative-Continuity\" for Non-Lipschitz Non-Smooth Convex Optimization using Stochastic (or Deterministic) Mirror Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04718","kind":"arxiv","version":3},"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:cc73d5b5a1d469e0fa2a034c2d33649e64765a777364712231d24258dd4b12a9","target":"record","created_at":"2026-05-18T00:08:15Z","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":"6b51402f3670b71b8d48e75a4169a686647200bc3b68fa28ac4e1b65880b1392","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-12T20:56:25Z","title_canon_sha256":"c233d01e7d72088fa53529877e30c8c7bc57130302f31fd14fb24d5812a6d2eb"},"schema_version":"1.0","source":{"id":"1710.04718","kind":"arxiv","version":3}},"canonical_sha256":"e6adb8d18f79223fe9c8f992467a479a6648c66e431ce276a00e5b50e464c23b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6adb8d18f79223fe9c8f992467a479a6648c66e431ce276a00e5b50e464c23b","first_computed_at":"2026-05-18T00:08:15.876937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:15.876937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2WwYMwxkGp2VSXCIYlYg1K3gppX8FX09DS+NwUL+zH2W4lxUhAA5RZAMAFiK89BHqBn0TuSijg7ZxHbbflUhCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:15.877440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04718","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc73d5b5a1d469e0fa2a034c2d33649e64765a777364712231d24258dd4b12a9","sha256:7f200bd40140a8b8b7952d7361ef97fb958c8ed46b55c02529d3669788cc3399"],"state_sha256":"9a72ccf46a2bc53b2b728f04da94b0569b603aac7e8dfd2ca45a7a7c2bb396e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtOHJSacnZ0qovtCauti786QHZhDxnECUtcml4yN9nDaIdQ8VshR3NWKfxJIpECuyPmZQW05yPcYLgfocq7iBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:31:44.567825Z","bundle_sha256":"ba8560993e9208ddc4159fe5a622e65c8026f8c7627c054280d4ec2f95945a2b"}}