{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3QEL35L6JU7VOLCJOTVUNFDFAO","short_pith_number":"pith:3QEL35L6","canonical_record":{"source":{"id":"1902.03988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-08T18:22:18Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"3decdf72227d5cc34a4042d6f4e5e47092442b5adc320e44ae7b03aba737050e","abstract_canon_sha256":"a197d685e063511d02156735bd8ba493b91793293c9ef8df9284e4f107c80afe"},"schema_version":"1.0"},"canonical_sha256":"dc08bdf57e4d3f572c4974eb4694650384bc1a01f3dd1128135320d38cf42536","source":{"kind":"arxiv","id":"1902.03988","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03988","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03988v2","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03988","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"pith_short_12","alias_value":"3QEL35L6JU7V","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3QEL35L6JU7VOLCJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3QEL35L6","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3QEL35L6JU7VOLCJOTVUNFDFAO","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-08T18:22:18Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"3decdf72227d5cc34a4042d6f4e5e47092442b5adc320e44ae7b03aba737050e","abstract_canon_sha256":"a197d685e063511d02156735bd8ba493b91793293c9ef8df9284e4f107c80afe"},"schema_version":"1.0"},"canonical_sha256":"dc08bdf57e4d3f572c4974eb4694650384bc1a01f3dd1128135320d38cf42536","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:50.071189Z","signature_b64":"6E66vUy3VIe5i+BMwATFfe5ESL3O0fkDfaJEePkmOM9lHD+7nMFBcaozJ0s0fqBfGAl5fLW3HPG8gaagZ42XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc08bdf57e4d3f572c4974eb4694650384bc1a01f3dd1128135320d38cf42536","last_reissued_at":"2026-05-17T23:49:50.070680Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:50.070680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03988","source_version":2,"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-17T23:49:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oe7ga7z57wP4xj6mfzslEVsta6i3nu4mbU30hlYxOj+Qk/nrw4ESIEThsvg8T5nSmPvPTZQPAjCnC7jo/Xz4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:29:00.564214Z"},"content_sha256":"2c8b008511eabf786136eb406265b134e1cdfe17dbb4a8a6839daa2ec2b4aa59","schema_version":"1.0","event_id":"sha256:2c8b008511eabf786136eb406265b134e1cdfe17dbb4a8a6839daa2ec2b4aa59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3QEL35L6JU7VOLCJOTVUNFDFAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Iterative Method for Removing Impulsive Noise from Sparse Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"eess.SP","authors_text":"Ehsan Asadi, Farokh Marvasti, Hamidreza Abin, Nematollah Zarmehi, Sahar Sadrizadeh","submitted_at":"2019-02-08T18:22:18Z","abstract_excerpt":"In this paper, we propose a new method to reconstruct a signal corrupted by noise where both signal and noise are sparse but in different domains. The problem investigated in this paper arises in different applications such as impulsive noise removal from images, audios and videos, decomposition of low-rank and sparse components of matrices, and separation of texts from images. First, we provide a cost function for our problem and then present an iterative method to find its local minimum. The analysis of the algorithm is also provided. As an application of this problem, we apply our algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03988","kind":"arxiv","version":2},"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-17T23:49:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8r9GgfbnErmSiRt4NAk1gftj2x+fnxnGES0yZjtbpRcC8whr/1i0IJnXJ45kxca7XXxSuD8ex7vi1StuGXYKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:29:00.564585Z"},"content_sha256":"deda8c852b23ce2eefba31a8129c4f3a50dda48b93f0875dacdcbfeedc6a0cba","schema_version":"1.0","event_id":"sha256:deda8c852b23ce2eefba31a8129c4f3a50dda48b93f0875dacdcbfeedc6a0cba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QEL35L6JU7VOLCJOTVUNFDFAO/bundle.json","state_url":"https://pith.science/pith/3QEL35L6JU7VOLCJOTVUNFDFAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QEL35L6JU7VOLCJOTVUNFDFAO/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-05T21:29:00Z","links":{"resolver":"https://pith.science/pith/3QEL35L6JU7VOLCJOTVUNFDFAO","bundle":"https://pith.science/pith/3QEL35L6JU7VOLCJOTVUNFDFAO/bundle.json","state":"https://pith.science/pith/3QEL35L6JU7VOLCJOTVUNFDFAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QEL35L6JU7VOLCJOTVUNFDFAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3QEL35L6JU7VOLCJOTVUNFDFAO","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":"a197d685e063511d02156735bd8ba493b91793293c9ef8df9284e4f107c80afe","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-08T18:22:18Z","title_canon_sha256":"3decdf72227d5cc34a4042d6f4e5e47092442b5adc320e44ae7b03aba737050e"},"schema_version":"1.0","source":{"id":"1902.03988","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03988","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03988v2","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03988","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"pith_short_12","alias_value":"3QEL35L6JU7V","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3QEL35L6JU7VOLCJ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3QEL35L6","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:deda8c852b23ce2eefba31a8129c4f3a50dda48b93f0875dacdcbfeedc6a0cba","target":"graph","created_at":"2026-05-17T23:49:50Z","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":"In this paper, we propose a new method to reconstruct a signal corrupted by noise where both signal and noise are sparse but in different domains. The problem investigated in this paper arises in different applications such as impulsive noise removal from images, audios and videos, decomposition of low-rank and sparse components of matrices, and separation of texts from images. First, we provide a cost function for our problem and then present an iterative method to find its local minimum. The analysis of the algorithm is also provided. As an application of this problem, we apply our algorithm","authors_text":"Ehsan Asadi, Farokh Marvasti, Hamidreza Abin, Nematollah Zarmehi, Sahar Sadrizadeh","cross_cats":["cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-08T18:22:18Z","title":"A Fast Iterative Method for Removing Impulsive Noise from Sparse Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03988","kind":"arxiv","version":2},"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:2c8b008511eabf786136eb406265b134e1cdfe17dbb4a8a6839daa2ec2b4aa59","target":"record","created_at":"2026-05-17T23:49:50Z","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":"a197d685e063511d02156735bd8ba493b91793293c9ef8df9284e4f107c80afe","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-02-08T18:22:18Z","title_canon_sha256":"3decdf72227d5cc34a4042d6f4e5e47092442b5adc320e44ae7b03aba737050e"},"schema_version":"1.0","source":{"id":"1902.03988","kind":"arxiv","version":2}},"canonical_sha256":"dc08bdf57e4d3f572c4974eb4694650384bc1a01f3dd1128135320d38cf42536","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc08bdf57e4d3f572c4974eb4694650384bc1a01f3dd1128135320d38cf42536","first_computed_at":"2026-05-17T23:49:50.070680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:50.070680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6E66vUy3VIe5i+BMwATFfe5ESL3O0fkDfaJEePkmOM9lHD+7nMFBcaozJ0s0fqBfGAl5fLW3HPG8gaagZ42XBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:50.071189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03988","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c8b008511eabf786136eb406265b134e1cdfe17dbb4a8a6839daa2ec2b4aa59","sha256:deda8c852b23ce2eefba31a8129c4f3a50dda48b93f0875dacdcbfeedc6a0cba"],"state_sha256":"0939f7df36d911b1df19907231fc38171a8e9f64b280407223e47f90123f5fe9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STfXf14Gx30hPDHMemFIIuen/UZ7A2F453JYIZ9x6ZfyLtsnznyT0NSM+SfddDNoaKM5i6OJDUEBSPWK1AnCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:29:00.566534Z","bundle_sha256":"988ce534b0925ee93d92b6fce1e440c18bb763b3ab0d6b2678149544f54429e3"}}