{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4EY6C3HDIMP62BXUWUHFDR3OQQ","short_pith_number":"pith:4EY6C3HD","schema_version":"1.0","canonical_sha256":"e131e16ce3431fed06f4b50e51c76e8433459b41c5174431b640390bf3fb36c0","source":{"kind":"arxiv","id":"2211.01127","version":2},"attestation_state":"computed","paper":{"title":"On the local convergence of the semismooth Newton method for composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiang Hu, Shaohua Pan, Tonghua Tian, Zaiwen Wen","submitted_at":"2022-11-02T14:00:37Z","abstract_excerpt":"In this paper, we consider a large class of nonlinear equations derived from first-order type methods for solving composite optimization problems. Traditional approaches to establishing superlinear convergence rates of semismooth Newton-type methods for solving nonlinear equations usually postulate either nonsingularity of the B-Jacobian or smoothness of the equation. We investigate the feasibility of both conditions. For the nonsingularity condition, we present equivalent characterizations in broad generality, and illustrate that they are easy-to-check criteria for some examples. For the smoo"},"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":"2211.01127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-02T14:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"4708769da99c3b917337cc8c88723158911f96069f91bdf2548922ea6e11c2b8","abstract_canon_sha256":"32d9448419269c2fb47485f4cdc837970aaf6ce329818e75e322128abd79ff9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:24.580018Z","signature_b64":"fSnym9Yw2FaHRW5o4xiVLngUr8v1KmrSajKPLqnn4v0A8sD62y6OwbQ0mGgM9nIUVY9Cp1Q28zwwEm/I8/c1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e131e16ce3431fed06f4b50e51c76e8433459b41c5174431b640390bf3fb36c0","last_reissued_at":"2026-07-05T06:35:24.579593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:24.579593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the local convergence of the semismooth Newton method for composite optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiang Hu, Shaohua Pan, Tonghua Tian, Zaiwen Wen","submitted_at":"2022-11-02T14:00:37Z","abstract_excerpt":"In this paper, we consider a large class of nonlinear equations derived from first-order type methods for solving composite optimization problems. Traditional approaches to establishing superlinear convergence rates of semismooth Newton-type methods for solving nonlinear equations usually postulate either nonsingularity of the B-Jacobian or smoothness of the equation. We investigate the feasibility of both conditions. For the nonsingularity condition, we present equivalent characterizations in broad generality, and illustrate that they are easy-to-check criteria for some examples. For the smoo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01127","kind":"arxiv","version":2},"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/2211.01127/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":"2211.01127","created_at":"2026-07-05T06:35:24.579651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01127v2","created_at":"2026-07-05T06:35:24.579651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01127","created_at":"2026-07-05T06:35:24.579651+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EY6C3HDIMP6","created_at":"2026-07-05T06:35:24.579651+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EY6C3HDIMP62BXU","created_at":"2026-07-05T06:35:24.579651+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EY6C3HD","created_at":"2026-07-05T06:35:24.579651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.12260","citing_title":"On the resolution of $\\ell_1$-norm minimization via a two-metric adaptive projection method","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ","json":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ.json","graph_json":"https://pith.science/api/pith-number/4EY6C3HDIMP62BXUWUHFDR3OQQ/graph.json","events_json":"https://pith.science/api/pith-number/4EY6C3HDIMP62BXUWUHFDR3OQQ/events.json","paper":"https://pith.science/paper/4EY6C3HD"},"agent_actions":{"view_html":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ","download_json":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ.json","view_paper":"https://pith.science/paper/4EY6C3HD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01127&json=true","fetch_graph":"https://pith.science/api/pith-number/4EY6C3HDIMP62BXUWUHFDR3OQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4EY6C3HDIMP62BXUWUHFDR3OQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ/action/storage_attestation","attest_author":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ/action/author_attestation","sign_citation":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ/action/citation_signature","submit_replication":"https://pith.science/pith/4EY6C3HDIMP62BXUWUHFDR3OQQ/action/replication_record"}},"created_at":"2026-07-05T06:35:24.579651+00:00","updated_at":"2026-07-05T06:35:24.579651+00:00"}