{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZBGTLQPFV2CXKFDBOTIOYR4BKG","short_pith_number":"pith:ZBGTLQPF","schema_version":"1.0","canonical_sha256":"c84d35c1e5ae8575146174d0ec478151ab4a9d5eedec18955c566dec890e01e0","source":{"kind":"arxiv","id":"2201.08620","version":3},"attestation_state":"computed","paper":{"title":"Extended Randomized Kaczmarz Method for Sparse Least Squares and Impulsive Noise Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Dirk A Lorenz, Frank Sch\\\"opfer, Lionel Tondji, Maximilian Winkler","submitted_at":"2022-01-21T10:14:33Z","abstract_excerpt":"The Extended Randomized Kaczmarz method is a well known iterative scheme which can find the Moore-Penrose inverse solution of a possibly inconsistent linear system and requires only one additional column of the system matrix in each iteration in comparison with the standard randomized Kaczmarz method. Also, the Sparse Randomized Kaczmarz method has been shown to converge linearly to a sparse solution of a consistent linear system. Here, we combine both ideas and propose an Extended Sparse Randomized Kaczmarz method. We show linear expected convergence to a sparse least squares solution in the "},"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":"2201.08620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2022-01-21T10:14:33Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"782989491535c80e350d2227cb211f9bf9285ac60f1e94393016717b575fc082","abstract_canon_sha256":"a2db0c78ae9c348eca1373763e40a2cb7d3f1905cb3e4035c35ea9f369438230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:53.650004Z","signature_b64":"wgML7JHxhQsqphX2jp8H1LHlPSjOcnH2u9AAca1AYbSbZ38uiOE6SscddRuSX3f2IEfz5X8kZfaWN/kjgQPiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84d35c1e5ae8575146174d0ec478151ab4a9d5eedec18955c566dec890e01e0","last_reissued_at":"2026-07-05T04:41:53.649574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:53.649574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended Randomized Kaczmarz Method for Sparse Least Squares and Impulsive Noise Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Dirk A Lorenz, Frank Sch\\\"opfer, Lionel Tondji, Maximilian Winkler","submitted_at":"2022-01-21T10:14:33Z","abstract_excerpt":"The Extended Randomized Kaczmarz method is a well known iterative scheme which can find the Moore-Penrose inverse solution of a possibly inconsistent linear system and requires only one additional column of the system matrix in each iteration in comparison with the standard randomized Kaczmarz method. Also, the Sparse Randomized Kaczmarz method has been shown to converge linearly to a sparse solution of a consistent linear system. Here, we combine both ideas and propose an Extended Sparse Randomized Kaczmarz method. We show linear expected convergence to a sparse least squares solution in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.08620","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/2201.08620/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":"2201.08620","created_at":"2026-07-05T04:41:53.649628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.08620v3","created_at":"2026-07-05T04:41:53.649628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.08620","created_at":"2026-07-05T04:41:53.649628+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBGTLQPFV2CX","created_at":"2026-07-05T04:41:53.649628+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBGTLQPFV2CXKFDB","created_at":"2026-07-05T04:41:53.649628+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBGTLQPF","created_at":"2026-07-05T04:41:53.649628+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/ZBGTLQPFV2CXKFDBOTIOYR4BKG","json":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG.json","graph_json":"https://pith.science/api/pith-number/ZBGTLQPFV2CXKFDBOTIOYR4BKG/graph.json","events_json":"https://pith.science/api/pith-number/ZBGTLQPFV2CXKFDBOTIOYR4BKG/events.json","paper":"https://pith.science/paper/ZBGTLQPF"},"agent_actions":{"view_html":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG","download_json":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG.json","view_paper":"https://pith.science/paper/ZBGTLQPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.08620&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBGTLQPFV2CXKFDBOTIOYR4BKG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBGTLQPFV2CXKFDBOTIOYR4BKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG/action/storage_attestation","attest_author":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG/action/author_attestation","sign_citation":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG/action/citation_signature","submit_replication":"https://pith.science/pith/ZBGTLQPFV2CXKFDBOTIOYR4BKG/action/replication_record"}},"created_at":"2026-07-05T04:41:53.649628+00:00","updated_at":"2026-07-05T04:41:53.649628+00:00"}