{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7BPJQSIKLPN7SS23O2M2TUC75A","short_pith_number":"pith:7BPJQSIK","schema_version":"1.0","canonical_sha256":"f85e98490a5bdbf94b5b7699a9d05fe82c5cc1dd4802a472eea0963dd2f2b880","source":{"kind":"arxiv","id":"1307.4700","version":1},"attestation_state":"computed","paper":{"title":"Lorentzian Iterative Hard Thresholding: Robust Compressed Sensing with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenneth E. Barner, Rafael E. Carrillo","submitted_at":"2013-07-17T17:07:58Z","abstract_excerpt":"Commonly employed reconstruction algorithms in compressed sensing (CS) use the $L_2$ norm as the metric for the residual error. However, it is well-known that least squares (LS) based estimators are highly sensitive to outliers present in the measurement vector leading to a poor performance when the noise no longer follows the Gaussian assumption but, instead, is better characterized by heavier-than-Gaussian tailed distributions. In this paper, we propose a robust iterative hard Thresholding (IHT) algorithm for reconstructing sparse signals in the presence of impulsive noise. To address this p"},"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":"1307.4700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T17:07:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3cc76e9a1f182a341a40e64f3b1cd504175efdbaefac909c768d0c19dd16979","abstract_canon_sha256":"b9add5db4fda2617e1e73a14c5e099603653a9fd840e0a1b963baa0212241fd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:04.772904Z","signature_b64":"lxWDMw31a9juoJLAdrk7krk3S75VnSaZGa3TLkoMDe78r5eITSRz7Y43qA7ZLlF6Tr+8H80EjSw0v4x9+HJdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85e98490a5bdbf94b5b7699a9d05fe82c5cc1dd4802a472eea0963dd2f2b880","last_reissued_at":"2026-05-18T03:06:04.772494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:04.772494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lorentzian Iterative Hard Thresholding: Robust Compressed Sensing with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kenneth E. Barner, Rafael E. Carrillo","submitted_at":"2013-07-17T17:07:58Z","abstract_excerpt":"Commonly employed reconstruction algorithms in compressed sensing (CS) use the $L_2$ norm as the metric for the residual error. However, it is well-known that least squares (LS) based estimators are highly sensitive to outliers present in the measurement vector leading to a poor performance when the noise no longer follows the Gaussian assumption but, instead, is better characterized by heavier-than-Gaussian tailed distributions. In this paper, we propose a robust iterative hard Thresholding (IHT) algorithm for reconstructing sparse signals in the presence of impulsive noise. To address this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4700","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":"1307.4700","created_at":"2026-05-18T03:06:04.772555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4700v1","created_at":"2026-05-18T03:06:04.772555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4700","created_at":"2026-05-18T03:06:04.772555+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BPJQSIKLPN7","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BPJQSIKLPN7SS23","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BPJQSIK","created_at":"2026-05-18T12:27:36.564083+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/7BPJQSIKLPN7SS23O2M2TUC75A","json":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A.json","graph_json":"https://pith.science/api/pith-number/7BPJQSIKLPN7SS23O2M2TUC75A/graph.json","events_json":"https://pith.science/api/pith-number/7BPJQSIKLPN7SS23O2M2TUC75A/events.json","paper":"https://pith.science/paper/7BPJQSIK"},"agent_actions":{"view_html":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A","download_json":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A.json","view_paper":"https://pith.science/paper/7BPJQSIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4700&json=true","fetch_graph":"https://pith.science/api/pith-number/7BPJQSIKLPN7SS23O2M2TUC75A/graph.json","fetch_events":"https://pith.science/api/pith-number/7BPJQSIKLPN7SS23O2M2TUC75A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/action/storage_attestation","attest_author":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/action/author_attestation","sign_citation":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/action/citation_signature","submit_replication":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/action/replication_record"}},"created_at":"2026-05-18T03:06:04.772555+00:00","updated_at":"2026-05-18T03:06:04.772555+00:00"}