{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AKAM7RKSFJ53TQZL7STCCPRQI3","short_pith_number":"pith:AKAM7RKS","canonical_record":{"source":{"id":"2505.11670","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T20:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"f32e23a4d8eb5f9eda42affccce130c8d16a40f20253aca1fd5c342d9f207cc5","abstract_canon_sha256":"8e2c1310e4787f4437962dc8094d5c5f052b9766226119ec2e891d5b7ed4a5a3"},"schema_version":"1.0"},"canonical_sha256":"0280cfc5522a7bb9c32bfca6213e3046dcf23064802f2ecc11229a4c7092008c","source":{"kind":"arxiv","id":"2505.11670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11670","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11670v1","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11670","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"AKAM7RKSFJ53","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"AKAM7RKSFJ53TQZL","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"AKAM7RKS","created_at":"2026-07-05T11:04:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AKAM7RKSFJ53TQZL7STCCPRQI3","target":"record","payload":{"canonical_record":{"source":{"id":"2505.11670","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T20:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"f32e23a4d8eb5f9eda42affccce130c8d16a40f20253aca1fd5c342d9f207cc5","abstract_canon_sha256":"8e2c1310e4787f4437962dc8094d5c5f052b9766226119ec2e891d5b7ed4a5a3"},"schema_version":"1.0"},"canonical_sha256":"0280cfc5522a7bb9c32bfca6213e3046dcf23064802f2ecc11229a4c7092008c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:25.171328Z","signature_b64":"zk9u+0lXDH9YyQJFAaZuu0qx4qgsCd62zXULPd6uj1yX0Qt5gyWBH01PFGCcsgt86WVf2/hV0ccHYU3qDtMsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0280cfc5522a7bb9c32bfca6213e3046dcf23064802f2ecc11229a4c7092008c","last_reissued_at":"2026-07-05T11:04:25.170828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:25.170828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.11670","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-05T11:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kase5THh1pHJIf3AnHtmfziFWIgvLCNfN9VB83Sq2eEMDkkQwwaXzl2TqMAIk4vnpttGjNGBnPTMKBYRhYB3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:14:01.298618Z"},"content_sha256":"d74e4f22beeb260fb06b57975cc8875cf6e8223aba10c2257811ee65e5a1bd65","schema_version":"1.0","event_id":"sha256:d74e4f22beeb260fb06b57975cc8875cf6e8223aba10c2257811ee65e5a1bd65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AKAM7RKSFJ53TQZL7STCCPRQI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jaewook J. Suh, Shiqian Ma","submitted_at":"2025-05-16T20:10:03Z","abstract_excerpt":"We propose AdaNAG, an adaptive accelerated gradient method based on Nesterov's accelerated gradient method. AdaNAG is line-search-free, parameter-free, and achieves the accelerated convergence rates $f(x_k) - f_\\star = \\mathcal{O}\\left(1/k^2\\right)$ and $\\min_{i\\in\\left\\{1,\\dots, k\\right\\}} \\|\\nabla f(x_i)\\|^2 = \\mathcal{O}\\left(1/k^3\\right)$ for $L$-smooth convex function $f$. We provide a Lyapunov analysis for the convergence proof of AdaNAG, which additionally enables us to propose a novel adaptive gradient descent (GD) method, AdaGD. AdaGD achieves the non-ergodic convergence rate $f(x_k) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11670","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/2505.11670/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-05T11:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"alCleraXAzL7Mg1pIpOqyHHUU8GDq+I5G886jWm6JjR9g1XTMeMVZSUuNRzDU+7lhuPrSCkXecUErTEXuWzzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:14:01.299185Z"},"content_sha256":"4d0eae00b2bbce4800c00b911838f54fe5eb0a1d6247d49e1cbd704f3598fe87","schema_version":"1.0","event_id":"sha256:4d0eae00b2bbce4800c00b911838f54fe5eb0a1d6247d49e1cbd704f3598fe87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKAM7RKSFJ53TQZL7STCCPRQI3/bundle.json","state_url":"https://pith.science/pith/AKAM7RKSFJ53TQZL7STCCPRQI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKAM7RKSFJ53TQZL7STCCPRQI3/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-07T22:14:01Z","links":{"resolver":"https://pith.science/pith/AKAM7RKSFJ53TQZL7STCCPRQI3","bundle":"https://pith.science/pith/AKAM7RKSFJ53TQZL7STCCPRQI3/bundle.json","state":"https://pith.science/pith/AKAM7RKSFJ53TQZL7STCCPRQI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKAM7RKSFJ53TQZL7STCCPRQI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AKAM7RKSFJ53TQZL7STCCPRQI3","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":"8e2c1310e4787f4437962dc8094d5c5f052b9766226119ec2e891d5b7ed4a5a3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T20:10:03Z","title_canon_sha256":"f32e23a4d8eb5f9eda42affccce130c8d16a40f20253aca1fd5c342d9f207cc5"},"schema_version":"1.0","source":{"id":"2505.11670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11670","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11670v1","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11670","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"AKAM7RKSFJ53","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"AKAM7RKSFJ53TQZL","created_at":"2026-07-05T11:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"AKAM7RKS","created_at":"2026-07-05T11:04:25Z"}],"graph_snapshots":[{"event_id":"sha256:4d0eae00b2bbce4800c00b911838f54fe5eb0a1d6247d49e1cbd704f3598fe87","target":"graph","created_at":"2026-07-05T11:04: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/2505.11670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose AdaNAG, an adaptive accelerated gradient method based on Nesterov's accelerated gradient method. AdaNAG is line-search-free, parameter-free, and achieves the accelerated convergence rates $f(x_k) - f_\\star = \\mathcal{O}\\left(1/k^2\\right)$ and $\\min_{i\\in\\left\\{1,\\dots, k\\right\\}} \\|\\nabla f(x_i)\\|^2 = \\mathcal{O}\\left(1/k^3\\right)$ for $L$-smooth convex function $f$. We provide a Lyapunov analysis for the convergence proof of AdaNAG, which additionally enables us to propose a novel adaptive gradient descent (GD) method, AdaGD. AdaGD achieves the non-ergodic convergence rate $f(x_k) ","authors_text":"Jaewook J. Suh, Shiqian Ma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T20:10:03Z","title":"An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11670","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:d74e4f22beeb260fb06b57975cc8875cf6e8223aba10c2257811ee65e5a1bd65","target":"record","created_at":"2026-07-05T11:04: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":"8e2c1310e4787f4437962dc8094d5c5f052b9766226119ec2e891d5b7ed4a5a3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-16T20:10:03Z","title_canon_sha256":"f32e23a4d8eb5f9eda42affccce130c8d16a40f20253aca1fd5c342d9f207cc5"},"schema_version":"1.0","source":{"id":"2505.11670","kind":"arxiv","version":1}},"canonical_sha256":"0280cfc5522a7bb9c32bfca6213e3046dcf23064802f2ecc11229a4c7092008c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0280cfc5522a7bb9c32bfca6213e3046dcf23064802f2ecc11229a4c7092008c","first_computed_at":"2026-07-05T11:04:25.170828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:25.170828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zk9u+0lXDH9YyQJFAaZuu0qx4qgsCd62zXULPd6uj1yX0Qt5gyWBH01PFGCcsgt86WVf2/hV0ccHYU3qDtMsBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:25.171328Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.11670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d74e4f22beeb260fb06b57975cc8875cf6e8223aba10c2257811ee65e5a1bd65","sha256:4d0eae00b2bbce4800c00b911838f54fe5eb0a1d6247d49e1cbd704f3598fe87"],"state_sha256":"0d8a896c07f2b2d827c6754da73ca13d57586199222a657229b45ee7262507be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tlogfpj12IDXf5cthG9dYe7Nru3oubKjR7IRi+NydofU+U64N5iZ7/vm48nI4XbBuUbDm3V1nF6YV7J1L5OnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:14:01.303731Z","bundle_sha256":"920514cf8318490b142157153dc4b6483d6347c7949a5a259bc499a94b181a6e"}}