{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XM7DCPZO7BKHXMFY55ANKWNX4A","short_pith_number":"pith:XM7DCPZO","schema_version":"1.0","canonical_sha256":"bb3e313f2ef8547bb0b8ef40d559b7e03b8c92f7cf9cf4d44f4b8099f57a8d88","source":{"kind":"arxiv","id":"1602.04429","version":1},"attestation_state":"computed","paper":{"title":"The least error method for sparse solution reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Barbara Kaltenbacher, Elena Resmerita, Kristian Bredies","submitted_at":"2016-02-14T08:20:10Z","abstract_excerpt":"This work deals with a regularization method enforcing solution sparsity of linear ill-posed problems by appropriate discretization in the image space. Namely, we formulate the so called least error method in an $\\ell^1$ setting and perform the convergence analysis by choosing the discretization level according to an a priori rule, as well as two a posteriori rules, via the discrepancy principle and the monotone error rule, respectively. Depending on the setting, linear or sublinear convergence rates in the $\\ell^1$-norm are obtained under a source condition yielding sparsity of the solution. "},"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":"1602.04429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-14T08:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"476f04eaf7ad26b425c5ac139977a73299f4504a7e40348848461555c432cc7c","abstract_canon_sha256":"33ce0a4c62f3386af03f807b92d43638d6762e5054820eecbee5b5a3d8865380"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:07.023925Z","signature_b64":"G9OmpbHd3GZBIiLk+WwQKx3Aqdi+bl5I3uWv91CU8geQrQhdsDC2SGd1OwgaRUGq2BuKnyHyTd/4k9olgqT+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb3e313f2ef8547bb0b8ef40d559b7e03b8c92f7cf9cf4d44f4b8099f57a8d88","last_reissued_at":"2026-05-18T01:10:07.023423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:07.023423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The least error method for sparse solution reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Barbara Kaltenbacher, Elena Resmerita, Kristian Bredies","submitted_at":"2016-02-14T08:20:10Z","abstract_excerpt":"This work deals with a regularization method enforcing solution sparsity of linear ill-posed problems by appropriate discretization in the image space. Namely, we formulate the so called least error method in an $\\ell^1$ setting and perform the convergence analysis by choosing the discretization level according to an a priori rule, as well as two a posteriori rules, via the discrepancy principle and the monotone error rule, respectively. Depending on the setting, linear or sublinear convergence rates in the $\\ell^1$-norm are obtained under a source condition yielding sparsity of the solution. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04429","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":"1602.04429","created_at":"2026-05-18T01:10:07.023499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04429v1","created_at":"2026-05-18T01:10:07.023499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04429","created_at":"2026-05-18T01:10:07.023499+00:00"},{"alias_kind":"pith_short_12","alias_value":"XM7DCPZO7BKH","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XM7DCPZO7BKHXMFY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XM7DCPZO","created_at":"2026-05-18T12:30:51.357362+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/XM7DCPZO7BKHXMFY55ANKWNX4A","json":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A.json","graph_json":"https://pith.science/api/pith-number/XM7DCPZO7BKHXMFY55ANKWNX4A/graph.json","events_json":"https://pith.science/api/pith-number/XM7DCPZO7BKHXMFY55ANKWNX4A/events.json","paper":"https://pith.science/paper/XM7DCPZO"},"agent_actions":{"view_html":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A","download_json":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A.json","view_paper":"https://pith.science/paper/XM7DCPZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04429&json=true","fetch_graph":"https://pith.science/api/pith-number/XM7DCPZO7BKHXMFY55ANKWNX4A/graph.json","fetch_events":"https://pith.science/api/pith-number/XM7DCPZO7BKHXMFY55ANKWNX4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/action/storage_attestation","attest_author":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/action/author_attestation","sign_citation":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/action/citation_signature","submit_replication":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/action/replication_record"}},"created_at":"2026-05-18T01:10:07.023499+00:00","updated_at":"2026-05-18T01:10:07.023499+00:00"}