{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3P3A2IJCOB6WBPL7SILGGUUKGK","short_pith_number":"pith:3P3A2IJC","schema_version":"1.0","canonical_sha256":"dbf60d2122707d60bd7f921663528a328bb05d9af307ac5c3cbf61d538101da4","source":{"kind":"arxiv","id":"2605.18364","version":1},"attestation_state":"computed","paper":{"title":"Proximal basin hopping: global optimization with guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Cesare Molinari (MaLGA), Guillaume Lauga (LJAD), LJAD), Samuel Vaiter (CNRS","submitted_at":"2026-05-18T13:15:44Z","abstract_excerpt":"Global optimization is a challenging problem, with plenty of algorithms displaying empirical success, but scarce theoretical backing. In this work, we propose a new theoretical framework called Proximal Basin Hopping (PBH), carefully tailored to combine proximal optimization and local minimization. We use it to construct a practical algorithm that converges to the global minimizer with high probability, when using a finite amount of samples. Proximal Basin Hopping outperforms well known algorithms with theoretical backing on standard synthetic hard functions, and real problems such as fitting "},"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":"2605.18364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-18T13:15:44Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"29ffb4304b55a223bcd466a93724a7fd0e50e9b13f631a99d04c5236a648e3b9","abstract_canon_sha256":"4d13398cef3b732dcc17501aaad31ecbf89b7ba62cf8219b304efa4a42d6cf6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:57.276868Z","signature_b64":"Mm1CZL9XNXet3/ugkCDbFktRvI0moEcXsH/0QVDecdRlVZWWLKxY0f7epLWC8B6k1rtO/omQUbV/5BIui/hKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbf60d2122707d60bd7f921663528a328bb05d9af307ac5c3cbf61d538101da4","last_reissued_at":"2026-05-20T00:05:57.276051Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:57.276051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal basin hopping: global optimization with guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Cesare Molinari (MaLGA), Guillaume Lauga (LJAD), LJAD), Samuel Vaiter (CNRS","submitted_at":"2026-05-18T13:15:44Z","abstract_excerpt":"Global optimization is a challenging problem, with plenty of algorithms displaying empirical success, but scarce theoretical backing. In this work, we propose a new theoretical framework called Proximal Basin Hopping (PBH), carefully tailored to combine proximal optimization and local minimization. We use it to construct a practical algorithm that converges to the global minimizer with high probability, when using a finite amount of samples. Proximal Basin Hopping outperforms well known algorithms with theoretical backing on standard synthetic hard functions, and real problems such as fitting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18364","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/2605.18364/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:30.014556Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"external_links","ran_at":"2026-05-19T23:31:50.381999Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.788169Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"00f0b7ac4e70efb082a26ec182e5e7559904511699d6c908919ea991ec543621"},"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":"2605.18364","created_at":"2026-05-20T00:05:57.276180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18364v1","created_at":"2026-05-20T00:05:57.276180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18364","created_at":"2026-05-20T00:05:57.276180+00:00"},{"alias_kind":"pith_short_12","alias_value":"3P3A2IJCOB6W","created_at":"2026-05-20T00:05:57.276180+00:00"},{"alias_kind":"pith_short_16","alias_value":"3P3A2IJCOB6WBPL7","created_at":"2026-05-20T00:05:57.276180+00:00"},{"alias_kind":"pith_short_8","alias_value":"3P3A2IJC","created_at":"2026-05-20T00:05:57.276180+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK","json":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK.json","graph_json":"https://pith.science/api/pith-number/3P3A2IJCOB6WBPL7SILGGUUKGK/graph.json","events_json":"https://pith.science/api/pith-number/3P3A2IJCOB6WBPL7SILGGUUKGK/events.json","paper":"https://pith.science/paper/3P3A2IJC"},"agent_actions":{"view_html":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK","download_json":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK.json","view_paper":"https://pith.science/paper/3P3A2IJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18364&json=true","fetch_graph":"https://pith.science/api/pith-number/3P3A2IJCOB6WBPL7SILGGUUKGK/graph.json","fetch_events":"https://pith.science/api/pith-number/3P3A2IJCOB6WBPL7SILGGUUKGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK/action/storage_attestation","attest_author":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK/action/author_attestation","sign_citation":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK/action/citation_signature","submit_replication":"https://pith.science/pith/3P3A2IJCOB6WBPL7SILGGUUKGK/action/replication_record"}},"created_at":"2026-05-20T00:05:57.276180+00:00","updated_at":"2026-05-20T00:05:57.276180+00:00"}