{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XM7DCPZO7BKHXMFY55ANKWNX4A","short_pith_number":"pith:XM7DCPZO","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"},"canonical_sha256":"bb3e313f2ef8547bb0b8ef40d559b7e03b8c92f7cf9cf4d44f4b8099f57a8d88","source":{"kind":"arxiv","id":"1602.04429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04429","created_at":"2026-05-18T01:10:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04429v1","created_at":"2026-05-18T01:10:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04429","created_at":"2026-05-18T01:10:07Z"},{"alias_kind":"pith_short_12","alias_value":"XM7DCPZO7BKH","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XM7DCPZO7BKHXMFY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XM7DCPZO","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XM7DCPZO7BKHXMFY55ANKWNX4A","target":"record","payload":{"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"},"canonical_sha256":"bb3e313f2ef8547bb0b8ef40d559b7e03b8c92f7cf9cf4d44f4b8099f57a8d88","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"},"source_kind":"arxiv","source_id":"1602.04429","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:10:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L/e42rx618EeDpMh00prCIYGyVfC6+G7pvSRS6mNkKsOfxptecjTXLmU1LMIL6ZkbcHSLKejk1z/6UwanDUnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:09:47.498773Z"},"content_sha256":"ff35c99c346af940f5b558692086731fc22afccd475cf04e0683a9c39f47f11c","schema_version":"1.0","event_id":"sha256:ff35c99c346af940f5b558692086731fc22afccd475cf04e0683a9c39f47f11c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XM7DCPZO7BKHXMFY55ANKWNX4A","target":"graph","payload":{"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"},"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:10:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueHfIGAbxcr//i9XP4vjgma1GC+EEzz5Gk794B2tKcg+Uknw8EDrVyut4Y5E5vN8BpNSQcDa4tAWCZ1zK98OAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:09:47.499386Z"},"content_sha256":"800b197d01e05721fc7253def395fa674e056f1e25e1d87422ec076b09701317","schema_version":"1.0","event_id":"sha256:800b197d01e05721fc7253def395fa674e056f1e25e1d87422ec076b09701317"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/bundle.json","state_url":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/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-23T21:09:47Z","links":{"resolver":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A","bundle":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/bundle.json","state":"https://pith.science/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XM7DCPZO7BKHXMFY55ANKWNX4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XM7DCPZO7BKHXMFY55ANKWNX4A","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":"33ce0a4c62f3386af03f807b92d43638d6762e5054820eecbee5b5a3d8865380","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-14T08:20:10Z","title_canon_sha256":"476f04eaf7ad26b425c5ac139977a73299f4504a7e40348848461555c432cc7c"},"schema_version":"1.0","source":{"id":"1602.04429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04429","created_at":"2026-05-18T01:10:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04429v1","created_at":"2026-05-18T01:10:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04429","created_at":"2026-05-18T01:10:07Z"},{"alias_kind":"pith_short_12","alias_value":"XM7DCPZO7BKH","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XM7DCPZO7BKHXMFY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XM7DCPZO","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:800b197d01e05721fc7253def395fa674e056f1e25e1d87422ec076b09701317","target":"graph","created_at":"2026-05-18T01:10:07Z","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":"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. ","authors_text":"Barbara Kaltenbacher, Elena Resmerita, Kristian Bredies","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-14T08:20:10Z","title":"The least error method for sparse solution reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04429","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:ff35c99c346af940f5b558692086731fc22afccd475cf04e0683a9c39f47f11c","target":"record","created_at":"2026-05-18T01:10:07Z","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":"33ce0a4c62f3386af03f807b92d43638d6762e5054820eecbee5b5a3d8865380","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-02-14T08:20:10Z","title_canon_sha256":"476f04eaf7ad26b425c5ac139977a73299f4504a7e40348848461555c432cc7c"},"schema_version":"1.0","source":{"id":"1602.04429","kind":"arxiv","version":1}},"canonical_sha256":"bb3e313f2ef8547bb0b8ef40d559b7e03b8c92f7cf9cf4d44f4b8099f57a8d88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb3e313f2ef8547bb0b8ef40d559b7e03b8c92f7cf9cf4d44f4b8099f57a8d88","first_computed_at":"2026-05-18T01:10:07.023423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:07.023423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G9OmpbHd3GZBIiLk+WwQKx3Aqdi+bl5I3uWv91CU8geQrQhdsDC2SGd1OwgaRUGq2BuKnyHyTd/4k9olgqT+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:07.023925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff35c99c346af940f5b558692086731fc22afccd475cf04e0683a9c39f47f11c","sha256:800b197d01e05721fc7253def395fa674e056f1e25e1d87422ec076b09701317"],"state_sha256":"17b3ef0e5b023272dd85a212ce7871a29b117c25af58c788d148c1a527a6e133"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOg7w61jcO2fZzCDFThNAoxzA11PqKzTem1vLRAfsa0lvQh4FFywWWWVjAapcWBJR0WlvFz4SWg8KEJO/eA/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:09:47.502839Z","bundle_sha256":"af05d02a3a712a39c6d204d496938d64987947087d6d82e04592dfdc333a0728"}}