{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4OWQMVTJGDZ7LKTTB3E2QMDAFN","short_pith_number":"pith:4OWQMVTJ","canonical_record":{"source":{"id":"2309.09961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-18T17:35:24Z","cross_cats_sorted":[],"title_canon_sha256":"e2432fa5cebcd5ccb1fdf45d4612bcfa1ffaf4007c12c7ccd1deb2bd63cd7df9","abstract_canon_sha256":"201429ba0d6be79bb2a3866267609d89c08bc5a361283233354feaaf4027978d"},"schema_version":"1.0"},"canonical_sha256":"e3ad06566930f3f5aa730ec9a830602b48085f9118d8bae4ac8e973f3d0ca5fb","source":{"kind":"arxiv","id":"2309.09961","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.09961","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"arxiv_version","alias_value":"2309.09961v2","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09961","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"pith_short_12","alias_value":"4OWQMVTJGDZ7","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"pith_short_16","alias_value":"4OWQMVTJGDZ7LKTT","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"pith_short_8","alias_value":"4OWQMVTJ","created_at":"2026-07-05T06:54:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4OWQMVTJGDZ7LKTTB3E2QMDAFN","target":"record","payload":{"canonical_record":{"source":{"id":"2309.09961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-18T17:35:24Z","cross_cats_sorted":[],"title_canon_sha256":"e2432fa5cebcd5ccb1fdf45d4612bcfa1ffaf4007c12c7ccd1deb2bd63cd7df9","abstract_canon_sha256":"201429ba0d6be79bb2a3866267609d89c08bc5a361283233354feaaf4027978d"},"schema_version":"1.0"},"canonical_sha256":"e3ad06566930f3f5aa730ec9a830602b48085f9118d8bae4ac8e973f3d0ca5fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:40.588205Z","signature_b64":"vl+J5wtcE9fz2n1mb55RL8NXXWuzTw8hgjfLHD7mVhp8kONmFWfPc8p+iLU909Y/inNzm2w/YKQWaF81Xya3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ad06566930f3f5aa730ec9a830602b48085f9118d8bae4ac8e973f3d0ca5fb","last_reissued_at":"2026-07-05T06:54:40.587761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:40.587761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.09961","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-05T06:54:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JsHAuuan8liHBU5ePfLlvH9AqBpYAONgGw91NQK1PKueq/BbjdX+YUfkNUtE1x8OjnHrgbW4viLZWaoSLS9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:16:30.278319Z"},"content_sha256":"c96ffbc91689ec9d2e657040b3f9496b49331a338f005c3bce3da2feba7c427e","schema_version":"1.0","event_id":"sha256:c96ffbc91689ec9d2e657040b3f9496b49331a338f005c3bce3da2feba7c427e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4OWQMVTJGDZ7LKTTB3E2QMDAFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Gradient Descent via Long Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alex L. Wang, Benjamin Grimmer, Kevin Shu","submitted_at":"2023-09-18T17:35:24Z","abstract_excerpt":"Recently Grimmer [1] showed for smooth convex optimization by utilizing longer steps periodically, gradient descent's textbook $LD^2/2T$ convergence guarantees can be improved by constant factors, conjecturing an accelerated rate strictly faster than $O(1/T)$ could be possible. Here we prove such a big-O gain, establishing gradient descent's first accelerated convergence rate in this setting. Namely, we prove a $O(1/T^{1.0564})$ rate for smooth convex minimization by utilizing a nonconstant nonperiodic sequence of increasingly large stepsizes. It remains open if one can achieve the $O(1/T^{1.1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09961","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/2309.09961/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-05T06:54:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJyNzzjAnPrEB6XTpl2EoEzbhnjTrBHcCeepcrGH7bBGzsTs2aP4sSjnliPxeS6FIuOfdGJ2P+tfZKmj0VdmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:16:30.278838Z"},"content_sha256":"003c31074fa43638b32e673acd0730ee9d4214ca551511175cb5db4218b2f07f","schema_version":"1.0","event_id":"sha256:003c31074fa43638b32e673acd0730ee9d4214ca551511175cb5db4218b2f07f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OWQMVTJGDZ7LKTTB3E2QMDAFN/bundle.json","state_url":"https://pith.science/pith/4OWQMVTJGDZ7LKTTB3E2QMDAFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OWQMVTJGDZ7LKTTB3E2QMDAFN/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-12T20:16:30Z","links":{"resolver":"https://pith.science/pith/4OWQMVTJGDZ7LKTTB3E2QMDAFN","bundle":"https://pith.science/pith/4OWQMVTJGDZ7LKTTB3E2QMDAFN/bundle.json","state":"https://pith.science/pith/4OWQMVTJGDZ7LKTTB3E2QMDAFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OWQMVTJGDZ7LKTTB3E2QMDAFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4OWQMVTJGDZ7LKTTB3E2QMDAFN","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":"201429ba0d6be79bb2a3866267609d89c08bc5a361283233354feaaf4027978d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-18T17:35:24Z","title_canon_sha256":"e2432fa5cebcd5ccb1fdf45d4612bcfa1ffaf4007c12c7ccd1deb2bd63cd7df9"},"schema_version":"1.0","source":{"id":"2309.09961","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.09961","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"arxiv_version","alias_value":"2309.09961v2","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09961","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"pith_short_12","alias_value":"4OWQMVTJGDZ7","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"pith_short_16","alias_value":"4OWQMVTJGDZ7LKTT","created_at":"2026-07-05T06:54:40Z"},{"alias_kind":"pith_short_8","alias_value":"4OWQMVTJ","created_at":"2026-07-05T06:54:40Z"}],"graph_snapshots":[{"event_id":"sha256:003c31074fa43638b32e673acd0730ee9d4214ca551511175cb5db4218b2f07f","target":"graph","created_at":"2026-07-05T06:54:40Z","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/2309.09961/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently Grimmer [1] showed for smooth convex optimization by utilizing longer steps periodically, gradient descent's textbook $LD^2/2T$ convergence guarantees can be improved by constant factors, conjecturing an accelerated rate strictly faster than $O(1/T)$ could be possible. Here we prove such a big-O gain, establishing gradient descent's first accelerated convergence rate in this setting. Namely, we prove a $O(1/T^{1.0564})$ rate for smooth convex minimization by utilizing a nonconstant nonperiodic sequence of increasingly large stepsizes. It remains open if one can achieve the $O(1/T^{1.1","authors_text":"Alex L. Wang, Benjamin Grimmer, Kevin Shu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-18T17:35:24Z","title":"Accelerated Gradient Descent via Long Steps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09961","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:c96ffbc91689ec9d2e657040b3f9496b49331a338f005c3bce3da2feba7c427e","target":"record","created_at":"2026-07-05T06:54:40Z","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":"201429ba0d6be79bb2a3866267609d89c08bc5a361283233354feaaf4027978d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-18T17:35:24Z","title_canon_sha256":"e2432fa5cebcd5ccb1fdf45d4612bcfa1ffaf4007c12c7ccd1deb2bd63cd7df9"},"schema_version":"1.0","source":{"id":"2309.09961","kind":"arxiv","version":2}},"canonical_sha256":"e3ad06566930f3f5aa730ec9a830602b48085f9118d8bae4ac8e973f3d0ca5fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ad06566930f3f5aa730ec9a830602b48085f9118d8bae4ac8e973f3d0ca5fb","first_computed_at":"2026-07-05T06:54:40.587761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:54:40.587761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vl+J5wtcE9fz2n1mb55RL8NXXWuzTw8hgjfLHD7mVhp8kONmFWfPc8p+iLU909Y/inNzm2w/YKQWaF81Xya3AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:54:40.588205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.09961","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c96ffbc91689ec9d2e657040b3f9496b49331a338f005c3bce3da2feba7c427e","sha256:003c31074fa43638b32e673acd0730ee9d4214ca551511175cb5db4218b2f07f"],"state_sha256":"e17f3cf6abe5a1cb50da3df4e79ae565c39f4f674e71479d912ad57e1760dfac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msRf9iAQumVYxH3A3EpgkeW1PAWpx6h8+8RfK2FXU88nhNA7nHxngJdb/OykzB3P2TR2118haY7TgZkdlXOjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:16:30.284055Z","bundle_sha256":"be1d70d420a296d0b09d7551489d44ba2bb741890e52f112dc8a1cf3a096c9fd"}}