{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MNHZGDFTIEKPTMO2DIXLP5AVQA","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":"4c8540dd0cfd773549ec251757c299047a1b87210ec1e256efe09d3c072b44bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-19T12:50:39Z","title_canon_sha256":"b80a21ce8d948c2ac13729b53867fcb72b88113b38e35d1efe841804db5502c2"},"schema_version":"1.0","source":{"id":"1610.05991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05991","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05991v1","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05991","created_at":"2026-05-18T01:01:50Z"},{"alias_kind":"pith_short_12","alias_value":"MNHZGDFTIEKP","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MNHZGDFTIEKPTMO2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MNHZGDFT","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:abdec5175451bf508cf804f76f14907a5cd6c81627acfeea4a2792bb3256fa4f","target":"graph","created_at":"2026-05-18T01:01: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":"Approximate message passing (AMP) is an efficient iterative signal recovery algorithm for compressed sensing (CS). For sensing matrices with independent and identically distributed (i.i.d.) Gaussian entries, the behavior of AMP can be asymptotically described by a scaler recursion called state evolution. Orthogonal AMP (OAMP) is a variant of AMP that imposes a divergence-free constraint on the denoiser. In this paper, we extend OAMP to incorporate generic denoisers, hence the name D-OAMP. Our numerical results show that state evolution predicts the performance of D-OAMP well for generic denois","authors_text":"Junjie Ma, Xiaojun Yuan, Zhipeng Xue","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-19T12:50:39Z","title":"D-OAMP: A Denoising-based Signal Recovery Algorithm for Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05991","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:73505b468d45a85b4368649bf22abd8f3591a3c49f1a9297e94661d5ca22d948","target":"record","created_at":"2026-05-18T01:01: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":"4c8540dd0cfd773549ec251757c299047a1b87210ec1e256efe09d3c072b44bd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-10-19T12:50:39Z","title_canon_sha256":"b80a21ce8d948c2ac13729b53867fcb72b88113b38e35d1efe841804db5502c2"},"schema_version":"1.0","source":{"id":"1610.05991","kind":"arxiv","version":1}},"canonical_sha256":"634f930cb34114f9b1da1a2eb7f415802c1098d824eb7a831916b6f9347ffda8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"634f930cb34114f9b1da1a2eb7f415802c1098d824eb7a831916b6f9347ffda8","first_computed_at":"2026-05-18T01:01:50.482547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:50.482547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gdQt7W9xFF7EarXEIoCFjWlJzWpG6eiNnr5X+M1L/ZzFb7biulMzSxI/68DFnk5Z1O4E81HAtHsul3g2o/vKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:50.483206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73505b468d45a85b4368649bf22abd8f3591a3c49f1a9297e94661d5ca22d948","sha256:abdec5175451bf508cf804f76f14907a5cd6c81627acfeea4a2792bb3256fa4f"],"state_sha256":"5f36e6900a765b8e272ad6aa5c7e8b9f8812db9733ca8ceb15723a863f3f7b7e"}