{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AN6U7WVSTSIPFVNMWDLM7GHUE2","short_pith_number":"pith:AN6U7WVS","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"},"canonical_sha256":"037d4fdab29c90f2d5acb0d6cf98f426b276b91a285f669fa1fb7a2e68950327","source":{"kind":"arxiv","id":"1610.00287","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00287","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00287v2","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00287","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"AN6U7WVSTSIP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AN6U7WVSTSIPFVNM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AN6U7WVS","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AN6U7WVSTSIPFVNMWDLM7GHUE2","target":"record","payload":{"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"},"canonical_sha256":"037d4fdab29c90f2d5acb0d6cf98f426b276b91a285f669fa1fb7a2e68950327","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"},"source_kind":"arxiv","source_id":"1610.00287","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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cmk6kUVPS6yPTsOiI+jct79AsbzTOWaohIY3bO32h3vJXk2LKAFq9h+EySxisyAxJbT1VWHmHs/m/bVUHk6EDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:37:37.743081Z"},"content_sha256":"edd8b1389a1a0afec2cb4e13947732b155e6179e61b125ef4263e8bc7e74eac3","schema_version":"1.0","event_id":"sha256:edd8b1389a1a0afec2cb4e13947732b155e6179e61b125ef4263e8bc7e74eac3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AN6U7WVSTSIPFVNMWDLM7GHUE2","target":"graph","payload":{"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"},"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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8lVvI2hZlD9IjMVJVk9v3xQ1tVfu2OqSmX5KOxu8/bIjxBNb1qKqlAxkngoUmpMc1jLxc+lLDjvXGLT27E2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:37:37.743447Z"},"content_sha256":"3eb38ab35d21d1fe6f837990079e2599291ad0461cf66df139cd5a3d0adce2f2","schema_version":"1.0","event_id":"sha256:3eb38ab35d21d1fe6f837990079e2599291ad0461cf66df139cd5a3d0adce2f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/bundle.json","state_url":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/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-05T17:37:37Z","links":{"resolver":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2","bundle":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/bundle.json","state":"https://pith.science/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN6U7WVSTSIPFVNMWDLM7GHUE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AN6U7WVSTSIPFVNMWDLM7GHUE2","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":"81f50a26386a68c681e514fe10b5200a8a874b0cb4c5213608cdb8070d6022d5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-02T15:10:51Z","title_canon_sha256":"5f74352507ad37716cb328c6ede4a6a74d64dec92fcc4d2b47edd0c5006f3e5e"},"schema_version":"1.0","source":{"id":"1610.00287","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00287","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00287v2","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00287","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"AN6U7WVSTSIP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AN6U7WVSTSIPFVNM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AN6U7WVS","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:3eb38ab35d21d1fe6f837990079e2599291ad0461cf66df139cd5a3d0adce2f2","target":"graph","created_at":"2026-05-18T01:00:05Z","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":"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","authors_text":"Ashkan Esmaeili, Ehsan Asadi, Farokh Marvasti","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-02T15:10:51Z","title":"Iterative Null-space Projection Method with Adaptive Thresholding in Sparse Signal Recovery and Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00287","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:edd8b1389a1a0afec2cb4e13947732b155e6179e61b125ef4263e8bc7e74eac3","target":"record","created_at":"2026-05-18T01:00:05Z","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":"81f50a26386a68c681e514fe10b5200a8a874b0cb4c5213608cdb8070d6022d5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-02T15:10:51Z","title_canon_sha256":"5f74352507ad37716cb328c6ede4a6a74d64dec92fcc4d2b47edd0c5006f3e5e"},"schema_version":"1.0","source":{"id":"1610.00287","kind":"arxiv","version":2}},"canonical_sha256":"037d4fdab29c90f2d5acb0d6cf98f426b276b91a285f669fa1fb7a2e68950327","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"037d4fdab29c90f2d5acb0d6cf98f426b276b91a285f669fa1fb7a2e68950327","first_computed_at":"2026-05-18T01:00:05.340814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:05.340814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w2YWQLGM2fgULDC3VHbw0QT9/ySqsElW6RX3uUu5TLmtQSM41/RHqWlXIzdRWw1t4AS6bn0LIV5+G7fCIS9wCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:05.341275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00287","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edd8b1389a1a0afec2cb4e13947732b155e6179e61b125ef4263e8bc7e74eac3","sha256:3eb38ab35d21d1fe6f837990079e2599291ad0461cf66df139cd5a3d0adce2f2"],"state_sha256":"d08a2e8718eb7070be1554a0e526f17440a71753146c33e96889de5451ba7376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4CX/ZqIzA/giADSNxuy7pkDy3U/DcU4+YChl/YBKoevF96+/eBXFHgREbAT17bHdo6Rc3LoQoKTVD6MuTKIAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:37:37.745423Z","bundle_sha256":"4f79adbd7f45300790e6a6ded69a8cb15c743c76f7fd32a2e2a31df16e4dbc95"}}