{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CL75DFTXADF5LR4EL5LQGZA35M","short_pith_number":"pith:CL75DFTX","canonical_record":{"source":{"id":"1908.00218","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-01T05:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"f6a9a82cbf350caaf32c4bd0e20a73743dd9598b3645f14574b3426e8f4c309d","abstract_canon_sha256":"f331533d642058299a8694d97f6ef3543b9c52ee67d6b1b489ebf88303e34d9f"},"schema_version":"1.0"},"canonical_sha256":"12ffd1967700cbd5c7845f5703641beb3ef96ddfb0005863f90026467768d37c","source":{"kind":"arxiv","id":"1908.00218","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00218","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00218v6","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00218","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"CL75DFTXADF5","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"pith_short_16","alias_value":"CL75DFTXADF5LR4E","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"pith_short_8","alias_value":"CL75DFTX","created_at":"2026-07-05T03:44:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CL75DFTXADF5LR4EL5LQGZA35M","target":"record","payload":{"canonical_record":{"source":{"id":"1908.00218","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-01T05:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"f6a9a82cbf350caaf32c4bd0e20a73743dd9598b3645f14574b3426e8f4c309d","abstract_canon_sha256":"f331533d642058299a8694d97f6ef3543b9c52ee67d6b1b489ebf88303e34d9f"},"schema_version":"1.0"},"canonical_sha256":"12ffd1967700cbd5c7845f5703641beb3ef96ddfb0005863f90026467768d37c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:26.893107Z","signature_b64":"u+Lm3NTZpBn1vnPvGgwa5wY1NdD+yobmQKJT36ox9lgJvk3bvZqewAdgmqByohBoLCFC0CUmtrhrLiX716KCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12ffd1967700cbd5c7845f5703641beb3ef96ddfb0005863f90026467768d37c","last_reissued_at":"2026-07-05T03:44:26.892584Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:26.892584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.00218","source_version":6,"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-07-05T03:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIZYi5V8j24VxNIT7Vfpklm3pnECfb4LCYMeo5SjXWPwNxEWrX1/84YQrg/LDd4ZaKnSSuimOnnjuyknUTyYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:35:29.336014Z"},"content_sha256":"21aacf889ed11d5f65a4b3ff5fa10d299e872ee6f6d869308061daccd3beef49","schema_version":"1.0","event_id":"sha256:21aacf889ed11d5f65a4b3ff5fa10d299e872ee6f6d869308061daccd3beef49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CL75DFTXADF5LR4EL5LQGZA35M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mirror Descent for Constrained Optimization Problems with Large Subgradient Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Titov, Alexey Stepanov, Fedor Stonyakin","submitted_at":"2019-08-01T05:38:57Z","abstract_excerpt":"Based on the ideas of arXiv:1710.06612, we consider the problem of minimization of the Holder-continuous non-smooth functional $f$ with non-positive convex (generally, non-smooth) Lipschitz-continuous functional constraint. We propose some novel strategies of step-sizes and adaptive stopping rules in Mirror Descent algorithms for the considered class of problems. It is shown that the methods are applicable to the objective functionals of various levels of smoothness. Applying the restart technique to the Mirror Descent Algorithm there was proposed an optimal method to solve optimization proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00218","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.00218/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:44:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaRKnkj9fbRr60B+Ic0WBSgbs/D105VkNfByUnhrDks1OWlcDKKXrn6McdFRosXvmyxm9lZr6IVXR/fwaeX1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:35:29.336528Z"},"content_sha256":"95464d4ac42bf5227d75d87884e7870d12c3a97e4229b8ad699e0f57fc0b399e","schema_version":"1.0","event_id":"sha256:95464d4ac42bf5227d75d87884e7870d12c3a97e4229b8ad699e0f57fc0b399e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CL75DFTXADF5LR4EL5LQGZA35M/bundle.json","state_url":"https://pith.science/pith/CL75DFTXADF5LR4EL5LQGZA35M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CL75DFTXADF5LR4EL5LQGZA35M/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-08-15T10:35:29Z","links":{"resolver":"https://pith.science/pith/CL75DFTXADF5LR4EL5LQGZA35M","bundle":"https://pith.science/pith/CL75DFTXADF5LR4EL5LQGZA35M/bundle.json","state":"https://pith.science/pith/CL75DFTXADF5LR4EL5LQGZA35M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CL75DFTXADF5LR4EL5LQGZA35M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CL75DFTXADF5LR4EL5LQGZA35M","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":"f331533d642058299a8694d97f6ef3543b9c52ee67d6b1b489ebf88303e34d9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-01T05:38:57Z","title_canon_sha256":"f6a9a82cbf350caaf32c4bd0e20a73743dd9598b3645f14574b3426e8f4c309d"},"schema_version":"1.0","source":{"id":"1908.00218","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00218","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00218v6","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00218","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"pith_short_12","alias_value":"CL75DFTXADF5","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"pith_short_16","alias_value":"CL75DFTXADF5LR4E","created_at":"2026-07-05T03:44:26Z"},{"alias_kind":"pith_short_8","alias_value":"CL75DFTX","created_at":"2026-07-05T03:44:26Z"}],"graph_snapshots":[{"event_id":"sha256:95464d4ac42bf5227d75d87884e7870d12c3a97e4229b8ad699e0f57fc0b399e","target":"graph","created_at":"2026-07-05T03:44:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.00218/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Based on the ideas of arXiv:1710.06612, we consider the problem of minimization of the Holder-continuous non-smooth functional $f$ with non-positive convex (generally, non-smooth) Lipschitz-continuous functional constraint. We propose some novel strategies of step-sizes and adaptive stopping rules in Mirror Descent algorithms for the considered class of problems. It is shown that the methods are applicable to the objective functionals of various levels of smoothness. Applying the restart technique to the Mirror Descent Algorithm there was proposed an optimal method to solve optimization proble","authors_text":"Alexander Gasnikov, Alexander Titov, Alexey Stepanov, Fedor Stonyakin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-01T05:38:57Z","title":"Mirror Descent for Constrained Optimization Problems with Large Subgradient Values"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00218","kind":"arxiv","version":6},"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:21aacf889ed11d5f65a4b3ff5fa10d299e872ee6f6d869308061daccd3beef49","target":"record","created_at":"2026-07-05T03:44:26Z","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":"f331533d642058299a8694d97f6ef3543b9c52ee67d6b1b489ebf88303e34d9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-01T05:38:57Z","title_canon_sha256":"f6a9a82cbf350caaf32c4bd0e20a73743dd9598b3645f14574b3426e8f4c309d"},"schema_version":"1.0","source":{"id":"1908.00218","kind":"arxiv","version":6}},"canonical_sha256":"12ffd1967700cbd5c7845f5703641beb3ef96ddfb0005863f90026467768d37c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12ffd1967700cbd5c7845f5703641beb3ef96ddfb0005863f90026467768d37c","first_computed_at":"2026-07-05T03:44:26.892584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:26.892584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u+Lm3NTZpBn1vnPvGgwa5wY1NdD+yobmQKJT36ox9lgJvk3bvZqewAdgmqByohBoLCFC0CUmtrhrLiX716KCDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:26.893107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00218","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21aacf889ed11d5f65a4b3ff5fa10d299e872ee6f6d869308061daccd3beef49","sha256:95464d4ac42bf5227d75d87884e7870d12c3a97e4229b8ad699e0f57fc0b399e"],"state_sha256":"3db3896d58ac972a56a5f805cdf1a0b37c4feb4e6d777b185f48e58337835cc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tcmbkToK3wvAGm+w2FCtg739D5birLRGAJrl3mGsscPAbdYU/aWQATg9npuoRe+70qyt2hQlYlVLQMsVR2KBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T10:35:29.340344Z","bundle_sha256":"68a917fac4b564cc8c3dbd7da240182b0ccb7eb02917f58b43dc8ddb0cc2c0a9"}}