{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WH4P56VXPODSEXDAPLHKGLRRAQ","short_pith_number":"pith:WH4P56VX","canonical_record":{"source":{"id":"1807.00387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-07-01T20:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"d0982fbab2203df6f975bd78c1aa3b5c6a7d148db55fdac61f750005e67beda6","abstract_canon_sha256":"f9b4a7543734806e87090672d9bb790d7cfb3d9bf3c9d95bc5bf89e3764b2450"},"schema_version":"1.0"},"canonical_sha256":"b1f8fefab77b87225c607acea32e3104253fe9cbfac54a556f39e1802f3b26e4","source":{"kind":"arxiv","id":"1807.00387","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00387","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00387v3","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00387","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"WH4P56VXPODS","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WH4P56VXPODSEXDA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WH4P56VX","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WH4P56VXPODSEXDAPLHKGLRRAQ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-07-01T20:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"d0982fbab2203df6f975bd78c1aa3b5c6a7d148db55fdac61f750005e67beda6","abstract_canon_sha256":"f9b4a7543734806e87090672d9bb790d7cfb3d9bf3c9d95bc5bf89e3764b2450"},"schema_version":"1.0"},"canonical_sha256":"b1f8fefab77b87225c607acea32e3104253fe9cbfac54a556f39e1802f3b26e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.395693Z","signature_b64":"zd5SOZDw6or1t81h27qUFVLQ8lIudaG9q/qYH0OogF0e/uxTlbdM3P85SDczDKK5qe1hR4bTVzMQKfjdSFZDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1f8fefab77b87225c607acea32e3104253fe9cbfac54a556f39e1802f3b26e4","last_reissued_at":"2026-05-18T00:00:08.395184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.395184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00387","source_version":3,"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-05-18T00:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YF3O+BbT1TQtOXW1r2tVITwtMLUi4yU5QMAT3xFqzxH1Cb1ZvmWZG4bYibWcjESOHHSZvo7/CKOFehAWQUyLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:09:41.886674Z"},"content_sha256":"95ca5251d1a1c2c63eaf65d10da770509f398196dc2cda9ee9472ea9565f6f46","schema_version":"1.0","event_id":"sha256:95ca5251d1a1c2c63eaf65d10da770509f398196dc2cda9ee9472ea9565f6f46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WH4P56VXPODSEXDAPLHKGLRRAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence rates for an inertial algorithm of gradient type associated to a smooth nonconvex minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Szil\\'ard Csaba L\\'aszl\\'o","submitted_at":"2018-07-01T20:00:26Z","abstract_excerpt":"We investigate an inertial algorithm of gradient type in connection with the minimization of a nonconvex differentiable function. The algorithm is formulated in the spirit of Nesterov's accelerated convex gradient method. We show that the generated sequences converge to a critical point of the objective function, if a regularization of the objective function satisfies the Kurdyka-{\\L}ojasiewicz property. Further, we provide convergence rates for the generated sequences and the function values formulated in terms of the {\\L}ojasiewicz exponent."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00387","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZRuW6N+IgSzkIszs5oo+soUPzBPnH4n16cAx8j3BABb4YmNRwhZXbiNERfjWFHQeT6AZqJ7EKEcSWYhfZv6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:09:41.887046Z"},"content_sha256":"bf0502838b8a3ae1c90aa0e9cfb08cc3fac6c413e0a369b1d06c70a04c27cd64","schema_version":"1.0","event_id":"sha256:bf0502838b8a3ae1c90aa0e9cfb08cc3fac6c413e0a369b1d06c70a04c27cd64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/bundle.json","state_url":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/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-06-20T04:09:41Z","links":{"resolver":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ","bundle":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/bundle.json","state":"https://pith.science/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WH4P56VXPODSEXDAPLHKGLRRAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WH4P56VXPODSEXDAPLHKGLRRAQ","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":"f9b4a7543734806e87090672d9bb790d7cfb3d9bf3c9d95bc5bf89e3764b2450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-07-01T20:00:26Z","title_canon_sha256":"d0982fbab2203df6f975bd78c1aa3b5c6a7d148db55fdac61f750005e67beda6"},"schema_version":"1.0","source":{"id":"1807.00387","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00387","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00387v3","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00387","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"WH4P56VXPODS","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WH4P56VXPODSEXDA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WH4P56VX","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:bf0502838b8a3ae1c90aa0e9cfb08cc3fac6c413e0a369b1d06c70a04c27cd64","target":"graph","created_at":"2026-05-18T00:00:08Z","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"},"paper":{"abstract_excerpt":"We investigate an inertial algorithm of gradient type in connection with the minimization of a nonconvex differentiable function. The algorithm is formulated in the spirit of Nesterov's accelerated convex gradient method. We show that the generated sequences converge to a critical point of the objective function, if a regularization of the objective function satisfies the Kurdyka-{\\L}ojasiewicz property. Further, we provide convergence rates for the generated sequences and the function values formulated in terms of the {\\L}ojasiewicz exponent.","authors_text":"Szil\\'ard Csaba L\\'aszl\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-07-01T20:00:26Z","title":"Convergence rates for an inertial algorithm of gradient type associated to a smooth nonconvex minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00387","kind":"arxiv","version":3},"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:95ca5251d1a1c2c63eaf65d10da770509f398196dc2cda9ee9472ea9565f6f46","target":"record","created_at":"2026-05-18T00:00:08Z","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":"f9b4a7543734806e87090672d9bb790d7cfb3d9bf3c9d95bc5bf89e3764b2450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2018-07-01T20:00:26Z","title_canon_sha256":"d0982fbab2203df6f975bd78c1aa3b5c6a7d148db55fdac61f750005e67beda6"},"schema_version":"1.0","source":{"id":"1807.00387","kind":"arxiv","version":3}},"canonical_sha256":"b1f8fefab77b87225c607acea32e3104253fe9cbfac54a556f39e1802f3b26e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1f8fefab77b87225c607acea32e3104253fe9cbfac54a556f39e1802f3b26e4","first_computed_at":"2026-05-18T00:00:08.395184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:08.395184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zd5SOZDw6or1t81h27qUFVLQ8lIudaG9q/qYH0OogF0e/uxTlbdM3P85SDczDKK5qe1hR4bTVzMQKfjdSFZDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:08.395693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00387","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95ca5251d1a1c2c63eaf65d10da770509f398196dc2cda9ee9472ea9565f6f46","sha256:bf0502838b8a3ae1c90aa0e9cfb08cc3fac6c413e0a369b1d06c70a04c27cd64"],"state_sha256":"a0624cd7424e67ae16a4731e96e3112d909e27afa7ad7d22b7fe88df5d0f9a76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jE1UbIKYDURKbclmZTFY4l1/k1AUWdjipGbviXPDl4rwRURB9isvskhM4xyVoKKfixuia8op63fVrYbf6O++BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:09:41.888968Z","bundle_sha256":"0333a1594aab843ef94bf7658c16d42b8f4d4498fb775450efde98bc7356c075"}}