{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YRTJYFCUZSLDQURC3BMMYAI656","short_pith_number":"pith:YRTJYFCU","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"},"canonical_sha256":"c4669c1454cc96385222d858cc011eefb527603a1187cade921e183ae5a57986","source":{"kind":"arxiv","id":"1405.1502","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1502","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1502v1","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1502","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"YRTJYFCUZSLD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YRTJYFCUZSLDQURC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YRTJYFCU","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YRTJYFCUZSLDQURC3BMMYAI656","target":"record","payload":{"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"},"canonical_sha256":"c4669c1454cc96385222d858cc011eefb527603a1187cade921e183ae5a57986","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"},"source_kind":"arxiv","source_id":"1405.1502","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-18T02:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INOSs1FfMTLAUDSLwFfpgqamj8WF62/8kirEvG8+AMvAjfNCuwpTYxML/RvKT3C+5znuTCXv0zzoE+WkwKN7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:01:34.659940Z"},"content_sha256":"8d87e1d95019ecd5fb14f28edd80d07ac868e3222472ba4865eae6b3a4e9b321","schema_version":"1.0","event_id":"sha256:8d87e1d95019ecd5fb14f28edd80d07ac868e3222472ba4865eae6b3a4e9b321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YRTJYFCUZSLDQURC3BMMYAI656","target":"graph","payload":{"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"},"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-18T02:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsxUrskzd9/3aXeEuBlGBAm1kjxxmOkb5whGHOxOPjJnqWNCjnBM6VUiKN98g61HblhWNRUneyz/UslnCB+jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:01:34.660648Z"},"content_sha256":"d881d368c3b05a10eaa4e2433107f0315b909f09a9c65f3265d18f525b9d48c4","schema_version":"1.0","event_id":"sha256:d881d368c3b05a10eaa4e2433107f0315b909f09a9c65f3265d18f525b9d48c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/bundle.json","state_url":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRTJYFCUZSLDQURC3BMMYAI656/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-06-08T19:01:34Z","links":{"resolver":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656","bundle":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/bundle.json","state":"https://pith.science/pith/YRTJYFCUZSLDQURC3BMMYAI656/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRTJYFCUZSLDQURC3BMMYAI656/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YRTJYFCUZSLDQURC3BMMYAI656","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":"c708a2d25da5b51d695e920ebb064ea83727b9049feb140a151d01da01ceda88","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-07T04:38:45Z","title_canon_sha256":"f832e3e50ec6014d5c6c578d76048e8348736c6e3335c47a2540297606639713"},"schema_version":"1.0","source":{"id":"1405.1502","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1502","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1502v1","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1502","created_at":"2026-05-18T02:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"YRTJYFCUZSLD","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YRTJYFCUZSLDQURC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YRTJYFCU","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:d881d368c3b05a10eaa4e2433107f0315b909f09a9c65f3265d18f525b9d48c4","target":"graph","created_at":"2026-05-18T02:52:24Z","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":"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","authors_text":"Esa Ollila, Hyon-Jung Kim, Visa Koivunen","cross_cats":["math.IT","stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-07T04:38:45Z","title":"Robust iterative hard thresholding for compressed sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1502","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:8d87e1d95019ecd5fb14f28edd80d07ac868e3222472ba4865eae6b3a4e9b321","target":"record","created_at":"2026-05-18T02:52:24Z","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":"c708a2d25da5b51d695e920ebb064ea83727b9049feb140a151d01da01ceda88","cross_cats_sorted":["math.IT","stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-07T04:38:45Z","title_canon_sha256":"f832e3e50ec6014d5c6c578d76048e8348736c6e3335c47a2540297606639713"},"schema_version":"1.0","source":{"id":"1405.1502","kind":"arxiv","version":1}},"canonical_sha256":"c4669c1454cc96385222d858cc011eefb527603a1187cade921e183ae5a57986","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4669c1454cc96385222d858cc011eefb527603a1187cade921e183ae5a57986","first_computed_at":"2026-05-18T02:52:24.711711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:24.711711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cWSCRqiwGJ9KHHkQlv6vDO21sUydkbxx8x0KYJbPGuHRFjLr6uemS+4aj+fXDBuQookvfKDEgv7rbIvzMOtvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:24.712247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1502","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d87e1d95019ecd5fb14f28edd80d07ac868e3222472ba4865eae6b3a4e9b321","sha256:d881d368c3b05a10eaa4e2433107f0315b909f09a9c65f3265d18f525b9d48c4"],"state_sha256":"3f9636563d61a562c773b1d926f1e7f7506599b80cd8c9a39801ba521d6c5da2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTOAx+c1on7g9MaCecZlVfSi8F67KO4AAVBb/MJFkQV2OdG05eN7+r6xBJdPW7aOMs3dkCTDLHSeY1LC5anuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:01:34.664715Z","bundle_sha256":"b4ff44caff3f9f03ca0c709db88ac05b8b71267c30e89d0772f98ab3b24917b7"}}