{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XDDSFK5V6ZCJHIPPTSYSG75ZIO","short_pith_number":"pith:XDDSFK5V","canonical_record":{"source":{"id":"1906.03056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-07T12:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"09f5ef5b607286001e91e22df3c111125884e4f5c96816d1a462e1da18e10ce9","abstract_canon_sha256":"cc2458b4f0b6e06d6c71c69b0155a438a30d18de5d0cdb9de54b7e057a634d65"},"schema_version":"1.0"},"canonical_sha256":"b8c722abb5f64493a1ef9cb1237fb9439f21996e4eacb9b9d6e58d746ab23236","source":{"kind":"arxiv","id":"1906.03056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03056","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03056v1","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03056","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"pith_short_12","alias_value":"XDDSFK5V6ZCJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XDDSFK5V6ZCJHIPP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XDDSFK5V","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XDDSFK5V6ZCJHIPPTSYSG75ZIO","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-07T12:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"09f5ef5b607286001e91e22df3c111125884e4f5c96816d1a462e1da18e10ce9","abstract_canon_sha256":"cc2458b4f0b6e06d6c71c69b0155a438a30d18de5d0cdb9de54b7e057a634d65"},"schema_version":"1.0"},"canonical_sha256":"b8c722abb5f64493a1ef9cb1237fb9439f21996e4eacb9b9d6e58d746ab23236","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:55.208851Z","signature_b64":"wlgXUJtb2MhWVo1qtvewEaK16Uys9VDW7psBsyn9LlcExLc01hgj5u/af6ydjDFcyHr1VXSXJ7wsAZwYAtPLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c722abb5f64493a1ef9cb1237fb9439f21996e4eacb9b9d6e58d746ab23236","last_reissued_at":"2026-05-17T23:43:55.208179Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:55.208179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03056","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-17T23:43:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgzAC+kq7gdfLtGTzbIaNGr436G2P9xQyh0EjMmsc4vkZLOJdho8xrTzqtPzRcderviNELMUB2Gj+ZHPmRhFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:25:01.899922Z"},"content_sha256":"cfcb383431de0e149b950c84e0269f504922970d48099c44d409c5f416098d11","schema_version":"1.0","event_id":"sha256:cfcb383431de0e149b950c84e0269f504922970d48099c44d409c5f416098d11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XDDSFK5V6ZCJHIPPTSYSG75ZIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polyak Steps for Adaptive Fast Gradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Mathieu Barr\\'e","submitted_at":"2019-06-07T12:58:47Z","abstract_excerpt":"Accelerated algorithms for minimizing smooth strongly convex functions usually require knowledge of the strong convexity parameter $\\mu$. In the case of an unknown $\\mu$, current adaptive techniques are based on restart schemes. When the optimal value $f^*$ is known, these strategies recover the accelerated linear convergence bound without additional grid search. In this paper we propose a new approach that has the same bound without any restart, using an online estimation of strong convexity parameter. We show the robustness of the Fast Gradient Method when using a sequence of upper bounds on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03056","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-17T23:43:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrKVDrbxv5KfnhsWKW0dpfytk5hv0SnmzKwrjuHqgQwbenJO9OrqmCISx5LF3WTshYq5vTkpKDCMQhgPJB/YAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:25:01.900669Z"},"content_sha256":"cbdc6ee815a44167c6e1588c6d954c3502440f63e46dabc08a63352aa796b6fb","schema_version":"1.0","event_id":"sha256:cbdc6ee815a44167c6e1588c6d954c3502440f63e46dabc08a63352aa796b6fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDDSFK5V6ZCJHIPPTSYSG75ZIO/bundle.json","state_url":"https://pith.science/pith/XDDSFK5V6ZCJHIPPTSYSG75ZIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDDSFK5V6ZCJHIPPTSYSG75ZIO/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-26T01:25:01Z","links":{"resolver":"https://pith.science/pith/XDDSFK5V6ZCJHIPPTSYSG75ZIO","bundle":"https://pith.science/pith/XDDSFK5V6ZCJHIPPTSYSG75ZIO/bundle.json","state":"https://pith.science/pith/XDDSFK5V6ZCJHIPPTSYSG75ZIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDDSFK5V6ZCJHIPPTSYSG75ZIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XDDSFK5V6ZCJHIPPTSYSG75ZIO","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":"cc2458b4f0b6e06d6c71c69b0155a438a30d18de5d0cdb9de54b7e057a634d65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-07T12:58:47Z","title_canon_sha256":"09f5ef5b607286001e91e22df3c111125884e4f5c96816d1a462e1da18e10ce9"},"schema_version":"1.0","source":{"id":"1906.03056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03056","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03056v1","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03056","created_at":"2026-05-17T23:43:55Z"},{"alias_kind":"pith_short_12","alias_value":"XDDSFK5V6ZCJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XDDSFK5V6ZCJHIPP","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XDDSFK5V","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:cbdc6ee815a44167c6e1588c6d954c3502440f63e46dabc08a63352aa796b6fb","target":"graph","created_at":"2026-05-17T23:43:55Z","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":"Accelerated algorithms for minimizing smooth strongly convex functions usually require knowledge of the strong convexity parameter $\\mu$. In the case of an unknown $\\mu$, current adaptive techniques are based on restart schemes. When the optimal value $f^*$ is known, these strategies recover the accelerated linear convergence bound without additional grid search. In this paper we propose a new approach that has the same bound without any restart, using an online estimation of strong convexity parameter. We show the robustness of the Fast Gradient Method when using a sequence of upper bounds on","authors_text":"Alexandre d'Aspremont, Mathieu Barr\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-07T12:58:47Z","title":"Polyak Steps for Adaptive Fast Gradient Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03056","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:cfcb383431de0e149b950c84e0269f504922970d48099c44d409c5f416098d11","target":"record","created_at":"2026-05-17T23:43:55Z","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":"cc2458b4f0b6e06d6c71c69b0155a438a30d18de5d0cdb9de54b7e057a634d65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-07T12:58:47Z","title_canon_sha256":"09f5ef5b607286001e91e22df3c111125884e4f5c96816d1a462e1da18e10ce9"},"schema_version":"1.0","source":{"id":"1906.03056","kind":"arxiv","version":1}},"canonical_sha256":"b8c722abb5f64493a1ef9cb1237fb9439f21996e4eacb9b9d6e58d746ab23236","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8c722abb5f64493a1ef9cb1237fb9439f21996e4eacb9b9d6e58d746ab23236","first_computed_at":"2026-05-17T23:43:55.208179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:55.208179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wlgXUJtb2MhWVo1qtvewEaK16Uys9VDW7psBsyn9LlcExLc01hgj5u/af6ydjDFcyHr1VXSXJ7wsAZwYAtPLBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:55.208851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfcb383431de0e149b950c84e0269f504922970d48099c44d409c5f416098d11","sha256:cbdc6ee815a44167c6e1588c6d954c3502440f63e46dabc08a63352aa796b6fb"],"state_sha256":"2fd1ef900a9b221b2610c258a438d09229b7255328dc03782529915b766f4378"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCfU8L5ZCdPHQEOJACi7ZL/JwoGLl1N4hrFfyLDIsSqC6/RJkCBxcilWwTn+jrjrRlPcYPH1Iw5lmaVMGPPTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:25:01.908255Z","bundle_sha256":"d311c44556d24cb319f4343e31efcef03e3083c1f14f838edd296a7f175f8fea"}}