{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7MWEUKWZEPVA4CSBYPDYN4XZKX","short_pith_number":"pith:7MWEUKWZ","canonical_record":{"source":{"id":"1710.06612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T08:15:05Z","cross_cats_sorted":[],"title_canon_sha256":"c12f9da68396e8fc48f4992529668b975643153b0bf69af614eb58dedb4a5aaf","abstract_canon_sha256":"8da21730b3ffee8e98ae6c4d98a2f8bdd46eab99a39937050b480ee1c08e23ff"},"schema_version":"1.0"},"canonical_sha256":"fb2c4a2ad923ea0e0a41c3c786f2f955ffb9a73a0f284d01fbbcb07c075b5ec0","source":{"kind":"arxiv","id":"1710.06612","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06612","created_at":"2026-05-18T00:24:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06612v2","created_at":"2026-05-18T00:24:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06612","created_at":"2026-05-18T00:24:59Z"},{"alias_kind":"pith_short_12","alias_value":"7MWEUKWZEPVA","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MWEUKWZEPVA4CSB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MWEUKWZ","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7MWEUKWZEPVA4CSBYPDYN4XZKX","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T08:15:05Z","cross_cats_sorted":[],"title_canon_sha256":"c12f9da68396e8fc48f4992529668b975643153b0bf69af614eb58dedb4a5aaf","abstract_canon_sha256":"8da21730b3ffee8e98ae6c4d98a2f8bdd46eab99a39937050b480ee1c08e23ff"},"schema_version":"1.0"},"canonical_sha256":"fb2c4a2ad923ea0e0a41c3c786f2f955ffb9a73a0f284d01fbbcb07c075b5ec0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:59.531164Z","signature_b64":"iODSKQRFZ0iD8+RE1Mr/fFJhtUggkDHJ3JAbpy4kqwi87srggR2sXaUiwl9fZ/5uLS6Z4IzaxL/ANVu/tZ1FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb2c4a2ad923ea0e0a41c3c786f2f955ffb9a73a0f284d01fbbcb07c075b5ec0","last_reissued_at":"2026-05-18T00:24:59.530546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:59.530546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06612","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:24:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsxiywBTxOv38aYd/LxoO66ETihk7dcC0vx0wLEO1/DwNFXOE2kdQtZmnSfgcccSwendaAdW5bbSCCSzu5kBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:04:15.181896Z"},"content_sha256":"ae97e189cfc29e06112e2eb1d16080e537464f95803471de15b6291dcceb5b28","schema_version":"1.0","event_id":"sha256:ae97e189cfc29e06112e2eb1d16080e537464f95803471de15b6291dcceb5b28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7MWEUKWZEPVA4CSBYPDYN4XZKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Titov, Anastasia Bayandina, Fedor Stonyakin, Pavel Dvurechensky","submitted_at":"2017-10-18T08:15:05Z","abstract_excerpt":"We consider the problem of minimization of a convex function on a simple set with convex non-smooth inequality constraint and describe first-order methods to solve such problems in different situations: smooth or non-smooth objective function; convex or strongly convex objective and constraint; deterministic or randomized information about the objective and constraint. We hope that it is convenient for a reader to have all the methods for different settings in one place. Described methods are based on Mirror Descent algorithm and switching subgradient scheme. One of our focus is to propose, fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06612","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:24:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cr6vQZPxxJfgvzCYpYnNz+qSbtNPp1GztpOnHWWTM2H+wpvSL7fc9+AMRztpWT3eJFDUQAB4WYIY/vratBsIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:04:15.182230Z"},"content_sha256":"7019e9be1a98bbb2c22a53e2df032d4c849f9a5e0b11e76414ac307a3ec27657","schema_version":"1.0","event_id":"sha256:7019e9be1a98bbb2c22a53e2df032d4c849f9a5e0b11e76414ac307a3ec27657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MWEUKWZEPVA4CSBYPDYN4XZKX/bundle.json","state_url":"https://pith.science/pith/7MWEUKWZEPVA4CSBYPDYN4XZKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MWEUKWZEPVA4CSBYPDYN4XZKX/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-02T08:04:15Z","links":{"resolver":"https://pith.science/pith/7MWEUKWZEPVA4CSBYPDYN4XZKX","bundle":"https://pith.science/pith/7MWEUKWZEPVA4CSBYPDYN4XZKX/bundle.json","state":"https://pith.science/pith/7MWEUKWZEPVA4CSBYPDYN4XZKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MWEUKWZEPVA4CSBYPDYN4XZKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7MWEUKWZEPVA4CSBYPDYN4XZKX","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":"8da21730b3ffee8e98ae6c4d98a2f8bdd46eab99a39937050b480ee1c08e23ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T08:15:05Z","title_canon_sha256":"c12f9da68396e8fc48f4992529668b975643153b0bf69af614eb58dedb4a5aaf"},"schema_version":"1.0","source":{"id":"1710.06612","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06612","created_at":"2026-05-18T00:24:59Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06612v2","created_at":"2026-05-18T00:24:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06612","created_at":"2026-05-18T00:24:59Z"},{"alias_kind":"pith_short_12","alias_value":"7MWEUKWZEPVA","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7MWEUKWZEPVA4CSB","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7MWEUKWZ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:7019e9be1a98bbb2c22a53e2df032d4c849f9a5e0b11e76414ac307a3ec27657","target":"graph","created_at":"2026-05-18T00:24:59Z","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":"We consider the problem of minimization of a convex function on a simple set with convex non-smooth inequality constraint and describe first-order methods to solve such problems in different situations: smooth or non-smooth objective function; convex or strongly convex objective and constraint; deterministic or randomized information about the objective and constraint. We hope that it is convenient for a reader to have all the methods for different settings in one place. Described methods are based on Mirror Descent algorithm and switching subgradient scheme. One of our focus is to propose, fo","authors_text":"Alexander Gasnikov, Alexander Titov, Anastasia Bayandina, Fedor Stonyakin, Pavel Dvurechensky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T08:15:05Z","title":"Mirror Descent and Convex Optimization Problems With Non-Smooth Inequality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06612","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:ae97e189cfc29e06112e2eb1d16080e537464f95803471de15b6291dcceb5b28","target":"record","created_at":"2026-05-18T00:24:59Z","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":"8da21730b3ffee8e98ae6c4d98a2f8bdd46eab99a39937050b480ee1c08e23ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-18T08:15:05Z","title_canon_sha256":"c12f9da68396e8fc48f4992529668b975643153b0bf69af614eb58dedb4a5aaf"},"schema_version":"1.0","source":{"id":"1710.06612","kind":"arxiv","version":2}},"canonical_sha256":"fb2c4a2ad923ea0e0a41c3c786f2f955ffb9a73a0f284d01fbbcb07c075b5ec0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb2c4a2ad923ea0e0a41c3c786f2f955ffb9a73a0f284d01fbbcb07c075b5ec0","first_computed_at":"2026-05-18T00:24:59.530546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:59.530546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iODSKQRFZ0iD8+RE1Mr/fFJhtUggkDHJ3JAbpy4kqwi87srggR2sXaUiwl9fZ/5uLS6Z4IzaxL/ANVu/tZ1FAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:59.531164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06612","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae97e189cfc29e06112e2eb1d16080e537464f95803471de15b6291dcceb5b28","sha256:7019e9be1a98bbb2c22a53e2df032d4c849f9a5e0b11e76414ac307a3ec27657"],"state_sha256":"54b03a397a5ded4991ef6f87bbd818e2106ac33ca0ccba1312994177dc3a1eef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZfWRFXgJW/hY4TJz4Rw3MTtv+9oy639nK/yNRIhZaALSru83exAcqc41xFrvAuw7W4ojAebBQIgqiasIuP8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:04:15.184410Z","bundle_sha256":"819b3b81465e9745de92b720d8741401a551f6c1949b0f51ca2fb8b0b4b2204e"}}