{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4MOEBBLWI4EOXLJIY23K52X5C7","short_pith_number":"pith:4MOEBBLW","canonical_record":{"source":{"id":"1510.08740","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:30:50Z","cross_cats_sorted":[],"title_canon_sha256":"375d873936a4e5da9b54adfd343216e1e43f49ac3e9fff2428f277fd1f018787","abstract_canon_sha256":"93d9078ed071a2134d61a6ae98dbf66c494e71486a554a68415d53b4678fe7f4"},"schema_version":"1.0"},"canonical_sha256":"e31c4085764708ebad28c6b6aeeafd17c9181003a1f071f82017fd228a6b68dd","source":{"kind":"arxiv","id":"1510.08740","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08740","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08740v4","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08740","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"4MOEBBLWI4EO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MOEBBLWI4EOXLJI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MOEBBLW","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4MOEBBLWI4EOXLJIY23K52X5C7","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08740","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:30:50Z","cross_cats_sorted":[],"title_canon_sha256":"375d873936a4e5da9b54adfd343216e1e43f49ac3e9fff2428f277fd1f018787","abstract_canon_sha256":"93d9078ed071a2134d61a6ae98dbf66c494e71486a554a68415d53b4678fe7f4"},"schema_version":"1.0"},"canonical_sha256":"e31c4085764708ebad28c6b6aeeafd17c9181003a1f071f82017fd228a6b68dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.870521Z","signature_b64":"bQpvCTDnmxZiH/vaEO9Wv/tx4OvUZnmEcoJunN5e1weUEbLDfQjwnw7TEXLmrdXjklCIufxMYqUXx3/2IkwYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e31c4085764708ebad28c6b6aeeafd17c9181003a1f071f82017fd228a6b68dd","last_reissued_at":"2026-05-18T00:44:18.870080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.870080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08740","source_version":4,"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:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Kk61/FV1gIDp70ePix7wBgQYpXOTzpr6zlfzhz68BbdPDuafES1DNg9g6kjM9Br74zDugPMSHmaNZ3x5joODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:38:40.648358Z"},"content_sha256":"24fd9e2a1ea84129adb454cf2363a347a670c9bc51400c34c3b66b234949ffc4","schema_version":"1.0","event_id":"sha256:24fd9e2a1ea84129adb454cf2363a347a670c9bc51400c34c3b66b234949ffc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4MOEBBLWI4EOXLJIY23K52X5C7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than $1/k^{2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hedy Attouch, Juan Peypouquet","submitted_at":"2015-10-29T15:30:50Z","abstract_excerpt":"The {\\it forward-backward algorithm} is a powerful tool for solving optimization problems with a {\\it additively separable} and {\\it smooth} + {\\it nonsmooth} structure. In the convex setting, a simple but ingenious acceleration scheme developed by Nesterov has been proved useful to improve the theoretical rate of convergence for the function values from the standard $\\mathcal O(k^{-1})$ down to $\\mathcal O(k^{-2})$. In this short paper, we prove that the rate of convergence of a slight variant of Nesterov's accelerated forward-backward method, which produces {\\it convergent} sequences, is act"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08740","kind":"arxiv","version":4},"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:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvUTKR0nXQwpWeHjunbUUpWwNxhUFZxEfezChf9OWQ1EZbeDuIXjpcvax6zH8vJqY5lFQ169aBKzQxq1ZEWoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:38:40.649029Z"},"content_sha256":"a859150ac408a40668949545066fa3deaae664ec335e0be60454da832d7f8dfc","schema_version":"1.0","event_id":"sha256:a859150ac408a40668949545066fa3deaae664ec335e0be60454da832d7f8dfc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/bundle.json","state_url":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MOEBBLWI4EOXLJIY23K52X5C7/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-07T16:38:40Z","links":{"resolver":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7","bundle":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/bundle.json","state":"https://pith.science/pith/4MOEBBLWI4EOXLJIY23K52X5C7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MOEBBLWI4EOXLJIY23K52X5C7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4MOEBBLWI4EOXLJIY23K52X5C7","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":"93d9078ed071a2134d61a6ae98dbf66c494e71486a554a68415d53b4678fe7f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:30:50Z","title_canon_sha256":"375d873936a4e5da9b54adfd343216e1e43f49ac3e9fff2428f277fd1f018787"},"schema_version":"1.0","source":{"id":"1510.08740","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08740","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08740v4","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08740","created_at":"2026-05-18T00:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"4MOEBBLWI4EO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MOEBBLWI4EOXLJI","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MOEBBLW","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:a859150ac408a40668949545066fa3deaae664ec335e0be60454da832d7f8dfc","target":"graph","created_at":"2026-05-18T00:44:18Z","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":"The {\\it forward-backward algorithm} is a powerful tool for solving optimization problems with a {\\it additively separable} and {\\it smooth} + {\\it nonsmooth} structure. In the convex setting, a simple but ingenious acceleration scheme developed by Nesterov has been proved useful to improve the theoretical rate of convergence for the function values from the standard $\\mathcal O(k^{-1})$ down to $\\mathcal O(k^{-2})$. In this short paper, we prove that the rate of convergence of a slight variant of Nesterov's accelerated forward-backward method, which produces {\\it convergent} sequences, is act","authors_text":"Hedy Attouch, Juan Peypouquet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:30:50Z","title":"The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than $1/k^{2}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08740","kind":"arxiv","version":4},"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:24fd9e2a1ea84129adb454cf2363a347a670c9bc51400c34c3b66b234949ffc4","target":"record","created_at":"2026-05-18T00:44:18Z","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":"93d9078ed071a2134d61a6ae98dbf66c494e71486a554a68415d53b4678fe7f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-29T15:30:50Z","title_canon_sha256":"375d873936a4e5da9b54adfd343216e1e43f49ac3e9fff2428f277fd1f018787"},"schema_version":"1.0","source":{"id":"1510.08740","kind":"arxiv","version":4}},"canonical_sha256":"e31c4085764708ebad28c6b6aeeafd17c9181003a1f071f82017fd228a6b68dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e31c4085764708ebad28c6b6aeeafd17c9181003a1f071f82017fd228a6b68dd","first_computed_at":"2026-05-18T00:44:18.870080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:18.870080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQpvCTDnmxZiH/vaEO9Wv/tx4OvUZnmEcoJunN5e1weUEbLDfQjwnw7TEXLmrdXjklCIufxMYqUXx3/2IkwYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:18.870521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08740","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24fd9e2a1ea84129adb454cf2363a347a670c9bc51400c34c3b66b234949ffc4","sha256:a859150ac408a40668949545066fa3deaae664ec335e0be60454da832d7f8dfc"],"state_sha256":"42cf97f11b6913a9caa63ff3241b45d35a651c44c07432d8aa54d96976e352e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIsnK0eLWBbUJgKH6AnlxPUXpgBBQpGUg5uHu7CdMQIOaBlzzMNCMssbsWfNwDGRsKLnzX0h6ZSz9922ivxtAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:38:40.652610Z","bundle_sha256":"a2477d70060d3ddb933d3c7e2a2d23d69852ee8b0743f44f519713c01a0f5060"}}