{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6CSU53FVUSNRC6SULGJH3URDR7","short_pith_number":"pith:6CSU53FV","canonical_record":{"source":{"id":"1109.2415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T09:45:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1341921bcae838e515e53b43f4b558b64e71ec5818dbd3f1bbfd70fd277aacde","abstract_canon_sha256":"b48ff6a5bc2a1c6b114e369efa44c743c93efe328707056f0d8c5e7226616e25"},"schema_version":"1.0"},"canonical_sha256":"f0a54eecb5a49b117a5459927dd2238fe0905b5e3b80c27f85e1469c67ffbb7d","source":{"kind":"arxiv","id":"1109.2415","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2415","created_at":"2026-05-18T04:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2415v2","created_at":"2026-05-18T04:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2415","created_at":"2026-05-18T04:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"6CSU53FVUSNR","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6CSU53FVUSNRC6SU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6CSU53FV","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6CSU53FVUSNRC6SULGJH3URDR7","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2415","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T09:45:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"1341921bcae838e515e53b43f4b558b64e71ec5818dbd3f1bbfd70fd277aacde","abstract_canon_sha256":"b48ff6a5bc2a1c6b114e369efa44c743c93efe328707056f0d8c5e7226616e25"},"schema_version":"1.0"},"canonical_sha256":"f0a54eecb5a49b117a5459927dd2238fe0905b5e3b80c27f85e1469c67ffbb7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:17.487128Z","signature_b64":"wa78VqamHDxHn8I1JoeG97h2WV8GLUzXBvJS+DM37ZtwXEjTOC0VQxu97WW0wlJTrjM8L7wXXvvLVYK0fLMIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a54eecb5a49b117a5459927dd2238fe0905b5e3b80c27f85e1469c67ffbb7d","last_reissued_at":"2026-05-18T04:07:17.486302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:17.486302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2415","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-18T04:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qdwgs/vi+FBRoFC2ANTnDh848vjndkUXsr9qpJ8rtFMIOWaJfFNVRNQYoxEZTqTvH/rqn5Ipp1EoOGZCEArnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:45:06.832161Z"},"content_sha256":"85c3f5f1c3896ff699aada89bfef1c61aa818a1bdf3bc84f932ae45573f6b6c0","schema_version":"1.0","event_id":"sha256:85c3f5f1c3896ff699aada89bfef1c61aa818a1bdf3bc84f932ae45573f6b6c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6CSU53FVUSNRC6SULGJH3URDR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, LIENS), Mark Schmidt (INRIA Paris - Rocquencourt, Nicolas Le Roux (INRIA Paris - Rocquencourt","submitted_at":"2011-09-12T09:45:02Z","abstract_excerpt":"We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term. We show that both the basic proximal-gradient method and the accelerated proximal-gradient method achieve the same convergence rate as in the error-free case, provided that the errors decrease at appropriate rates.Using these rates, we perform as well as or better than a carefully chosen fixed error level on a se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2415","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-18T04:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Tbmh9CTRivGiPNGGnNTaTphipzj2NlOGCmRC1yeypU0DGKtRsWiPJucysywofbOjw/Ibhuvi1wR1yrpoW0vAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:45:06.832845Z"},"content_sha256":"8b11b5678f734a11c2607c46035347f9d9bc53ce127701b4ba8f083b8644e66d","schema_version":"1.0","event_id":"sha256:8b11b5678f734a11c2607c46035347f9d9bc53ce127701b4ba8f083b8644e66d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/bundle.json","state_url":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CSU53FVUSNRC6SULGJH3URDR7/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-05-25T14:45:06Z","links":{"resolver":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7","bundle":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/bundle.json","state":"https://pith.science/pith/6CSU53FVUSNRC6SULGJH3URDR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CSU53FVUSNRC6SULGJH3URDR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6CSU53FVUSNRC6SULGJH3URDR7","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":"b48ff6a5bc2a1c6b114e369efa44c743c93efe328707056f0d8c5e7226616e25","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T09:45:02Z","title_canon_sha256":"1341921bcae838e515e53b43f4b558b64e71ec5818dbd3f1bbfd70fd277aacde"},"schema_version":"1.0","source":{"id":"1109.2415","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2415","created_at":"2026-05-18T04:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2415v2","created_at":"2026-05-18T04:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2415","created_at":"2026-05-18T04:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"6CSU53FVUSNR","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6CSU53FVUSNRC6SU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6CSU53FV","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:8b11b5678f734a11c2607c46035347f9d9bc53ce127701b4ba8f083b8644e66d","target":"graph","created_at":"2026-05-18T04:07:17Z","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 optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term. We show that both the basic proximal-gradient method and the accelerated proximal-gradient method achieve the same convergence rate as in the error-free case, provided that the errors decrease at appropriate rates.Using these rates, we perform as well as or better than a carefully chosen fixed error level on a se","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, LIENS), Mark Schmidt (INRIA Paris - Rocquencourt, Nicolas Le Roux (INRIA Paris - Rocquencourt","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T09:45:02Z","title":"Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2415","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:85c3f5f1c3896ff699aada89bfef1c61aa818a1bdf3bc84f932ae45573f6b6c0","target":"record","created_at":"2026-05-18T04:07:17Z","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":"b48ff6a5bc2a1c6b114e369efa44c743c93efe328707056f0d8c5e7226616e25","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T09:45:02Z","title_canon_sha256":"1341921bcae838e515e53b43f4b558b64e71ec5818dbd3f1bbfd70fd277aacde"},"schema_version":"1.0","source":{"id":"1109.2415","kind":"arxiv","version":2}},"canonical_sha256":"f0a54eecb5a49b117a5459927dd2238fe0905b5e3b80c27f85e1469c67ffbb7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a54eecb5a49b117a5459927dd2238fe0905b5e3b80c27f85e1469c67ffbb7d","first_computed_at":"2026-05-18T04:07:17.486302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:17.486302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wa78VqamHDxHn8I1JoeG97h2WV8GLUzXBvJS+DM37ZtwXEjTOC0VQxu97WW0wlJTrjM8L7wXXvvLVYK0fLMIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:17.487128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2415","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85c3f5f1c3896ff699aada89bfef1c61aa818a1bdf3bc84f932ae45573f6b6c0","sha256:8b11b5678f734a11c2607c46035347f9d9bc53ce127701b4ba8f083b8644e66d"],"state_sha256":"d8859c20eb54b07d8636679ca9cecff7b137fbf8d2b9cbb34df63dc0b85fa85a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQ/YWZ9yCexXNhcLKhKFMqLtxEvxRYlaxyYzgWBS9B2FASAZ9+7yKSeY3Fb7myg5Hd6R08ddJE3/Q6A9lVfeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:45:06.836849Z","bundle_sha256":"605f70e0bed7d9a57ed64fa1a8f5003e7d295dc3da4fdb2f22601c0aea2ea44c"}}