{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7BPJQSIKLPN7SS23O2M2TUC75A","short_pith_number":"pith:7BPJQSIK","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"},"canonical_sha256":"f85e98490a5bdbf94b5b7699a9d05fe82c5cc1dd4802a472eea0963dd2f2b880","source":{"kind":"arxiv","id":"1307.4700","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4700","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4700v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4700","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"7BPJQSIKLPN7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7BPJQSIKLPN7SS23","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7BPJQSIK","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7BPJQSIKLPN7SS23O2M2TUC75A","target":"record","payload":{"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"},"canonical_sha256":"f85e98490a5bdbf94b5b7699a9d05fe82c5cc1dd4802a472eea0963dd2f2b880","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"},"source_kind":"arxiv","source_id":"1307.4700","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-18T03:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y6sjQNPP3LnfyMkO4njQVezVP2ImwI5N2oXQNhaAm8TsrwekjwmqSU2BZwYcD89DvrwPQzZNnMwCwlUbR7IWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:26:13.207349Z"},"content_sha256":"ec3b66a69a7e693c8c347c1974754fe24972d868a95a3ad541243685551ac1c0","schema_version":"1.0","event_id":"sha256:ec3b66a69a7e693c8c347c1974754fe24972d868a95a3ad541243685551ac1c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7BPJQSIKLPN7SS23O2M2TUC75A","target":"graph","payload":{"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"},"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-18T03:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bv+zYC+Por/6N2a0cdj9LpJyDKjwI4ELWdVhyqm6A3ceOwoP5dDFALjmGNcwSzUdmUoE1L3T6aHXXbWroWSKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:26:13.207690Z"},"content_sha256":"74b7737941d80e67e3fff1c261621d41e1b9a737e48758bf57fb7bea53d5600a","schema_version":"1.0","event_id":"sha256:74b7737941d80e67e3fff1c261621d41e1b9a737e48758bf57fb7bea53d5600a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/bundle.json","state_url":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BPJQSIKLPN7SS23O2M2TUC75A/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-27T15:26:13Z","links":{"resolver":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A","bundle":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/bundle.json","state":"https://pith.science/pith/7BPJQSIKLPN7SS23O2M2TUC75A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BPJQSIKLPN7SS23O2M2TUC75A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7BPJQSIKLPN7SS23O2M2TUC75A","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":"b9add5db4fda2617e1e73a14c5e099603653a9fd840e0a1b963baa0212241fd6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T17:07:58Z","title_canon_sha256":"a3cc76e9a1f182a341a40e64f3b1cd504175efdbaefac909c768d0c19dd16979"},"schema_version":"1.0","source":{"id":"1307.4700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4700","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4700v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4700","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"7BPJQSIKLPN7","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7BPJQSIKLPN7SS23","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7BPJQSIK","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:74b7737941d80e67e3fff1c261621d41e1b9a737e48758bf57fb7bea53d5600a","target":"graph","created_at":"2026-05-18T03:06:04Z","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":"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","authors_text":"Kenneth E. Barner, Rafael E. Carrillo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T17:07:58Z","title":"Lorentzian Iterative Hard Thresholding: Robust Compressed Sensing with Prior Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4700","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:ec3b66a69a7e693c8c347c1974754fe24972d868a95a3ad541243685551ac1c0","target":"record","created_at":"2026-05-18T03:06:04Z","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":"b9add5db4fda2617e1e73a14c5e099603653a9fd840e0a1b963baa0212241fd6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T17:07:58Z","title_canon_sha256":"a3cc76e9a1f182a341a40e64f3b1cd504175efdbaefac909c768d0c19dd16979"},"schema_version":"1.0","source":{"id":"1307.4700","kind":"arxiv","version":1}},"canonical_sha256":"f85e98490a5bdbf94b5b7699a9d05fe82c5cc1dd4802a472eea0963dd2f2b880","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f85e98490a5bdbf94b5b7699a9d05fe82c5cc1dd4802a472eea0963dd2f2b880","first_computed_at":"2026-05-18T03:06:04.772494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:04.772494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lxWDMw31a9juoJLAdrk7krk3S75VnSaZGa3TLkoMDe78r5eITSRz7Y43qA7ZLlF6Tr+8H80EjSw0v4x9+HJdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:04.772904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec3b66a69a7e693c8c347c1974754fe24972d868a95a3ad541243685551ac1c0","sha256:74b7737941d80e67e3fff1c261621d41e1b9a737e48758bf57fb7bea53d5600a"],"state_sha256":"52278e462ebd6357a4cf5d4ae3dd2791a8a74a3fc753457047657dc65c757133"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3YKJf0DqO3v0merejwkpl7kaCwZdpqRv9U7/NF31CBkfSh20MjfGgiTHFXGqcoTYRCZ6Ts91wWdZeBZXQrFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:26:13.209446Z","bundle_sha256":"0c3dcb1f54390f57d122e31adda9ed64ecec256a15e0f49dbdaf9d0f2160a2ea"}}