{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JQEDWDHF5MZUI4BJTG73FMGU2H","short_pith_number":"pith:JQEDWDHF","schema_version":"1.0","canonical_sha256":"4c083b0ce5eb3344702999bfb2b0d4d1c7819c9f85574ed9cadb5cfb6a0e6438","source":{"kind":"arxiv","id":"2506.15632","version":1},"attestation_state":"computed","paper":{"title":"Heavy Ball and Nesterov Accelerations with Hessian-driven Damping for Nonconvex Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"F. Lara, N. Hadjisavvas, P.T. Vuong, R.T. Marcavillaca","submitted_at":"2025-06-18T17:04:17Z","abstract_excerpt":"In this work, we investigate a second-order dynamical system with Hessian-driven damping tailored for a class of nonconvex functions called strongly quasiconvex. Buil\\-ding upon this continuous-time model, we derive two discrete-time gra\\-dient-based algorithms through time discretizations. The first is a Heavy Ball method with Hessian correction, incorporating cur\\-va\\-tu\\-re-dependent terms that arise from discretizing the Hessian damping component. The second is a Nesterov-type accelerated method with adaptive momentum, fea\\-tu\\-ring correction terms that account for local curvature. Both a"},"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":"2506.15632","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-18T17:04:17Z","cross_cats_sorted":[],"title_canon_sha256":"0b3aec7a7920d2c106dc1b79708e82822a73509128c16a1fb697cfb654256217","abstract_canon_sha256":"12e304faff8af7523514e7ff4f8c5f857beff0cb24f0795473efffe9731f1d24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:47.421547Z","signature_b64":"koc8OV/RxacnnN3W7Ez+Igxh3y7qvckvSHW2VgG1CESf2ocy0MvXXLzol81pMCWzxrhjFD+sErl043SXLf69Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c083b0ce5eb3344702999bfb2b0d4d1c7819c9f85574ed9cadb5cfb6a0e6438","last_reissued_at":"2026-07-05T11:23:47.421024Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:47.421024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heavy Ball and Nesterov Accelerations with Hessian-driven Damping for Nonconvex Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"F. Lara, N. Hadjisavvas, P.T. Vuong, R.T. Marcavillaca","submitted_at":"2025-06-18T17:04:17Z","abstract_excerpt":"In this work, we investigate a second-order dynamical system with Hessian-driven damping tailored for a class of nonconvex functions called strongly quasiconvex. Buil\\-ding upon this continuous-time model, we derive two discrete-time gra\\-dient-based algorithms through time discretizations. The first is a Heavy Ball method with Hessian correction, incorporating cur\\-va\\-tu\\-re-dependent terms that arise from discretizing the Hessian damping component. The second is a Nesterov-type accelerated method with adaptive momentum, fea\\-tu\\-ring correction terms that account for local curvature. Both a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15632","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/2506.15632/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":"2506.15632","created_at":"2026-07-05T11:23:47.421088+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15632v1","created_at":"2026-07-05T11:23:47.421088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15632","created_at":"2026-07-05T11:23:47.421088+00:00"},{"alias_kind":"pith_short_12","alias_value":"JQEDWDHF5MZU","created_at":"2026-07-05T11:23:47.421088+00:00"},{"alias_kind":"pith_short_16","alias_value":"JQEDWDHF5MZUI4BJ","created_at":"2026-07-05T11:23:47.421088+00:00"},{"alias_kind":"pith_short_8","alias_value":"JQEDWDHF","created_at":"2026-07-05T11:23:47.421088+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.04375","citing_title":"Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H","json":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H.json","graph_json":"https://pith.science/api/pith-number/JQEDWDHF5MZUI4BJTG73FMGU2H/graph.json","events_json":"https://pith.science/api/pith-number/JQEDWDHF5MZUI4BJTG73FMGU2H/events.json","paper":"https://pith.science/paper/JQEDWDHF"},"agent_actions":{"view_html":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H","download_json":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H.json","view_paper":"https://pith.science/paper/JQEDWDHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15632&json=true","fetch_graph":"https://pith.science/api/pith-number/JQEDWDHF5MZUI4BJTG73FMGU2H/graph.json","fetch_events":"https://pith.science/api/pith-number/JQEDWDHF5MZUI4BJTG73FMGU2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H/action/storage_attestation","attest_author":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H/action/author_attestation","sign_citation":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H/action/citation_signature","submit_replication":"https://pith.science/pith/JQEDWDHF5MZUI4BJTG73FMGU2H/action/replication_record"}},"created_at":"2026-07-05T11:23:47.421088+00:00","updated_at":"2026-07-05T11:23:47.421088+00:00"}