{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6LGXDVHVOXH5LJKWLBNBVGXW22","short_pith_number":"pith:6LGXDVHV","schema_version":"1.0","canonical_sha256":"f2cd71d4f575cfd5a556585a1a9af6d6820f56bf8fe5a938f33be1665eef54df","source":{"kind":"arxiv","id":"1504.06815","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear Residual Minimization by Iteratively Reweighted Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Juliane Sigl","submitted_at":"2015-04-26T13:01:59Z","abstract_excerpt":"We address the numerical solution of minimal norm residuals of {\\it nonlinear} equations in finite dimensions. We take inspiration from the problem of finding a sparse vector solution by using greedy algorithms based on iterative residual minimizations in the $\\ell_p$-norm, for $1 \\leq p \\leq 2$. Due to the mild smoothness of the problem, especially for $p \\to 1$, we develop and analyze a generalized version of Iteratively Reweighted Least Squares (IRLS). This simple and efficient algorithm performs the solution of optimization problems involving non-quadratic possibly non-convex and non-smoot"},"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":"1504.06815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-04-26T13:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"b7ad894609b6623cee9e94474246e339acf5bef69bec60596c105aaabf26db4b","abstract_canon_sha256":"7ab29acecd88f3e2f97481736d635c0e6e57c791a1cd603e0f55677939494de5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:44.331435Z","signature_b64":"SmjxLj2GBgqEfvaMcOKyrSr0k7Dr56H6qhgoUe4TVkJszwd4Y1grWvdai+liNe1HlQ89m+qD4vpf/VpY/l5NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2cd71d4f575cfd5a556585a1a9af6d6820f56bf8fe5a938f33be1665eef54df","last_reissued_at":"2026-05-18T02:17:44.331047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:44.331047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear Residual Minimization by Iteratively Reweighted Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Juliane Sigl","submitted_at":"2015-04-26T13:01:59Z","abstract_excerpt":"We address the numerical solution of minimal norm residuals of {\\it nonlinear} equations in finite dimensions. We take inspiration from the problem of finding a sparse vector solution by using greedy algorithms based on iterative residual minimizations in the $\\ell_p$-norm, for $1 \\leq p \\leq 2$. Due to the mild smoothness of the problem, especially for $p \\to 1$, we develop and analyze a generalized version of Iteratively Reweighted Least Squares (IRLS). This simple and efficient algorithm performs the solution of optimization problems involving non-quadratic possibly non-convex and non-smoot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06815","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":""},"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":"1504.06815","created_at":"2026-05-18T02:17:44.331102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06815v1","created_at":"2026-05-18T02:17:44.331102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06815","created_at":"2026-05-18T02:17:44.331102+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LGXDVHVOXH5","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LGXDVHVOXH5LJKW","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LGXDVHV","created_at":"2026-05-18T12:29:07.941421+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/6LGXDVHVOXH5LJKWLBNBVGXW22","json":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22.json","graph_json":"https://pith.science/api/pith-number/6LGXDVHVOXH5LJKWLBNBVGXW22/graph.json","events_json":"https://pith.science/api/pith-number/6LGXDVHVOXH5LJKWLBNBVGXW22/events.json","paper":"https://pith.science/paper/6LGXDVHV"},"agent_actions":{"view_html":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22","download_json":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22.json","view_paper":"https://pith.science/paper/6LGXDVHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06815&json=true","fetch_graph":"https://pith.science/api/pith-number/6LGXDVHVOXH5LJKWLBNBVGXW22/graph.json","fetch_events":"https://pith.science/api/pith-number/6LGXDVHVOXH5LJKWLBNBVGXW22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22/action/storage_attestation","attest_author":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22/action/author_attestation","sign_citation":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22/action/citation_signature","submit_replication":"https://pith.science/pith/6LGXDVHVOXH5LJKWLBNBVGXW22/action/replication_record"}},"created_at":"2026-05-18T02:17:44.331102+00:00","updated_at":"2026-05-18T02:17:44.331102+00:00"}