{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YRTJYFCUZSLDQURC3BMMYAI656","short_pith_number":"pith:YRTJYFCU","schema_version":"1.0","canonical_sha256":"c4669c1454cc96385222d858cc011eefb527603a1187cade921e183ae5a57986","source":{"kind":"arxiv","id":"1405.1502","version":1},"attestation_state":"computed","paper":{"title":"Robust iterative hard thresholding for compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Esa Ollila, Hyon-Jung Kim, Visa Koivunen","submitted_at":"2014-05-07T04:38:45Z","abstract_excerpt":"Compressed sensing (CS) or sparse signal reconstruction (SSR) is a signal processing technique that exploits the fact that acquired data can have a sparse representation in some basis. One popular technique to reconstruct or approximate the unknown sparse signal is the iterative hard thresholding (IHT) which however performs very poorly under non-Gaussian noise conditions or in the face of outliers (gross errors). In this paper, we propose a robust IHT method based on ideas from $M$-estimation that estimates the sparse signal and the scale of the error distribution simultaneously. The method h"},"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":"1405.1502","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-07T04:38:45Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"f832e3e50ec6014d5c6c578d76048e8348736c6e3335c47a2540297606639713","abstract_canon_sha256":"c708a2d25da5b51d695e920ebb064ea83727b9049feb140a151d01da01ceda88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:24.712247Z","signature_b64":"cWSCRqiwGJ9KHHkQlv6vDO21sUydkbxx8x0KYJbPGuHRFjLr6uemS+4aj+fXDBuQookvfKDEgv7rbIvzMOtvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4669c1454cc96385222d858cc011eefb527603a1187cade921e183ae5a57986","last_reissued_at":"2026-05-18T02:52:24.711711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:24.711711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust iterative hard thresholding for compressed sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Esa Ollila, Hyon-Jung Kim, Visa Koivunen","submitted_at":"2014-05-07T04:38:45Z","abstract_excerpt":"Compressed sensing (CS) or sparse signal reconstruction (SSR) is a signal processing technique that exploits the fact that acquired data can have a sparse representation in some basis. One popular technique to reconstruct or approximate the unknown sparse signal is the iterative hard thresholding (IHT) which however performs very poorly under non-Gaussian noise conditions or in the face of outliers (gross errors). In this paper, we propose a robust IHT method based on ideas from $M$-estimation that estimates the sparse signal and the scale of the error distribution simultaneously. The method h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1502","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":"1405.1502","created_at":"2026-05-18T02:52:24.711795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1502v1","created_at":"2026-05-18T02:52:24.711795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1502","created_at":"2026-05-18T02:52:24.711795+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRTJYFCUZSLD","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRTJYFCUZSLDQURC","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRTJYFCU","created_at":"2026-05-18T12:28:57.508820+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/YRTJYFCUZSLDQURC3BMMYAI656","json":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656.json","graph_json":"https://pith.science/api/pith-number/YRTJYFCUZSLDQURC3BMMYAI656/graph.json","events_json":"https://pith.science/api/pith-number/YRTJYFCUZSLDQURC3BMMYAI656/events.json","paper":"https://pith.science/paper/YRTJYFCU"},"agent_actions":{"view_html":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656","download_json":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656.json","view_paper":"https://pith.science/paper/YRTJYFCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1502&json=true","fetch_graph":"https://pith.science/api/pith-number/YRTJYFCUZSLDQURC3BMMYAI656/graph.json","fetch_events":"https://pith.science/api/pith-number/YRTJYFCUZSLDQURC3BMMYAI656/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/action/storage_attestation","attest_author":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/action/author_attestation","sign_citation":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/action/citation_signature","submit_replication":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/action/replication_record"}},"created_at":"2026-05-18T02:52:24.711795+00:00","updated_at":"2026-05-18T02:52:24.711795+00:00"}