{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ASGWLKNYBS32EDVVL4OIIUJ3L4","short_pith_number":"pith:ASGWLKNY","schema_version":"1.0","canonical_sha256":"048d65a9b80cb7a20eb55f1c84513b5f0d6b5f8580f0dfd0dc949d0022d45b40","source":{"kind":"arxiv","id":"1706.09395","version":1},"attestation_state":"computed","paper":{"title":"Recovery of Missing Samples Using Sparse Approximation via a Convex Similarity Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amirhossein Javaheri, Farokh Marvasti, Hadi Zayyani","submitted_at":"2017-06-28T17:59:33Z","abstract_excerpt":"In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of image signal. This problem is also known as inpainting in the context of image processing and for this purpose, we suggest an iterative sparse recovery algorithm based on constrained $l_1$-norm minimization with a new fidelity metric. The proposed metric called Convex SIMilarity (CSIM) index, is a simplified version of the Structural SIMilarity (SSIM) index"},"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":"1706.09395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-28T17:59:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5852f76a9177382eb84cd16922d746a4e8b6bd2ad48c7fdff1a4ab86e9f889f5","abstract_canon_sha256":"0f3ade1429bc2b9eaef9edb3134b95933872b0516777eb0f3a830336410443fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:18.768220Z","signature_b64":"CXvhsmdmqricd9KLQfw4+vSt/b180FyWG6vWrUZds+Gh8ccJvpu/S950w4Tjgvzg200DB0lN0HMWYs2SObc7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"048d65a9b80cb7a20eb55f1c84513b5f0d6b5f8580f0dfd0dc949d0022d45b40","last_reissued_at":"2026-05-18T00:41:18.767391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:18.767391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovery of Missing Samples Using Sparse Approximation via a Convex Similarity Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amirhossein Javaheri, Farokh Marvasti, Hadi Zayyani","submitted_at":"2017-06-28T17:59:33Z","abstract_excerpt":"In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of image signal. This problem is also known as inpainting in the context of image processing and for this purpose, we suggest an iterative sparse recovery algorithm based on constrained $l_1$-norm minimization with a new fidelity metric. The proposed metric called Convex SIMilarity (CSIM) index, is a simplified version of the Structural SIMilarity (SSIM) index"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09395","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":"1706.09395","created_at":"2026-05-18T00:41:18.767535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09395v1","created_at":"2026-05-18T00:41:18.767535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09395","created_at":"2026-05-18T00:41:18.767535+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASGWLKNYBS32","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASGWLKNYBS32EDVV","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASGWLKNY","created_at":"2026-05-18T12:31:08.081275+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/ASGWLKNYBS32EDVVL4OIIUJ3L4","json":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4.json","graph_json":"https://pith.science/api/pith-number/ASGWLKNYBS32EDVVL4OIIUJ3L4/graph.json","events_json":"https://pith.science/api/pith-number/ASGWLKNYBS32EDVVL4OIIUJ3L4/events.json","paper":"https://pith.science/paper/ASGWLKNY"},"agent_actions":{"view_html":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4","download_json":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4.json","view_paper":"https://pith.science/paper/ASGWLKNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09395&json=true","fetch_graph":"https://pith.science/api/pith-number/ASGWLKNYBS32EDVVL4OIIUJ3L4/graph.json","fetch_events":"https://pith.science/api/pith-number/ASGWLKNYBS32EDVVL4OIIUJ3L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4/action/storage_attestation","attest_author":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4/action/author_attestation","sign_citation":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4/action/citation_signature","submit_replication":"https://pith.science/pith/ASGWLKNYBS32EDVVL4OIIUJ3L4/action/replication_record"}},"created_at":"2026-05-18T00:41:18.767535+00:00","updated_at":"2026-05-18T00:41:18.767535+00:00"}