{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OS3PFPVZXRLUSQDMRPEFHMOQC2","short_pith_number":"pith:OS3PFPVZ","schema_version":"1.0","canonical_sha256":"74b6f2beb9bc5749406c8bc853b1d016a9f3693c2b91dd0e73f33537aedb1614","source":{"kind":"arxiv","id":"2308.02014","version":1},"attestation_state":"computed","paper":{"title":"Local convergence of an inexact proximal algorithm for weakly convex functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gilson do Nascimento Silva, Lucas Vidal de Meireles, Samara Costa Lima, Valdines Leite de Sousa Junior","submitted_at":"2023-08-03T20:09:56Z","abstract_excerpt":"Since introduced by Martinet and Rockafellar, the proximal point algorithm was generalized in many fruitful directions. More recently, in 2002, Pennanen studied the proximal point algorithm without monotonicity. A year later, Iusem and Svaiter joined Pennanen to present inexact variants of the method, again without monotonicity. Building on the foundation laid by these two prior works, we propose a variant of the proximal point algorithm designed specifically for weakly convex functions. Our motivation for introducing this inexact algorithm is to increase its versatility and applicability in 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":"2308.02014","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-03T20:09:56Z","cross_cats_sorted":[],"title_canon_sha256":"c0662ce672f48de78f894f73be2bbf4eb6b1b6f4fef9b09b9773812c50eb57f8","abstract_canon_sha256":"2e1a1933d7ff6584255e2dedb81aa5fa32f1dccb819ec0f3861ff1979373199c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:36.522415Z","signature_b64":"+4Yzseol80z4bJdEFfVaVMcB76oDUsWCBbPr8DcrBUAEeWvYWQxJImV/5gOZNNuMIzR6Rd3NARm0AR/bRMv4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74b6f2beb9bc5749406c8bc853b1d016a9f3693c2b91dd0e73f33537aedb1614","last_reissued_at":"2026-07-05T06:37:36.521875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:36.521875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local convergence of an inexact proximal algorithm for weakly convex functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gilson do Nascimento Silva, Lucas Vidal de Meireles, Samara Costa Lima, Valdines Leite de Sousa Junior","submitted_at":"2023-08-03T20:09:56Z","abstract_excerpt":"Since introduced by Martinet and Rockafellar, the proximal point algorithm was generalized in many fruitful directions. More recently, in 2002, Pennanen studied the proximal point algorithm without monotonicity. A year later, Iusem and Svaiter joined Pennanen to present inexact variants of the method, again without monotonicity. Building on the foundation laid by these two prior works, we propose a variant of the proximal point algorithm designed specifically for weakly convex functions. Our motivation for introducing this inexact algorithm is to increase its versatility and applicability in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.02014","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/2308.02014/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":"2308.02014","created_at":"2026-07-05T06:37:36.521935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.02014v1","created_at":"2026-07-05T06:37:36.521935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.02014","created_at":"2026-07-05T06:37:36.521935+00:00"},{"alias_kind":"pith_short_12","alias_value":"OS3PFPVZXRLU","created_at":"2026-07-05T06:37:36.521935+00:00"},{"alias_kind":"pith_short_16","alias_value":"OS3PFPVZXRLUSQDM","created_at":"2026-07-05T06:37:36.521935+00:00"},{"alias_kind":"pith_short_8","alias_value":"OS3PFPVZ","created_at":"2026-07-05T06:37:36.521935+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14177","citing_title":"From stability of Langevin diffusion to convergence of proximal MCMC for non-log-concave sampling","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2","json":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2.json","graph_json":"https://pith.science/api/pith-number/OS3PFPVZXRLUSQDMRPEFHMOQC2/graph.json","events_json":"https://pith.science/api/pith-number/OS3PFPVZXRLUSQDMRPEFHMOQC2/events.json","paper":"https://pith.science/paper/OS3PFPVZ"},"agent_actions":{"view_html":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2","download_json":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2.json","view_paper":"https://pith.science/paper/OS3PFPVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.02014&json=true","fetch_graph":"https://pith.science/api/pith-number/OS3PFPVZXRLUSQDMRPEFHMOQC2/graph.json","fetch_events":"https://pith.science/api/pith-number/OS3PFPVZXRLUSQDMRPEFHMOQC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2/action/storage_attestation","attest_author":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2/action/author_attestation","sign_citation":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2/action/citation_signature","submit_replication":"https://pith.science/pith/OS3PFPVZXRLUSQDMRPEFHMOQC2/action/replication_record"}},"created_at":"2026-07-05T06:37:36.521935+00:00","updated_at":"2026-07-05T06:37:36.521935+00:00"}