{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NEX7XARK6TUSZUSVHYXKT4F5TT","short_pith_number":"pith:NEX7XARK","schema_version":"1.0","canonical_sha256":"692ffb822af4e92cd2553e2ea9f0bd9ce172870286bd82476d98cdb58e276e42","source":{"kind":"arxiv","id":"1610.03095","version":1},"attestation_state":"computed","paper":{"title":"Greedy Gauss-Newton algorithm for finding sparse solutions to nonlinear underdetermined systems of equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anna Oleynik, M{\\aa}rten Gulliksson","submitted_at":"2016-10-10T20:52:00Z","abstract_excerpt":"We consider the problem of finding sparse solutions to a system of underdetermined nonlinear system of equations. The methods are based on a Gauss-Newton approach with line search where the search direction is found by solving a linearized problem using only a subset of the columns in the Jacobian. The choice of columns in the Jacobian is made through a greedy approach looking at either maximum descent or an approach corresponding to orthogonal matching for linear problems. The methods are shown to be convergent and efficient and outperform the $\\ell_1$ approach on the test problems presented."},"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":"1610.03095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-10T20:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"5fec2e7a821f24c6785528f955bcb1e1a1cd837c44e290edc68d2d17082a4023","abstract_canon_sha256":"6a05add6fa441a01c231e40e099a8ef0c62a487430997bdd3097ad2e6541b45e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:46.564453Z","signature_b64":"kEa8wXbMRJg/ZjybXIdLhR47cgC8Rwnvs3Fyk33V+//y6RoSCV4RcKygDZ0HpY2I8LKpieCeXVg6sBTkRkvHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692ffb822af4e92cd2553e2ea9f0bd9ce172870286bd82476d98cdb58e276e42","last_reissued_at":"2026-05-18T01:02:46.564020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:46.564020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Gauss-Newton algorithm for finding sparse solutions to nonlinear underdetermined systems of equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Anna Oleynik, M{\\aa}rten Gulliksson","submitted_at":"2016-10-10T20:52:00Z","abstract_excerpt":"We consider the problem of finding sparse solutions to a system of underdetermined nonlinear system of equations. The methods are based on a Gauss-Newton approach with line search where the search direction is found by solving a linearized problem using only a subset of the columns in the Jacobian. The choice of columns in the Jacobian is made through a greedy approach looking at either maximum descent or an approach corresponding to orthogonal matching for linear problems. The methods are shown to be convergent and efficient and outperform the $\\ell_1$ approach on the test problems presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03095","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":"1610.03095","created_at":"2026-05-18T01:02:46.564082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03095v1","created_at":"2026-05-18T01:02:46.564082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03095","created_at":"2026-05-18T01:02:46.564082+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEX7XARK6TUS","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEX7XARK6TUSZUSV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEX7XARK","created_at":"2026-05-18T12:30:32.724797+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/NEX7XARK6TUSZUSVHYXKT4F5TT","json":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT.json","graph_json":"https://pith.science/api/pith-number/NEX7XARK6TUSZUSVHYXKT4F5TT/graph.json","events_json":"https://pith.science/api/pith-number/NEX7XARK6TUSZUSVHYXKT4F5TT/events.json","paper":"https://pith.science/paper/NEX7XARK"},"agent_actions":{"view_html":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT","download_json":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT.json","view_paper":"https://pith.science/paper/NEX7XARK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03095&json=true","fetch_graph":"https://pith.science/api/pith-number/NEX7XARK6TUSZUSVHYXKT4F5TT/graph.json","fetch_events":"https://pith.science/api/pith-number/NEX7XARK6TUSZUSVHYXKT4F5TT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/action/storage_attestation","attest_author":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/action/author_attestation","sign_citation":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/action/citation_signature","submit_replication":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/action/replication_record"}},"created_at":"2026-05-18T01:02:46.564082+00:00","updated_at":"2026-05-18T01:02:46.564082+00:00"}