{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NEX7XARK6TUSZUSVHYXKT4F5TT","short_pith_number":"pith:NEX7XARK","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"},"canonical_sha256":"692ffb822af4e92cd2553e2ea9f0bd9ce172870286bd82476d98cdb58e276e42","source":{"kind":"arxiv","id":"1610.03095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03095","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03095v1","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03095","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"NEX7XARK6TUS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEX7XARK6TUSZUSV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEX7XARK","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NEX7XARK6TUSZUSVHYXKT4F5TT","target":"record","payload":{"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"},"canonical_sha256":"692ffb822af4e92cd2553e2ea9f0bd9ce172870286bd82476d98cdb58e276e42","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"},"source_kind":"arxiv","source_id":"1610.03095","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCm1ecEk0cLLu8KQJ8Vcd3TRFsQT3vHhArWJtqW6tv+oRZ8ZsvqOf/69FDMO9Geuyi6eWwhZR210SdNiwB37BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:08:34.906510Z"},"content_sha256":"fdd80bfeef764b9af1d3c0284e1516a57059c2c80bc260cefe26bd40d5da08a0","schema_version":"1.0","event_id":"sha256:fdd80bfeef764b9af1d3c0284e1516a57059c2c80bc260cefe26bd40d5da08a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NEX7XARK6TUSZUSVHYXKT4F5TT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:02:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67UCJzrTk+WsrcEQ7760I7B3giILDd+w+zG1gUPfxXgq2jvpacj9vVSx+D8Cq56ignp99enl92rjl5YUuWXsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:08:34.906874Z"},"content_sha256":"ceb2e6743e7d0031749a63863eeebc22f97db06786bc3789a40e93570aafaa86","schema_version":"1.0","event_id":"sha256:ceb2e6743e7d0031749a63863eeebc22f97db06786bc3789a40e93570aafaa86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/bundle.json","state_url":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T05:08:34Z","links":{"resolver":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT","bundle":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/bundle.json","state":"https://pith.science/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEX7XARK6TUSZUSVHYXKT4F5TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NEX7XARK6TUSZUSVHYXKT4F5TT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a05add6fa441a01c231e40e099a8ef0c62a487430997bdd3097ad2e6541b45e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-10T20:52:00Z","title_canon_sha256":"5fec2e7a821f24c6785528f955bcb1e1a1cd837c44e290edc68d2d17082a4023"},"schema_version":"1.0","source":{"id":"1610.03095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03095","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03095v1","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03095","created_at":"2026-05-18T01:02:46Z"},{"alias_kind":"pith_short_12","alias_value":"NEX7XARK6TUS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NEX7XARK6TUSZUSV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NEX7XARK","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:ceb2e6743e7d0031749a63863eeebc22f97db06786bc3789a40e93570aafaa86","target":"graph","created_at":"2026-05-18T01:02:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Anna Oleynik, M{\\aa}rten Gulliksson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-10T20:52:00Z","title":"Greedy Gauss-Newton algorithm for finding sparse solutions to nonlinear underdetermined systems of equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03095","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fdd80bfeef764b9af1d3c0284e1516a57059c2c80bc260cefe26bd40d5da08a0","target":"record","created_at":"2026-05-18T01:02:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6a05add6fa441a01c231e40e099a8ef0c62a487430997bdd3097ad2e6541b45e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-10-10T20:52:00Z","title_canon_sha256":"5fec2e7a821f24c6785528f955bcb1e1a1cd837c44e290edc68d2d17082a4023"},"schema_version":"1.0","source":{"id":"1610.03095","kind":"arxiv","version":1}},"canonical_sha256":"692ffb822af4e92cd2553e2ea9f0bd9ce172870286bd82476d98cdb58e276e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"692ffb822af4e92cd2553e2ea9f0bd9ce172870286bd82476d98cdb58e276e42","first_computed_at":"2026-05-18T01:02:46.564020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:46.564020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kEa8wXbMRJg/ZjybXIdLhR47cgC8Rwnvs3Fyk33V+//y6RoSCV4RcKygDZ0HpY2I8LKpieCeXVg6sBTkRkvHBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:46.564453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdd80bfeef764b9af1d3c0284e1516a57059c2c80bc260cefe26bd40d5da08a0","sha256:ceb2e6743e7d0031749a63863eeebc22f97db06786bc3789a40e93570aafaa86"],"state_sha256":"1198e0bdf4041627f15f7d4b2ac65f6da53326d06ec6ef9fa83e2f002eed6216"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"moM9gQ6SouTJpTmIvA680S+mRVV/hVB3NRBRdv90f/D7VSUhVuYl618bExqsUf9EaznadPPRxOvh743u0rzUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:08:34.910124Z","bundle_sha256":"5869ef5dd04206e3ad69edc9bc1fd26e2da007b55fdc0a6deaaeb03e68aa6bb8"}}