{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WL67UZVE4OGBO7KYY7YXH3KN2Q","short_pith_number":"pith:WL67UZVE","canonical_record":{"source":{"id":"1702.03828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T15:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"9287ab18371d177ba3b7e853d7d093edd1cedb66d7d93f468e9286fa2b158d7d","abstract_canon_sha256":"720d36615d35b07457256d83811c56c2ce61a461cef6b60f826b91682e6e32fb"},"schema_version":"1.0"},"canonical_sha256":"b2fdfa66a4e38c177d58c7f173ed4dd40a4f6f0a6090b2f763327612391d98f2","source":{"kind":"arxiv","id":"1702.03828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03828","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03828v2","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03828","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"WL67UZVE4OGB","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_16","alias_value":"WL67UZVE4OGBO7KY","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_8","alias_value":"WL67UZVE","created_at":"2026-07-05T00:16:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WL67UZVE4OGBO7KYY7YXH3KN2Q","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T15:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"9287ab18371d177ba3b7e853d7d093edd1cedb66d7d93f468e9286fa2b158d7d","abstract_canon_sha256":"720d36615d35b07457256d83811c56c2ce61a461cef6b60f826b91682e6e32fb"},"schema_version":"1.0"},"canonical_sha256":"b2fdfa66a4e38c177d58c7f173ed4dd40a4f6f0a6090b2f763327612391d98f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:29.212455Z","signature_b64":"ZusF4aOtSAnJrtISAHOrwZlUoplqkZ6TASNyNiOebgQ1gMtaNaArdKrmQ59lUiXhG6bpZqo4QoFsOJjjhOgVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2fdfa66a4e38c177d58c7f173ed4dd40a4f6f0a6090b2f763327612391d98f2","last_reissued_at":"2026-07-05T00:16:29.211990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:29.211990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03828","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-07-05T00:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPyhDEDRMdQ94oMADAcCUBVQU4nTnI0v9Pzqx4a9vzidaQTsfRXwYspxp3W8ARb0vNCvRSj/P8BnJoOe+BVBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:50:43.824640Z"},"content_sha256":"e8f48baae8860cf736cc120cadcf70dff31a9152667fe172c14bedba5240a946","schema_version":"1.0","event_id":"sha256:e8f48baae8860cf736cc120cadcf70dff31a9152667fe172c14bedba5240a946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WL67UZVE4OGBO7KYY7YXH3KN2Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharpness, Restart and Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Vincent Roulet","submitted_at":"2017-02-13T15:41:21Z","abstract_excerpt":"The {\\L}ojasiewicz inequality shows that sharpness bounds on the minimum of convex optimization problems hold almost generically. Sharpness directly controls the performance of restart schemes, as observed by Nemirovsky and Nesterov (1985). The constants quantifying these sharpness bounds are of course unobservable, but we show that optimal restart strategies are robust, in the sense that, in some important cases, finding the best restart scheme only requires a log scale grid search. Overall then, restart schemes generically accelerate accelerated first-order methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03828","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1702.03828/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFXg5RMpee55v7R1FSOhW7/ZdO2cRdmks0UtCmHSrXQtV0T4i077B3bbXptmJJv/SkttgR+S0zIo1BsxvuAcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:50:43.825130Z"},"content_sha256":"aa5aff3793f45ac35d6a1890ec3b4ecdf9e066d3330e5309c2c97ef4da17aee6","schema_version":"1.0","event_id":"sha256:aa5aff3793f45ac35d6a1890ec3b4ecdf9e066d3330e5309c2c97ef4da17aee6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WL67UZVE4OGBO7KYY7YXH3KN2Q/bundle.json","state_url":"https://pith.science/pith/WL67UZVE4OGBO7KYY7YXH3KN2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WL67UZVE4OGBO7KYY7YXH3KN2Q/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-08-23T05:50:43Z","links":{"resolver":"https://pith.science/pith/WL67UZVE4OGBO7KYY7YXH3KN2Q","bundle":"https://pith.science/pith/WL67UZVE4OGBO7KYY7YXH3KN2Q/bundle.json","state":"https://pith.science/pith/WL67UZVE4OGBO7KYY7YXH3KN2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WL67UZVE4OGBO7KYY7YXH3KN2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WL67UZVE4OGBO7KYY7YXH3KN2Q","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":"720d36615d35b07457256d83811c56c2ce61a461cef6b60f826b91682e6e32fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T15:41:21Z","title_canon_sha256":"9287ab18371d177ba3b7e853d7d093edd1cedb66d7d93f468e9286fa2b158d7d"},"schema_version":"1.0","source":{"id":"1702.03828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03828","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03828v2","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03828","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"WL67UZVE4OGB","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_16","alias_value":"WL67UZVE4OGBO7KY","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_8","alias_value":"WL67UZVE","created_at":"2026-07-05T00:16:29Z"}],"graph_snapshots":[{"event_id":"sha256:aa5aff3793f45ac35d6a1890ec3b4ecdf9e066d3330e5309c2c97ef4da17aee6","target":"graph","created_at":"2026-07-05T00:16:29Z","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/1702.03828/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The {\\L}ojasiewicz inequality shows that sharpness bounds on the minimum of convex optimization problems hold almost generically. Sharpness directly controls the performance of restart schemes, as observed by Nemirovsky and Nesterov (1985). The constants quantifying these sharpness bounds are of course unobservable, but we show that optimal restart strategies are robust, in the sense that, in some important cases, finding the best restart scheme only requires a log scale grid search. Overall then, restart schemes generically accelerate accelerated first-order methods.","authors_text":"Alexandre d'Aspremont, Vincent Roulet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T15:41:21Z","title":"Sharpness, Restart and Acceleration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03828","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:e8f48baae8860cf736cc120cadcf70dff31a9152667fe172c14bedba5240a946","target":"record","created_at":"2026-07-05T00:16:29Z","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":"720d36615d35b07457256d83811c56c2ce61a461cef6b60f826b91682e6e32fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-13T15:41:21Z","title_canon_sha256":"9287ab18371d177ba3b7e853d7d093edd1cedb66d7d93f468e9286fa2b158d7d"},"schema_version":"1.0","source":{"id":"1702.03828","kind":"arxiv","version":2}},"canonical_sha256":"b2fdfa66a4e38c177d58c7f173ed4dd40a4f6f0a6090b2f763327612391d98f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2fdfa66a4e38c177d58c7f173ed4dd40a4f6f0a6090b2f763327612391d98f2","first_computed_at":"2026-07-05T00:16:29.211990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:29.211990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZusF4aOtSAnJrtISAHOrwZlUoplqkZ6TASNyNiOebgQ1gMtaNaArdKrmQ59lUiXhG6bpZqo4QoFsOJjjhOgVBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:29.212455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8f48baae8860cf736cc120cadcf70dff31a9152667fe172c14bedba5240a946","sha256:aa5aff3793f45ac35d6a1890ec3b4ecdf9e066d3330e5309c2c97ef4da17aee6"],"state_sha256":"1f433c68d798a664943a7fc062bdbb20cada85eb4ed5f91f7eeb0df8acd39f9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhLf0cFSTB0/7sc9xic6r0NmszqmoI0P7193wonppXxVpXFD+vg8MjnbIA1fWQNbGPDPKvEwnR6ByPTbin5QCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T05:50:43.829917Z","bundle_sha256":"80144b7938c74de253fd5499b8f903da3a1f2b868c2a4f5b9c97d0ab1ae828dd"}}