{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2TRYC2JK7NP2H27TDMOTPGZQLK","short_pith_number":"pith:2TRYC2JK","schema_version":"1.0","canonical_sha256":"d4e381692afb5fa3ebf31b1d379b305a8e198c5d0397a60e5c59af7276b1f1a2","source":{"kind":"arxiv","id":"2410.19928","version":5},"attestation_state":"computed","paper":{"title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Kabgani, Masoud Ahookhosh","submitted_at":"2024-10-25T18:54:35Z","abstract_excerpt":"This paper introduces ItsOPT, an {\\it inexact two-level smoothing optimization framework} designed to find first-order critical points of nonsmooth and nonconvex functions. The framework consists of two levels of methodologies: at the upper level, a zeroth-, first-, or second-order method can be tailored to minimize a smooth approximation; at the lower level, the high-order proximal auxiliary problems are solved inexactly, generating an inexact oracle for the smooth function. As a smoothing technique, we introduce the high-order Moreau envelope (HOME) and study its fundamental properties under"},"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":"2410.19928","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-25T18:54:35Z","cross_cats_sorted":[],"title_canon_sha256":"e27a04eb3406d40ed246c5e0df02333a740585812adbc877ecfce25b606069fe","abstract_canon_sha256":"c918e716cd788e4a90ff3866aad817c6ca66c870822caa0e80086d3e09a04a90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:16:49.238226Z","signature_b64":"isPFc8Tp/NegZwEPavP4qlmT3exC1c+L3gMQp/IXQsVs7A292qQUPAa+5fov9Hy4/+8q9GZ02xFGivE6z/SwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4e381692afb5fa3ebf31b1d379b305a8e198c5d0397a60e5c59af7276b1f1a2","last_reissued_at":"2026-07-03T00:16:49.237767Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:16:49.237767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Kabgani, Masoud Ahookhosh","submitted_at":"2024-10-25T18:54:35Z","abstract_excerpt":"This paper introduces ItsOPT, an {\\it inexact two-level smoothing optimization framework} designed to find first-order critical points of nonsmooth and nonconvex functions. The framework consists of two levels of methodologies: at the upper level, a zeroth-, first-, or second-order method can be tailored to minimize a smooth approximation; at the lower level, the high-order proximal auxiliary problems are solved inexactly, generating an inexact oracle for the smooth function. As a smoothing technique, we introduce the high-order Moreau envelope (HOME) and study its fundamental properties under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19928","kind":"arxiv","version":5},"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/2410.19928/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":"2410.19928","created_at":"2026-07-03T00:16:49.237823+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.19928v5","created_at":"2026-07-03T00:16:49.237823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19928","created_at":"2026-07-03T00:16:49.237823+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TRYC2JK7NP2","created_at":"2026-07-03T00:16:49.237823+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TRYC2JK7NP2H27T","created_at":"2026-07-03T00:16:49.237823+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TRYC2JK","created_at":"2026-07-03T00:16:49.237823+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.30991","citing_title":"Difference-of-Convex Optimization via Inexact Smoothing Descent Methods: Difference of High-Order Moreau Envelopes","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17306","citing_title":"Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK","json":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK.json","graph_json":"https://pith.science/api/pith-number/2TRYC2JK7NP2H27TDMOTPGZQLK/graph.json","events_json":"https://pith.science/api/pith-number/2TRYC2JK7NP2H27TDMOTPGZQLK/events.json","paper":"https://pith.science/paper/2TRYC2JK"},"agent_actions":{"view_html":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK","download_json":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK.json","view_paper":"https://pith.science/paper/2TRYC2JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.19928&json=true","fetch_graph":"https://pith.science/api/pith-number/2TRYC2JK7NP2H27TDMOTPGZQLK/graph.json","fetch_events":"https://pith.science/api/pith-number/2TRYC2JK7NP2H27TDMOTPGZQLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK/action/storage_attestation","attest_author":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK/action/author_attestation","sign_citation":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK/action/citation_signature","submit_replication":"https://pith.science/pith/2TRYC2JK7NP2H27TDMOTPGZQLK/action/replication_record"}},"created_at":"2026-07-03T00:16:49.237823+00:00","updated_at":"2026-07-03T00:16:49.237823+00:00"}