{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LJFOHPKTFPS5RU4SGLUYAOHCLQ","short_pith_number":"pith:LJFOHPKT","schema_version":"1.0","canonical_sha256":"5a4ae3bd532be5d8d39232e98038e25c379dfab54311f50e8fa449b11092cea4","source":{"kind":"arxiv","id":"1805.10679","version":1},"attestation_state":"computed","paper":{"title":"Adaptive algorithms for mirror descent in convex programming problems with Lipschitz constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexey N. Stepanov, Fedor S. Stonyakin, Maxim A. Barinov, Mohammad S. Alkousa","submitted_at":"2018-05-27T20:04:08Z","abstract_excerpt":"The paper is devoted to new modifications of recently proposed adaptive methods of Mirror Descent for convex minimization problems in the case of several convex functional constraints. Methods for problems of two classes are considered. The first type of problems with Lipschitz-continuous objective (generally speaking, nonsmooth) functional. The second one is for problems with a Lipschitz-continuous gradient of the objective smooth functional. We consider the class of problems with a non-smooth objective functional equal to the maximum of smooth functionals with a Lipschitz-continuous gradient"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.10679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T20:04:08Z","cross_cats_sorted":[],"title_canon_sha256":"6d69f9baaf70349962857d34e76838bc4cea34fc01d3aaf2a3f8589051f97322","abstract_canon_sha256":"6c5a58caedcea4263358060377ea2fd67c5aa04bbbc4ff50e6b7ada726725464"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.743447Z","signature_b64":"7MK8KSKTGPKBDYCvQ8J3ibBNfPjKAN8/rRXxDoEEMdkRAFF+cWGWpeQu4MjF3LmFSi5kUhQGcgYNaY1b+rC5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a4ae3bd532be5d8d39232e98038e25c379dfab54311f50e8fa449b11092cea4","last_reissued_at":"2026-05-18T00:14:51.742789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.742789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive algorithms for mirror descent in convex programming problems with Lipschitz constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexey N. Stepanov, Fedor S. Stonyakin, Maxim A. Barinov, Mohammad S. Alkousa","submitted_at":"2018-05-27T20:04:08Z","abstract_excerpt":"The paper is devoted to new modifications of recently proposed adaptive methods of Mirror Descent for convex minimization problems in the case of several convex functional constraints. Methods for problems of two classes are considered. The first type of problems with Lipschitz-continuous objective (generally speaking, nonsmooth) functional. The second one is for problems with a Lipschitz-continuous gradient of the objective smooth functional. We consider the class of problems with a non-smooth objective functional equal to the maximum of smooth functionals with a Lipschitz-continuous gradient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10679","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.10679","created_at":"2026-05-18T00:14:51.742874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10679v1","created_at":"2026-05-18T00:14:51.742874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10679","created_at":"2026-05-18T00:14:51.742874+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJFOHPKTFPS5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJFOHPKTFPS5RU4S","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJFOHPKT","created_at":"2026-05-18T12:32:37.024351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ","json":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ.json","graph_json":"https://pith.science/api/pith-number/LJFOHPKTFPS5RU4SGLUYAOHCLQ/graph.json","events_json":"https://pith.science/api/pith-number/LJFOHPKTFPS5RU4SGLUYAOHCLQ/events.json","paper":"https://pith.science/paper/LJFOHPKT"},"agent_actions":{"view_html":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ","download_json":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ.json","view_paper":"https://pith.science/paper/LJFOHPKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10679&json=true","fetch_graph":"https://pith.science/api/pith-number/LJFOHPKTFPS5RU4SGLUYAOHCLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LJFOHPKTFPS5RU4SGLUYAOHCLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ/action/storage_attestation","attest_author":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ/action/author_attestation","sign_citation":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ/action/citation_signature","submit_replication":"https://pith.science/pith/LJFOHPKTFPS5RU4SGLUYAOHCLQ/action/replication_record"}},"created_at":"2026-05-18T00:14:51.742874+00:00","updated_at":"2026-05-18T00:14:51.742874+00:00"}