{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PZWEMEJCKV5VDUECGHFJDM4LFJ","short_pith_number":"pith:PZWEMEJC","canonical_record":{"source":{"id":"1605.03791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-12T12:55:19Z","cross_cats_sorted":[],"title_canon_sha256":"7334fa1cf5ff31708045f2bf2313a6d7b831dc63860fee775c9d7eba4aefbbd6","abstract_canon_sha256":"0d133a8ac0745d4f9f8b8a09955c601f4a253af55d72e36411ddcea4083cdc4c"},"schema_version":"1.0"},"canonical_sha256":"7e6c461122557b51d08231ca91b38b2a6be933e4419e788ac938a75a8eeea253","source":{"kind":"arxiv","id":"1605.03791","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03791","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03791v2","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03791","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"PZWEMEJCKV5V","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZWEMEJCKV5VDUEC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZWEMEJC","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PZWEMEJCKV5VDUECGHFJDM4LFJ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.03791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-12T12:55:19Z","cross_cats_sorted":[],"title_canon_sha256":"7334fa1cf5ff31708045f2bf2313a6d7b831dc63860fee775c9d7eba4aefbbd6","abstract_canon_sha256":"0d133a8ac0745d4f9f8b8a09955c601f4a253af55d72e36411ddcea4083cdc4c"},"schema_version":"1.0"},"canonical_sha256":"7e6c461122557b51d08231ca91b38b2a6be933e4419e788ac938a75a8eeea253","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.442353Z","signature_b64":"JkA+JaN8Sx6yj8aJrlABYHtvJaUp7b+tKK5QyssSwHlKLcKY1YPfeZZbIpJGulorOb/Kt8TES6AXqoP6NLqFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e6c461122557b51d08231ca91b38b2a6be933e4419e788ac938a75a8eeea253","last_reissued_at":"2026-05-18T00:46:49.441611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.441611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.03791","source_version":2,"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:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Duny1kU+BfuG+XjDDne+KrvnnWhSwbmkhyYI/0Q5afFQD6sgOqbTwx3+68XVvqogGpAGYlZDj9jdkT5XY2fxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:43:42.685295Z"},"content_sha256":"af6696d0b358be3a3a3584b64f1c29651f640695e1a1a9e1cc698b7745f0a2c0","schema_version":"1.0","event_id":"sha256:af6696d0b358be3a3a3584b64f1c29651f640695e1a1a9e1cc698b7745f0a2c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PZWEMEJCKV5VDUECGHFJDM4LFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the convergence of a linesearch based proximal-gradient method for nonconvex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Federica Porta, Ignace Loris, Marco Prato, Silvia Bonettini, Simone Rebegoldi","submitted_at":"2016-05-12T12:55:19Z","abstract_excerpt":"We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a critical point if the objective function satisfies the Kurdyka-Lojasiewicz property at each point of its domain, under the assumption that a limit point exists. The proposed method is applied to a wide collection of image processing problems and our numerical tests show that our algorithm results to be flexible, robust and competitive when compared to recentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03791","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":""},"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:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpbtY7IJJhTWm0Y4hG92w15b8pcCY4IyNvnt2EaACdw8IE2DMzLzk58hZ2LhONXyX5JQx7f0gFXXYE+VaAuGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:43:42.686008Z"},"content_sha256":"dd7783cce4087da927a6498137a2c5e43463c3e2d57e4398d150ac8bb86253ab","schema_version":"1.0","event_id":"sha256:dd7783cce4087da927a6498137a2c5e43463c3e2d57e4398d150ac8bb86253ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZWEMEJCKV5VDUECGHFJDM4LFJ/bundle.json","state_url":"https://pith.science/pith/PZWEMEJCKV5VDUECGHFJDM4LFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZWEMEJCKV5VDUECGHFJDM4LFJ/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-05-27T20:43:42Z","links":{"resolver":"https://pith.science/pith/PZWEMEJCKV5VDUECGHFJDM4LFJ","bundle":"https://pith.science/pith/PZWEMEJCKV5VDUECGHFJDM4LFJ/bundle.json","state":"https://pith.science/pith/PZWEMEJCKV5VDUECGHFJDM4LFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZWEMEJCKV5VDUECGHFJDM4LFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PZWEMEJCKV5VDUECGHFJDM4LFJ","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":"0d133a8ac0745d4f9f8b8a09955c601f4a253af55d72e36411ddcea4083cdc4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-12T12:55:19Z","title_canon_sha256":"7334fa1cf5ff31708045f2bf2313a6d7b831dc63860fee775c9d7eba4aefbbd6"},"schema_version":"1.0","source":{"id":"1605.03791","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03791","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03791v2","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03791","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"PZWEMEJCKV5V","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZWEMEJCKV5VDUEC","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZWEMEJC","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:dd7783cce4087da927a6498137a2c5e43463c3e2d57e4398d150ac8bb86253ab","target":"graph","created_at":"2026-05-18T00:46:49Z","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 consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a critical point if the objective function satisfies the Kurdyka-Lojasiewicz property at each point of its domain, under the assumption that a limit point exists. The proposed method is applied to a wide collection of image processing problems and our numerical tests show that our algorithm results to be flexible, robust and competitive when compared to recentl","authors_text":"Federica Porta, Ignace Loris, Marco Prato, Silvia Bonettini, Simone Rebegoldi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-12T12:55:19Z","title":"On the convergence of a linesearch based proximal-gradient method for nonconvex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03791","kind":"arxiv","version":2},"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:af6696d0b358be3a3a3584b64f1c29651f640695e1a1a9e1cc698b7745f0a2c0","target":"record","created_at":"2026-05-18T00:46:49Z","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":"0d133a8ac0745d4f9f8b8a09955c601f4a253af55d72e36411ddcea4083cdc4c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-05-12T12:55:19Z","title_canon_sha256":"7334fa1cf5ff31708045f2bf2313a6d7b831dc63860fee775c9d7eba4aefbbd6"},"schema_version":"1.0","source":{"id":"1605.03791","kind":"arxiv","version":2}},"canonical_sha256":"7e6c461122557b51d08231ca91b38b2a6be933e4419e788ac938a75a8eeea253","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e6c461122557b51d08231ca91b38b2a6be933e4419e788ac938a75a8eeea253","first_computed_at":"2026-05-18T00:46:49.441611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:49.441611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JkA+JaN8Sx6yj8aJrlABYHtvJaUp7b+tKK5QyssSwHlKLcKY1YPfeZZbIpJGulorOb/Kt8TES6AXqoP6NLqFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:49.442353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03791","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af6696d0b358be3a3a3584b64f1c29651f640695e1a1a9e1cc698b7745f0a2c0","sha256:dd7783cce4087da927a6498137a2c5e43463c3e2d57e4398d150ac8bb86253ab"],"state_sha256":"ff9d322dc20d6991e8cd5602987261631ca3c95b88e43e25285fab72d9320037"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1InjJnWvLr4W/mszeLRRROjd0XGZyH8RQ2q95hJyFSPwY39xg7TB0pQ2+Q6lEFNH4avdoF5OK6TCV226/uOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:43:42.689731Z","bundle_sha256":"86955aee7e65f6c45d550e3d0cead87b1bc909c5e3fa5ecf4ea3c8e7d944c592"}}