{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:HUITCSJYJN63SRDQ6ERTQQDKXW","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":"2b98679cce7823ffb4b0d9b9024c04364b60b499d311984b06165071644d250a","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-30T14:28:02Z","title_canon_sha256":"7fa6bf9cf4133a699daa84a0e8300b0326a9b60cdd5e0746a32d79e5f82963a8"},"schema_version":"1.0","source":{"id":"2205.15136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.15136","created_at":"2026-07-05T04:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"2205.15136v1","created_at":"2026-07-05T04:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15136","created_at":"2026-07-05T04:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"HUITCSJYJN63","created_at":"2026-07-05T04:27:24Z"},{"alias_kind":"pith_short_16","alias_value":"HUITCSJYJN63SRDQ","created_at":"2026-07-05T04:27:24Z"},{"alias_kind":"pith_short_8","alias_value":"HUITCSJY","created_at":"2026-07-05T04:27:24Z"}],"graph_snapshots":[{"event_id":"sha256:77f2856c8f62af245cd3d31bbdd604aea6236e1a9964baf8974b5c8142c4d1a5","target":"graph","created_at":"2026-07-05T04:27:24Z","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/2205.15136/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study structured convex optimization problems, with additive objective $r:=p + q$, where $r$ is ($\\mu$-strongly) convex, $q$ is $L_q$-smooth and convex, and $p$ is $L_p$-smooth, possibly nonconvex. For such a class of problems, we proposed an inexact accelerated gradient sliding method that can skip the gradient computation for one of these components while still achieving optimal complexity of gradient calls of $p$ and $q$, that is,\n  $\\mathcal{O}(\\sqrt{L_p/\\mu})$ and $\\mathcal{O}(\\sqrt{L_q/\\mu})$, respectively. This result is much sharper than the classic black-box complexity $\\mathcal{O}","authors_text":"Aleksandr Beznosikov, Alexander Gasnikov, Dmitry Kovalev, Ekaterina Borodich, Gesualdo Scutari","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-30T14:28:02Z","title":"Optimal Gradient Sliding and its Application to Distributed Optimization Under Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15136","kind":"arxiv","version":1},"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:4be68b1ac9f0b8d05cebe7a82051e9926e43c5fb9f9638d81c66b011bb7a09b1","target":"record","created_at":"2026-07-05T04:27:24Z","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":"2b98679cce7823ffb4b0d9b9024c04364b60b499d311984b06165071644d250a","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-30T14:28:02Z","title_canon_sha256":"7fa6bf9cf4133a699daa84a0e8300b0326a9b60cdd5e0746a32d79e5f82963a8"},"schema_version":"1.0","source":{"id":"2205.15136","kind":"arxiv","version":1}},"canonical_sha256":"3d113149384b7db94470f12338406abd9f8b6b3adacc05c72b012c9dfff552c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d113149384b7db94470f12338406abd9f8b6b3adacc05c72b012c9dfff552c5","first_computed_at":"2026-07-05T04:27:24.913242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:24.913242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uWa2qZfTgWMNHd9zI8axJOYu4wDP7/6cDuEw1TbcpraxlgmMaNauL0xwcDDNpkDSQ+vsrVt9IAvgyG7uAOwaCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:24.913661Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.15136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4be68b1ac9f0b8d05cebe7a82051e9926e43c5fb9f9638d81c66b011bb7a09b1","sha256:77f2856c8f62af245cd3d31bbdd604aea6236e1a9964baf8974b5c8142c4d1a5"],"state_sha256":"22a4e0137daa229261a2262a449502a897b78e5615da1b10284f25992b595ffb"}