{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MBRREO44HPNAGOJDGJ5GCXIIXD","short_pith_number":"pith:MBRREO44","canonical_record":{"source":{"id":"2502.16953","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-24T08:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"0ddb296db2d6f8aefedf6cefb3806e6eb002145a34c26f2bbc2a4bb0d66beb45","abstract_canon_sha256":"5ac768ba4cfa2a08b6469828d5c1c582314dbf30224ec4f82a49939a37ab6e23"},"schema_version":"1.0"},"canonical_sha256":"6063123b9c3bda033923327a615d08b8f40fe648422a1dbf030bb9043204064e","source":{"kind":"arxiv","id":"2502.16953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.16953","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"2502.16953v1","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16953","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"MBRREO44HPNA","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"pith_short_16","alias_value":"MBRREO44HPNAGOJD","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"pith_short_8","alias_value":"MBRREO44","created_at":"2026-07-05T10:19:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MBRREO44HPNAGOJDGJ5GCXIIXD","target":"record","payload":{"canonical_record":{"source":{"id":"2502.16953","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-24T08:29:59Z","cross_cats_sorted":[],"title_canon_sha256":"0ddb296db2d6f8aefedf6cefb3806e6eb002145a34c26f2bbc2a4bb0d66beb45","abstract_canon_sha256":"5ac768ba4cfa2a08b6469828d5c1c582314dbf30224ec4f82a49939a37ab6e23"},"schema_version":"1.0"},"canonical_sha256":"6063123b9c3bda033923327a615d08b8f40fe648422a1dbf030bb9043204064e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:03.444021Z","signature_b64":"1WeUG974RAhau+gzESAEZndYZODD5LGZQfbYkZYhwcD0EwLVtG83KYdECg0A26bBsDXSjoWahbEbQPe7Bo0sCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6063123b9c3bda033923327a615d08b8f40fe648422a1dbf030bb9043204064e","last_reissued_at":"2026-07-05T10:19:03.443462Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:03.443462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.16953","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-05T10:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/oeBONcpW4IiqPOEJBa05dFYGnhztSwfDIMXULgeNFXVzZGACa7cdTZlqdmpbI0mDzDxUhIWQYeg1O1l+3paAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T11:55:29.343131Z"},"content_sha256":"cc04535d4b2fddf49930441adb67fd67b9d881d175f682e001438af7f946b255","schema_version":"1.0","event_id":"sha256:cc04535d4b2fddf49930441adb67fd67b9d881d175f682e001438af7f946b255"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MBRREO44HPNAGOJDGJ5GCXIIXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Gradient Methods via Inertial Systems with Hessian-driven Damping","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Peypouquet, Zepeng Wang","submitted_at":"2025-02-24T08:29:59Z","abstract_excerpt":"We analyze the convergence rate of a family of inertial algorithms, which can be obtained by discretization of an inertial system with Hessian-driven damping. We recover a convergence rate, up to a factor of 2 speedup upon Nesterov's scheme, for smooth strongly convex functions. As a byproduct of our analyses, we also derive linear convergence rates for convex functions satisfying quadratic growth condition or Polyak-\\L ojasiewicz inequality. As a significant feature of our results, the dependence of the convergence rate on parameters of the inertial system/algorithm is revealed explicitly. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16953","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/2502.16953/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-05T10:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xh+UINttxIN1LUDuRe2Wy5fp/AVAjRZk96CMG8HAVYGxX+fa5koGxWZDrwemM8FYheEz9GsPbbx5YSIZGls4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T11:55:29.343519Z"},"content_sha256":"9e5d395226319b05ac105787eab0a3b659697f31cb94623db79d7f3730e5da35","schema_version":"1.0","event_id":"sha256:9e5d395226319b05ac105787eab0a3b659697f31cb94623db79d7f3730e5da35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBRREO44HPNAGOJDGJ5GCXIIXD/bundle.json","state_url":"https://pith.science/pith/MBRREO44HPNAGOJDGJ5GCXIIXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBRREO44HPNAGOJDGJ5GCXIIXD/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-26T11:55:29Z","links":{"resolver":"https://pith.science/pith/MBRREO44HPNAGOJDGJ5GCXIIXD","bundle":"https://pith.science/pith/MBRREO44HPNAGOJDGJ5GCXIIXD/bundle.json","state":"https://pith.science/pith/MBRREO44HPNAGOJDGJ5GCXIIXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBRREO44HPNAGOJDGJ5GCXIIXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MBRREO44HPNAGOJDGJ5GCXIIXD","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":"5ac768ba4cfa2a08b6469828d5c1c582314dbf30224ec4f82a49939a37ab6e23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-24T08:29:59Z","title_canon_sha256":"0ddb296db2d6f8aefedf6cefb3806e6eb002145a34c26f2bbc2a4bb0d66beb45"},"schema_version":"1.0","source":{"id":"2502.16953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.16953","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"2502.16953v1","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16953","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"MBRREO44HPNA","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"pith_short_16","alias_value":"MBRREO44HPNAGOJD","created_at":"2026-07-05T10:19:03Z"},{"alias_kind":"pith_short_8","alias_value":"MBRREO44","created_at":"2026-07-05T10:19:03Z"}],"graph_snapshots":[{"event_id":"sha256:9e5d395226319b05ac105787eab0a3b659697f31cb94623db79d7f3730e5da35","target":"graph","created_at":"2026-07-05T10:19:03Z","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/2502.16953/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We analyze the convergence rate of a family of inertial algorithms, which can be obtained by discretization of an inertial system with Hessian-driven damping. We recover a convergence rate, up to a factor of 2 speedup upon Nesterov's scheme, for smooth strongly convex functions. As a byproduct of our analyses, we also derive linear convergence rates for convex functions satisfying quadratic growth condition or Polyak-\\L ojasiewicz inequality. As a significant feature of our results, the dependence of the convergence rate on parameters of the inertial system/algorithm is revealed explicitly. Th","authors_text":"Juan Peypouquet, Zepeng Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-24T08:29:59Z","title":"Accelerated Gradient Methods via Inertial Systems with Hessian-driven Damping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16953","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:cc04535d4b2fddf49930441adb67fd67b9d881d175f682e001438af7f946b255","target":"record","created_at":"2026-07-05T10:19:03Z","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":"5ac768ba4cfa2a08b6469828d5c1c582314dbf30224ec4f82a49939a37ab6e23","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-02-24T08:29:59Z","title_canon_sha256":"0ddb296db2d6f8aefedf6cefb3806e6eb002145a34c26f2bbc2a4bb0d66beb45"},"schema_version":"1.0","source":{"id":"2502.16953","kind":"arxiv","version":1}},"canonical_sha256":"6063123b9c3bda033923327a615d08b8f40fe648422a1dbf030bb9043204064e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6063123b9c3bda033923327a615d08b8f40fe648422a1dbf030bb9043204064e","first_computed_at":"2026-07-05T10:19:03.443462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:03.443462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1WeUG974RAhau+gzESAEZndYZODD5LGZQfbYkZYhwcD0EwLVtG83KYdECg0A26bBsDXSjoWahbEbQPe7Bo0sCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:03.444021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.16953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc04535d4b2fddf49930441adb67fd67b9d881d175f682e001438af7f946b255","sha256:9e5d395226319b05ac105787eab0a3b659697f31cb94623db79d7f3730e5da35"],"state_sha256":"257a7b8e4420453d7325e92ad32c9db21707bfc4dd389edab172b85851c11023"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LA40IyZBVr+XDo0Yb5CMD3ZwflM263dwYOw/5z6Kp8c725/ZLpaQXyE4VkdU8MGxrALuxJsSkwmUlA9VK1beAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T11:55:29.346006Z","bundle_sha256":"05b2fa4d1953e5ac3628fc2dd6be702ed8e69e4fa0c640bb2c7ed9d93dc9f1e7"}}