{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:H2YF2WN6NM4N3NTFKHT34KADMU","short_pith_number":"pith:H2YF2WN6","schema_version":"1.0","canonical_sha256":"3eb05d59be6b38ddb66551e7be2803652d4ac97b3534833f41f73fdd196374d0","source":{"kind":"arxiv","id":"2205.00064","version":3},"attestation_state":"computed","paper":{"title":"A nearly linearly convergent first-order method for nonsmooth functions with quadratic growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Damek Davis, Liwei Jiang","submitted_at":"2022-04-29T20:18:16Z","abstract_excerpt":"Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic growth. This work designs such a method for a wide class of nonsmooth and nonconvex locally Lipschitz functions, including max-of-smooth, Shapiro's decomposable class, and generic semialgebraic functions. The algorithm is parameter-free and derives from Goldstein's conceptual subgradient method."},"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":"2205.00064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-04-29T20:18:16Z","cross_cats_sorted":[],"title_canon_sha256":"c9dd7c4ef1ff7770bdf3dd927304804b53e1f1a319a7c4efc8923dcd03508310","abstract_canon_sha256":"4ae374454328b14a04fbaaed39d6a27d3ebe96fbcfd1a0ed27788531f5d99ae6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:03.755224Z","signature_b64":"f3J05nOoA4rJvWDlGRYotMJGIkQPK4Gw3cmlDIh8oLyhC7p2rDeMCFJ1r0FahMGwYrG9ozrgR20MuP93jRW6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eb05d59be6b38ddb66551e7be2803652d4ac97b3534833f41f73fdd196374d0","last_reissued_at":"2026-07-05T06:31:03.754711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:03.754711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A nearly linearly convergent first-order method for nonsmooth functions with quadratic growth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Damek Davis, Liwei Jiang","submitted_at":"2022-04-29T20:18:16Z","abstract_excerpt":"Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic growth. This work designs such a method for a wide class of nonsmooth and nonconvex locally Lipschitz functions, including max-of-smooth, Shapiro's decomposable class, and generic semialgebraic functions. The algorithm is parameter-free and derives from Goldstein's conceptual subgradient method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00064","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/2205.00064/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":"2205.00064","created_at":"2026-07-05T06:31:03.754771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.00064v3","created_at":"2026-07-05T06:31:03.754771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00064","created_at":"2026-07-05T06:31:03.754771+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2YF2WN6NM4N","created_at":"2026-07-05T06:31:03.754771+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2YF2WN6NM4N3NTF","created_at":"2026-07-05T06:31:03.754771+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2YF2WN6","created_at":"2026-07-05T06:31:03.754771+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05305","citing_title":"Online Covariance Estimation in Nonsmooth Stochastic Approximation","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU","json":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU.json","graph_json":"https://pith.science/api/pith-number/H2YF2WN6NM4N3NTFKHT34KADMU/graph.json","events_json":"https://pith.science/api/pith-number/H2YF2WN6NM4N3NTFKHT34KADMU/events.json","paper":"https://pith.science/paper/H2YF2WN6"},"agent_actions":{"view_html":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU","download_json":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU.json","view_paper":"https://pith.science/paper/H2YF2WN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.00064&json=true","fetch_graph":"https://pith.science/api/pith-number/H2YF2WN6NM4N3NTFKHT34KADMU/graph.json","fetch_events":"https://pith.science/api/pith-number/H2YF2WN6NM4N3NTFKHT34KADMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU/action/storage_attestation","attest_author":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU/action/author_attestation","sign_citation":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU/action/citation_signature","submit_replication":"https://pith.science/pith/H2YF2WN6NM4N3NTFKHT34KADMU/action/replication_record"}},"created_at":"2026-07-05T06:31:03.754771+00:00","updated_at":"2026-07-05T06:31:03.754771+00:00"}