{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4AOV4WALC7Z7CQWUR5CNOBTEMK","short_pith_number":"pith:4AOV4WAL","schema_version":"1.0","canonical_sha256":"e01d5e580b17f3f142d48f44d7066462a865e18a844ceb510569bc55d640d997","source":{"kind":"arxiv","id":"2510.16680","version":2},"attestation_state":"computed","paper":{"title":"HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Long Chen, Zeyi Xu","submitted_at":"2025-10-19T01:21:01Z","abstract_excerpt":"Two accelerated first-order methods, HNAG$^+$ and HNAG$^{++}$, are presented for smooth strongly convex optimization. By optimizing the coercivity constant of the HNAG flow and using a refined Lyapunov analysis, it is shown that HNAG$^+$ achieves the optimal global rate $1-2/\\sqrt{\\kappa}$, matching the information-theoretic lower bound for strongly convex optimization. For functions with Local Asymptotic Symmetry at the minimizer, HNAG$^{++}$ is shown to achieve the asymptotic rate $1-2\\sqrt{2/\\kappa}$, matching the best known asymptotic rate under $\\mathcal C^2$ regularity, while applying to"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2510.16680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-19T01:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"15231179ce772c7abbd41e696ec687800c39552d4437715800f075e5c5102bc2","abstract_canon_sha256":"e61b96e3b1e0c51d951c1a73d7d8bf1fcb05d06bd38619b30786ff489d2b87f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:37.207673Z","signature_b64":"Km9M1HQZe/AjUkQGMqrh0ZtsdeUHG7QXsIJ80rL4zBIrBCqCKr6ph8dra8SxVt4xjEHhFweGAUj2TBs3JPDxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e01d5e580b17f3f142d48f44d7066462a865e18a844ceb510569bc55d640d997","last_reissued_at":"2026-05-29T02:05:37.207146Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:37.207146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HNAG$^{++}$: An Accelerated Gradient Method with a Refined Asymptotic Rate for Strongly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Long Chen, Zeyi Xu","submitted_at":"2025-10-19T01:21:01Z","abstract_excerpt":"Two accelerated first-order methods, HNAG$^+$ and HNAG$^{++}$, are presented for smooth strongly convex optimization. By optimizing the coercivity constant of the HNAG flow and using a refined Lyapunov analysis, it is shown that HNAG$^+$ achieves the optimal global rate $1-2/\\sqrt{\\kappa}$, matching the information-theoretic lower bound for strongly convex optimization. For functions with Local Asymptotic Symmetry at the minimizer, HNAG$^{++}$ is shown to achieve the asymptotic rate $1-2\\sqrt{2/\\kappa}$, matching the best known asymptotic rate under $\\mathcal C^2$ regularity, while applying to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.16680","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/2510.16680/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.16680","created_at":"2026-05-29T02:05:37.207211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.16680v2","created_at":"2026-05-29T02:05:37.207211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.16680","created_at":"2026-05-29T02:05:37.207211+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AOV4WALC7Z7","created_at":"2026-05-29T02:05:37.207211+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AOV4WALC7Z7CQWU","created_at":"2026-05-29T02:05:37.207211+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AOV4WAL","created_at":"2026-05-29T02:05:37.207211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.09355","citing_title":"SHANG++: Robust Stochastic Acceleration under Multiplicative Noise","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK","json":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK.json","graph_json":"https://pith.science/api/pith-number/4AOV4WALC7Z7CQWUR5CNOBTEMK/graph.json","events_json":"https://pith.science/api/pith-number/4AOV4WALC7Z7CQWUR5CNOBTEMK/events.json","paper":"https://pith.science/paper/4AOV4WAL"},"agent_actions":{"view_html":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK","download_json":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK.json","view_paper":"https://pith.science/paper/4AOV4WAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.16680&json=true","fetch_graph":"https://pith.science/api/pith-number/4AOV4WALC7Z7CQWUR5CNOBTEMK/graph.json","fetch_events":"https://pith.science/api/pith-number/4AOV4WALC7Z7CQWUR5CNOBTEMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK/action/storage_attestation","attest_author":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK/action/author_attestation","sign_citation":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK/action/citation_signature","submit_replication":"https://pith.science/pith/4AOV4WALC7Z7CQWUR5CNOBTEMK/action/replication_record"}},"created_at":"2026-05-29T02:05:37.207211+00:00","updated_at":"2026-05-29T02:05:37.207211+00:00"}