{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AN6U7WVSTSIPFVNMWDLM7GHUE2","short_pith_number":"pith:AN6U7WVS","schema_version":"1.0","canonical_sha256":"037d4fdab29c90f2d5acb0d6cf98f426b276b91a285f669fa1fb7a2e68950327","source":{"kind":"arxiv","id":"1610.00287","version":2},"attestation_state":"computed","paper":{"title":"Iterative Null-space Projection Method with Adaptive Thresholding in Sparse Signal Recovery and Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ME","authors_text":"Ashkan Esmaeili, Ehsan Asadi, Farokh Marvasti","submitted_at":"2016-10-02T15:10:51Z","abstract_excerpt":"Adaptive thresholding methods have proved to yield high SNRs and fast convergence in finding the solution to the Compressed Sensing (CS) problems. Recently, it was observed that the robustness of a class of iterative sparse recovery algorithms such as Iterative Method with Adaptive Thresholding (IMAT) has outperformed the well-known LASSO algorithm in terms of reconstruction quality, convergence speed, and the sensitivity to the noise. In this paper, we introduce a new method towards solving the CS problem. The logic of this method is based on iterative projections of the thresholded signal on"},"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":"1610.00287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-02T15:10:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"5f74352507ad37716cb328c6ede4a6a74d64dec92fcc4d2b47edd0c5006f3e5e","abstract_canon_sha256":"81f50a26386a68c681e514fe10b5200a8a874b0cb4c5213608cdb8070d6022d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:05.341275Z","signature_b64":"w2YWQLGM2fgULDC3VHbw0QT9/ySqsElW6RX3uUu5TLmtQSM41/RHqWlXIzdRWw1t4AS6bn0LIV5+G7fCIS9wCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037d4fdab29c90f2d5acb0d6cf98f426b276b91a285f669fa1fb7a2e68950327","last_reissued_at":"2026-05-18T01:00:05.340814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:05.340814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Null-space Projection Method with Adaptive Thresholding in Sparse Signal Recovery and Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ME","authors_text":"Ashkan Esmaeili, Ehsan Asadi, Farokh Marvasti","submitted_at":"2016-10-02T15:10:51Z","abstract_excerpt":"Adaptive thresholding methods have proved to yield high SNRs and fast convergence in finding the solution to the Compressed Sensing (CS) problems. Recently, it was observed that the robustness of a class of iterative sparse recovery algorithms such as Iterative Method with Adaptive Thresholding (IMAT) has outperformed the well-known LASSO algorithm in terms of reconstruction quality, convergence speed, and the sensitivity to the noise. In this paper, we introduce a new method towards solving the CS problem. The logic of this method is based on iterative projections of the thresholded signal on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00287","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.00287","created_at":"2026-05-18T01:00:05.340887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00287v2","created_at":"2026-05-18T01:00:05.340887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00287","created_at":"2026-05-18T01:00:05.340887+00:00"},{"alias_kind":"pith_short_12","alias_value":"AN6U7WVSTSIP","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AN6U7WVSTSIPFVNM","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AN6U7WVS","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08651","citing_title":"Privacy-Aware Video Anomaly Detection through Orthogonal Subspace Projection","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2","json":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2.json","graph_json":"https://pith.science/api/pith-number/AN6U7WVSTSIPFVNMWDLM7GHUE2/graph.json","events_json":"https://pith.science/api/pith-number/AN6U7WVSTSIPFVNMWDLM7GHUE2/events.json","paper":"https://pith.science/paper/AN6U7WVS"},"agent_actions":{"view_html":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2","download_json":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2.json","view_paper":"https://pith.science/paper/AN6U7WVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00287&json=true","fetch_graph":"https://pith.science/api/pith-number/AN6U7WVSTSIPFVNMWDLM7GHUE2/graph.json","fetch_events":"https://pith.science/api/pith-number/AN6U7WVSTSIPFVNMWDLM7GHUE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/action/storage_attestation","attest_author":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/action/author_attestation","sign_citation":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/action/citation_signature","submit_replication":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/action/replication_record"}},"created_at":"2026-05-18T01:00:05.340887+00:00","updated_at":"2026-05-18T01:00:05.340887+00:00"}