{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:O6XCLUHBFTTXGZB5TPQAXZIPY6","short_pith_number":"pith:O6XCLUHB","schema_version":"1.0","canonical_sha256":"77ae25d0e12ce773643d9be00be50fc78c2e9cd7a270436041f09dca9f3059b1","source":{"kind":"arxiv","id":"2508.11073","version":3},"attestation_state":"computed","paper":{"title":"Zeroth-Order Non-smooth Non-convex Optimization via Gaussian Smoothing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anik Kumar Paul, Shalabh Bhatnagar","submitted_at":"2025-08-14T21:11:09Z","abstract_excerpt":"This paper addresses stochastic optimization of Lipschitz-continuous, nonsmooth and nonconvex objectives over compact convex sets, where only noisy function evaluations are available. While gradient-free methods have been developed for smooth nonconvex problems, extending these techniques to the nonsmooth setting remains challenging. The primary difficulty arises from the absence of a Taylor series expansion for Clarke subdifferentials, which limits the ability to approximate and analyze the behavior of the objective function in a neighborhood of a point. We propose a two time-scale zeroth-ord"},"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":"2508.11073","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-14T21:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"a5da4ebb3002057f82f7a84cdc10f2f876b50740cf53ec98c7091a2481a5f7d8","abstract_canon_sha256":"16887b44603b5797047e54b993ea96a5bddd4d2bec19d53ed883cd4f6a88645f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:07.866771Z","signature_b64":"2+HFO6xyqzYAs0qRbEQRMuA2m15abFAhISWOSKtsPm6VR1nBxbQ2MFtqnr7FlCjhtH8PDhz/WW/cm/zyY71mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77ae25d0e12ce773643d9be00be50fc78c2e9cd7a270436041f09dca9f3059b1","last_reissued_at":"2026-06-02T02:04:07.866033Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:07.866033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zeroth-Order Non-smooth Non-convex Optimization via Gaussian Smoothing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anik Kumar Paul, Shalabh Bhatnagar","submitted_at":"2025-08-14T21:11:09Z","abstract_excerpt":"This paper addresses stochastic optimization of Lipschitz-continuous, nonsmooth and nonconvex objectives over compact convex sets, where only noisy function evaluations are available. While gradient-free methods have been developed for smooth nonconvex problems, extending these techniques to the nonsmooth setting remains challenging. The primary difficulty arises from the absence of a Taylor series expansion for Clarke subdifferentials, which limits the ability to approximate and analyze the behavior of the objective function in a neighborhood of a point. We propose a two time-scale zeroth-ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.11073","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.11073/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":"2508.11073","created_at":"2026-06-02T02:04:07.866140+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.11073v3","created_at":"2026-06-02T02:04:07.866140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.11073","created_at":"2026-06-02T02:04:07.866140+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6XCLUHBFTTX","created_at":"2026-06-02T02:04:07.866140+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6XCLUHBFTTXGZB5","created_at":"2026-06-02T02:04:07.866140+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6XCLUHB","created_at":"2026-06-02T02:04:07.866140+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15538","citing_title":"Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6","json":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6.json","graph_json":"https://pith.science/api/pith-number/O6XCLUHBFTTXGZB5TPQAXZIPY6/graph.json","events_json":"https://pith.science/api/pith-number/O6XCLUHBFTTXGZB5TPQAXZIPY6/events.json","paper":"https://pith.science/paper/O6XCLUHB"},"agent_actions":{"view_html":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6","download_json":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6.json","view_paper":"https://pith.science/paper/O6XCLUHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.11073&json=true","fetch_graph":"https://pith.science/api/pith-number/O6XCLUHBFTTXGZB5TPQAXZIPY6/graph.json","fetch_events":"https://pith.science/api/pith-number/O6XCLUHBFTTXGZB5TPQAXZIPY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6/action/storage_attestation","attest_author":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6/action/author_attestation","sign_citation":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6/action/citation_signature","submit_replication":"https://pith.science/pith/O6XCLUHBFTTXGZB5TPQAXZIPY6/action/replication_record"}},"created_at":"2026-06-02T02:04:07.866140+00:00","updated_at":"2026-06-02T02:04:07.866140+00:00"}