{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MVBITVCRNBVBFUECRSVRPCMWEW","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":"cf2e917064d646d236c7fe4fd8d9d4f00a1cc8a0f9ad180bcc74e3aebaa4f32b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-11T03:06:59Z","title_canon_sha256":"89e12b280f357e4e6d784bd253feed7c170e7dd70667fef70d5b47ae7e37f256"},"schema_version":"1.0","source":{"id":"2608.10418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.10418","created_at":"2026-08-12T01:22:25Z"},{"alias_kind":"arxiv_version","alias_value":"2608.10418v1","created_at":"2026-08-12T01:22:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10418","created_at":"2026-08-12T01:22:25Z"},{"alias_kind":"pith_short_12","alias_value":"MVBITVCRNBVB","created_at":"2026-08-12T01:22:25Z"},{"alias_kind":"pith_short_16","alias_value":"MVBITVCRNBVBFUEC","created_at":"2026-08-12T01:22:25Z"},{"alias_kind":"pith_short_8","alias_value":"MVBITVCR","created_at":"2026-08-12T01:22:25Z"}],"graph_snapshots":[{"event_id":"sha256:bfe313aedc974d970888c5b0bf33f15724976a5f8ade4ee6bc1981789fcdc906","target":"graph","created_at":"2026-08-12T01:22:25Z","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/2608.10418/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent work has shown that, for smooth convex optimization, plain gradient descent can be accelerated from its textbook convergence rate of $O(T^{-1})$ (where $T$ denotes the number of iterations) to $O\\big(T^{-\\log_2(1+\\sqrt{2})}\\big)$ using carefully designed stepsize schedules alone, without resorting to momentum or other algorithmic modifications. Despite this progress, however, little was known about lower bounds for such methods beyond the classical $\\Omega(T^{-2})$ benchmark for general first-order methods. In this work, we present a new lower bound of $\\Omega(T^{-1.9319})$ for the last","authors_text":"Jianhao Ma, Yuxin Chen","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-11T03:06:59Z","title":"A lower bound for stepsize-based acceleration of gradient descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10418","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:d39cf3b59108442ae18ee0ce0d235e32b78bfb6e1d145979a1f6fcac6690274f","target":"record","created_at":"2026-08-12T01:22:25Z","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":"cf2e917064d646d236c7fe4fd8d9d4f00a1cc8a0f9ad180bcc74e3aebaa4f32b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-11T03:06:59Z","title_canon_sha256":"89e12b280f357e4e6d784bd253feed7c170e7dd70667fef70d5b47ae7e37f256"},"schema_version":"1.0","source":{"id":"2608.10418","kind":"arxiv","version":1}},"canonical_sha256":"654289d451686a12d0828cab17899625a5c7c1b49882b1851d25268c53b5b2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"654289d451686a12d0828cab17899625a5c7c1b49882b1851d25268c53b5b2a4","first_computed_at":"2026-08-12T01:22:25.498382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-12T01:22:25.498382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VXVOjbIaiuH7tXflBknNL+A66Wpl3ybjVyhU1tzzytRnj8nVV30oM405PWkPmz/leRQBhQUsJJ9iNaO0YG14Bw==","signature_status":"signed_v1","signed_at":"2026-08-12T01:22:25.500049Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.10418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d39cf3b59108442ae18ee0ce0d235e32b78bfb6e1d145979a1f6fcac6690274f","sha256:bfe313aedc974d970888c5b0bf33f15724976a5f8ade4ee6bc1981789fcdc906"],"state_sha256":"32570e193d1abc421191d3d360ceb6fd3e5aed6fdeb564c0ad0c4f6a00f21eff"}