{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YIATG52FO2FWT3UDWHNBMFRD6S","short_pith_number":"pith:YIATG52F","canonical_record":{"source":{"id":"2607.02053","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-02T11:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"657e9310f1a6c6ee07112c586faa80e26b4093a4d9d493479ef8341f7ae49eb1","abstract_canon_sha256":"408c352b2dbe05829c1dfdde687caf919e937854f84b1d2d1dba9a63fe94c544"},"schema_version":"1.0"},"canonical_sha256":"c201337745768b69ee83b1da161623f49a909245590f1a31a6ac3659c0650abe","source":{"kind":"arxiv","id":"2607.02053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02053","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02053v1","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02053","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"pith_short_12","alias_value":"YIATG52FO2FW","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"pith_short_16","alias_value":"YIATG52FO2FWT3UD","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"pith_short_8","alias_value":"YIATG52F","created_at":"2026-07-03T01:17:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YIATG52FO2FWT3UDWHNBMFRD6S","target":"record","payload":{"canonical_record":{"source":{"id":"2607.02053","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-02T11:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"657e9310f1a6c6ee07112c586faa80e26b4093a4d9d493479ef8341f7ae49eb1","abstract_canon_sha256":"408c352b2dbe05829c1dfdde687caf919e937854f84b1d2d1dba9a63fe94c544"},"schema_version":"1.0"},"canonical_sha256":"c201337745768b69ee83b1da161623f49a909245590f1a31a6ac3659c0650abe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:38.191212Z","signature_b64":"9RqDSM6GH/4sVFJnSmH0zMMTBAtKO4IKXT4LNYFCUjSiROr+n9oegVVmt8d5k0T6jHbGjUw86AWlqM7/26juDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c201337745768b69ee83b1da161623f49a909245590f1a31a6ac3659c0650abe","last_reissued_at":"2026-07-03T01:17:38.190787Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:38.190787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.02053","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-07-03T01:17:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOy3+ztexi3ZORJpT3h2DW9VvnepuE9ASYoDjXdXqwhfamkpN314KPB7N6C1RZ9tDrQYPm2lGN+qxI7Tf1gmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:09:45.033021Z"},"content_sha256":"48f2beb42cff26698423cf3e6b2abb0bc23d0ed08e22136974f88f80280b32f3","schema_version":"1.0","event_id":"sha256:48f2beb42cff26698423cf3e6b2abb0bc23d0ed08e22136974f88f80280b32f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YIATG52FO2FWT3UDWHNBMFRD6S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Anytime Acceleration of Gradient Descent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chung-En Tsai, Ilyas Fatkhullin, Liang Zhang, Niao He","submitted_at":"2026-07-02T11:29:02Z","abstract_excerpt":"Recent work suggests that the convergence rate of gradient descent (GD) in smooth convex optimization can be significantly improved by employing large stepsizes that may violate the descent property. In particular, if the total number of iterations $n$ is given, an $O(n^{-1.271})$ convergence rate can be achieved for both function value and squared gradient norm minimization. On the other hand, in the setting of anytime convergence, where $n$ is not known in advance, the best known rates of GD are much slower: $O(n^{-1.119})$ for function value minimization and $O(n^{-1})$ for squared gradient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02053","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.02053/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-03T01:17:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdhSOXJftMoTm/BXVE2pFgtjYHm2oZJAd7wXHwroxgOI0iKWScrmeJ2zd0LzEClblrX8BxxPtsFYZ+mELBjIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:09:45.033630Z"},"content_sha256":"2f29fb31fe5be99bde9ebe642a752b53523ac79ba3a0d8740c763a5a1fc839f7","schema_version":"1.0","event_id":"sha256:2f29fb31fe5be99bde9ebe642a752b53523ac79ba3a0d8740c763a5a1fc839f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/bundle.json","state_url":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIATG52FO2FWT3UDWHNBMFRD6S/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-07-03T22:09:45Z","links":{"resolver":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S","bundle":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/bundle.json","state":"https://pith.science/pith/YIATG52FO2FWT3UDWHNBMFRD6S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIATG52FO2FWT3UDWHNBMFRD6S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YIATG52FO2FWT3UDWHNBMFRD6S","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":"408c352b2dbe05829c1dfdde687caf919e937854f84b1d2d1dba9a63fe94c544","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-02T11:29:02Z","title_canon_sha256":"657e9310f1a6c6ee07112c586faa80e26b4093a4d9d493479ef8341f7ae49eb1"},"schema_version":"1.0","source":{"id":"2607.02053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.02053","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"arxiv_version","alias_value":"2607.02053v1","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02053","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"pith_short_12","alias_value":"YIATG52FO2FW","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"pith_short_16","alias_value":"YIATG52FO2FWT3UD","created_at":"2026-07-03T01:17:38Z"},{"alias_kind":"pith_short_8","alias_value":"YIATG52F","created_at":"2026-07-03T01:17:38Z"}],"graph_snapshots":[{"event_id":"sha256:2f29fb31fe5be99bde9ebe642a752b53523ac79ba3a0d8740c763a5a1fc839f7","target":"graph","created_at":"2026-07-03T01:17:38Z","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/2607.02053/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent work suggests that the convergence rate of gradient descent (GD) in smooth convex optimization can be significantly improved by employing large stepsizes that may violate the descent property. In particular, if the total number of iterations $n$ is given, an $O(n^{-1.271})$ convergence rate can be achieved for both function value and squared gradient norm minimization. On the other hand, in the setting of anytime convergence, where $n$ is not known in advance, the best known rates of GD are much slower: $O(n^{-1.119})$ for function value minimization and $O(n^{-1})$ for squared gradient","authors_text":"Chung-En Tsai, Ilyas Fatkhullin, Liang Zhang, Niao He","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-02T11:29:02Z","title":"Lower Bounds for Anytime Acceleration of Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02053","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:48f2beb42cff26698423cf3e6b2abb0bc23d0ed08e22136974f88f80280b32f3","target":"record","created_at":"2026-07-03T01:17:38Z","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":"408c352b2dbe05829c1dfdde687caf919e937854f84b1d2d1dba9a63fe94c544","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-07-02T11:29:02Z","title_canon_sha256":"657e9310f1a6c6ee07112c586faa80e26b4093a4d9d493479ef8341f7ae49eb1"},"schema_version":"1.0","source":{"id":"2607.02053","kind":"arxiv","version":1}},"canonical_sha256":"c201337745768b69ee83b1da161623f49a909245590f1a31a6ac3659c0650abe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c201337745768b69ee83b1da161623f49a909245590f1a31a6ac3659c0650abe","first_computed_at":"2026-07-03T01:17:38.190787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:38.190787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9RqDSM6GH/4sVFJnSmH0zMMTBAtKO4IKXT4LNYFCUjSiROr+n9oegVVmt8d5k0T6jHbGjUw86AWlqM7/26juDA==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:38.191212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.02053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48f2beb42cff26698423cf3e6b2abb0bc23d0ed08e22136974f88f80280b32f3","sha256:2f29fb31fe5be99bde9ebe642a752b53523ac79ba3a0d8740c763a5a1fc839f7"],"state_sha256":"8aab7047cda44e138f5df08e9412ca5d4a46225a798840eb7fc3079ac5ceb88d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"So178RflHXwlVG+vExSIo57RA4axbuEhc6nfwKaubRzHqudU8SNFaREP0PTpQj7eeoCMg9Z4ejDW2Z+kqqwOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:09:45.036689Z","bundle_sha256":"9e2103106fa6dae4476a5a5123db177c0007348c3f6688630f80f6c37c06e75c"}}