{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YASH7MTOQBXQZ2WKN44QSKAUHA","short_pith_number":"pith:YASH7MTO","canonical_record":{"source":{"id":"1609.04905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-16T03:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"09a6436295b7b0daf333213808cc7d0f208baa05e170f91b651358e76310e1dc","abstract_canon_sha256":"370723b1fee2f6852b5222e6c817243aad03faa09cb339879194fe913b354f20"},"schema_version":"1.0"},"canonical_sha256":"c0247fb26e806f0ceaca6f39092814382c76c53160d74d6c04e5827641ab2586","source":{"kind":"arxiv","id":"1609.04905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04905","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04905v1","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04905","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"YASH7MTOQBXQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YASH7MTOQBXQZ2WK","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YASH7MTO","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YASH7MTOQBXQZ2WKN44QSKAUHA","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-16T03:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"09a6436295b7b0daf333213808cc7d0f208baa05e170f91b651358e76310e1dc","abstract_canon_sha256":"370723b1fee2f6852b5222e6c817243aad03faa09cb339879194fe913b354f20"},"schema_version":"1.0"},"canonical_sha256":"c0247fb26e806f0ceaca6f39092814382c76c53160d74d6c04e5827641ab2586","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:32.152775Z","signature_b64":"luEMkv3H/V2mviYoKFvb9oGlwN8KFOYpDrcJgoZjo+tUut9KZJdhfC6YYqSup+EOI8pe2Pxt4djrbNmZ90oXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0247fb26e806f0ceaca6f39092814382c76c53160d74d6c04e5827641ab2586","last_reissued_at":"2026-05-18T01:04:32.152054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:32.152054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04905","source_version":1,"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-18T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOtYEp2UjVO3kuvuDRladR5W8dMl/LBwxZlHJiGCkfJ603lDG4o+THYZrR/cQD7QDOgebOKA2TBp+NJdLW5zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:42:02.018722Z"},"content_sha256":"2a5bf63286b6f470dfc63af8a55d191a7935576ec9201c43802ccc77d8306d3e","schema_version":"1.0","event_id":"sha256:2a5bf63286b6f470dfc63af8a55d191a7935576ec9201c43802ccc77d8306d3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YASH7MTOQBXQZ2WKN44QSKAUHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated gradient sliding for structured convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Yuyuan Ouyang","submitted_at":"2016-09-16T03:48:45Z","abstract_excerpt":"Our main goal in this paper is to show that one can skip gradient computations for gradient descent type methods applied to certain structured convex programming (CP) problems. To this end, we first present an accelerated gradient sliding (AGS) method for minimizing the summation of two smooth convex functions with different Lipschitz constants. We show that the AGS method can skip the gradient computation for one of these smooth components without slowing down the overall optimal rate of convergence. This result is much sharper than the classic black-box CP complexity results especially when "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04905","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"},"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-18T01:04:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXgnG3bIB24kUMWkEi4pbpo7dqcPge5Zy0eH/iRZSScqhR24vRoa/M8ABrB7RX/FhzfCAYeQ/EtwgTjsouKOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:42:02.019083Z"},"content_sha256":"1cbc90a533c783aef91e2de468b03194669282afb0387b1d285a90d342fbd7e4","schema_version":"1.0","event_id":"sha256:1cbc90a533c783aef91e2de468b03194669282afb0387b1d285a90d342fbd7e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YASH7MTOQBXQZ2WKN44QSKAUHA/bundle.json","state_url":"https://pith.science/pith/YASH7MTOQBXQZ2WKN44QSKAUHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YASH7MTOQBXQZ2WKN44QSKAUHA/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-05T16:42:02Z","links":{"resolver":"https://pith.science/pith/YASH7MTOQBXQZ2WKN44QSKAUHA","bundle":"https://pith.science/pith/YASH7MTOQBXQZ2WKN44QSKAUHA/bundle.json","state":"https://pith.science/pith/YASH7MTOQBXQZ2WKN44QSKAUHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YASH7MTOQBXQZ2WKN44QSKAUHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YASH7MTOQBXQZ2WKN44QSKAUHA","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":"370723b1fee2f6852b5222e6c817243aad03faa09cb339879194fe913b354f20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-16T03:48:45Z","title_canon_sha256":"09a6436295b7b0daf333213808cc7d0f208baa05e170f91b651358e76310e1dc"},"schema_version":"1.0","source":{"id":"1609.04905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04905","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04905v1","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04905","created_at":"2026-05-18T01:04:32Z"},{"alias_kind":"pith_short_12","alias_value":"YASH7MTOQBXQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YASH7MTOQBXQZ2WK","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YASH7MTO","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:1cbc90a533c783aef91e2de468b03194669282afb0387b1d285a90d342fbd7e4","target":"graph","created_at":"2026-05-18T01:04:32Z","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":"Our main goal in this paper is to show that one can skip gradient computations for gradient descent type methods applied to certain structured convex programming (CP) problems. To this end, we first present an accelerated gradient sliding (AGS) method for minimizing the summation of two smooth convex functions with different Lipschitz constants. We show that the AGS method can skip the gradient computation for one of these smooth components without slowing down the overall optimal rate of convergence. This result is much sharper than the classic black-box CP complexity results especially when ","authors_text":"Guanghui Lan, Yuyuan Ouyang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-16T03:48:45Z","title":"Accelerated gradient sliding for structured convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04905","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:2a5bf63286b6f470dfc63af8a55d191a7935576ec9201c43802ccc77d8306d3e","target":"record","created_at":"2026-05-18T01:04:32Z","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":"370723b1fee2f6852b5222e6c817243aad03faa09cb339879194fe913b354f20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-16T03:48:45Z","title_canon_sha256":"09a6436295b7b0daf333213808cc7d0f208baa05e170f91b651358e76310e1dc"},"schema_version":"1.0","source":{"id":"1609.04905","kind":"arxiv","version":1}},"canonical_sha256":"c0247fb26e806f0ceaca6f39092814382c76c53160d74d6c04e5827641ab2586","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0247fb26e806f0ceaca6f39092814382c76c53160d74d6c04e5827641ab2586","first_computed_at":"2026-05-18T01:04:32.152054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:32.152054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"luEMkv3H/V2mviYoKFvb9oGlwN8KFOYpDrcJgoZjo+tUut9KZJdhfC6YYqSup+EOI8pe2Pxt4djrbNmZ90oXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:32.152775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a5bf63286b6f470dfc63af8a55d191a7935576ec9201c43802ccc77d8306d3e","sha256:1cbc90a533c783aef91e2de468b03194669282afb0387b1d285a90d342fbd7e4"],"state_sha256":"84e44fd84cd4aea87873c595cce067a09d708e536f3c9b473475afa6a1742eb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6S/5uVYgmim0QS/jTA9TQNDNXqnNvZIwFimcBAGZf8Um9IDolRsSbhwvfWHWomFUW3aQB7YWxMxJIIofinaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:42:02.021198Z","bundle_sha256":"6e9cd9a45f744e583980ac39f3dd7d7b593772fc316d983a6bf8b5b4cd787108"}}