{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4BIX37NTLRDUD2ZVPQZG5W2DTE","short_pith_number":"pith:4BIX37NT","schema_version":"1.0","canonical_sha256":"e0517dfdb35c4741eb357c326edb43993565b3129b204b67fdeac5600d0520a8","source":{"kind":"arxiv","id":"1409.0440","version":1},"attestation_state":"computed","paper":{"title":"Near optimal compressed sensing without priors: Parametric SURE Approximate Message Passing","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunli Guo, Mike E. Davies","submitted_at":"2014-08-12T17:16:38Z","abstract_excerpt":"Both theoretical analysis and empirical evidence confirm that the approximate message passing (AMP) algorithm can be interpreted as recursively solving a signal denoising problem: at each AMP iteration, one observes a Gaussian noise perturbed original signal. Retrieving the signal amounts to a successive noise cancellation until the noise variance decreases to a satisfactory level. In this paper we incorporate the Stein's unbiased risk estimate (SURE) based parametric denoiser with the AMP framework and propose the novel parametric SURE-AMP algorithm. At each parametric SURE-AMP iteration, the"},"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":"1409.0440","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T17:16:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e0e417905bd24a147ee43fdf55e77fae3a50c1e7a98b6ba1022ff8cd2f5dbd7e","abstract_canon_sha256":"db6222955a181d15370f669a860f50f119fd29a70f18b793195533f382075c36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:11.217573Z","signature_b64":"4PNvFizI3RlZd0AK1kF56yusXWrk6EEqdeiiSWYNhAtGwQmxziVsP+vG7mTvxQDbKAoE4yKzruvv5Xy3UP50DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0517dfdb35c4741eb357c326edb43993565b3129b204b67fdeac5600d0520a8","last_reissued_at":"2026-05-18T01:42:11.217047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:11.217047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near optimal compressed sensing without priors: Parametric SURE Approximate Message Passing","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chunli Guo, Mike E. Davies","submitted_at":"2014-08-12T17:16:38Z","abstract_excerpt":"Both theoretical analysis and empirical evidence confirm that the approximate message passing (AMP) algorithm can be interpreted as recursively solving a signal denoising problem: at each AMP iteration, one observes a Gaussian noise perturbed original signal. Retrieving the signal amounts to a successive noise cancellation until the noise variance decreases to a satisfactory level. In this paper we incorporate the Stein's unbiased risk estimate (SURE) based parametric denoiser with the AMP framework and propose the novel parametric SURE-AMP algorithm. At each parametric SURE-AMP iteration, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0440","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":"1409.0440","created_at":"2026-05-18T01:42:11.217124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0440v1","created_at":"2026-05-18T01:42:11.217124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0440","created_at":"2026-05-18T01:42:11.217124+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BIX37NTLRDU","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BIX37NTLRDUD2ZV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BIX37NT","created_at":"2026-05-18T12:28:14.216126+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/4BIX37NTLRDUD2ZVPQZG5W2DTE","json":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE.json","graph_json":"https://pith.science/api/pith-number/4BIX37NTLRDUD2ZVPQZG5W2DTE/graph.json","events_json":"https://pith.science/api/pith-number/4BIX37NTLRDUD2ZVPQZG5W2DTE/events.json","paper":"https://pith.science/paper/4BIX37NT"},"agent_actions":{"view_html":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE","download_json":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE.json","view_paper":"https://pith.science/paper/4BIX37NT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0440&json=true","fetch_graph":"https://pith.science/api/pith-number/4BIX37NTLRDUD2ZVPQZG5W2DTE/graph.json","fetch_events":"https://pith.science/api/pith-number/4BIX37NTLRDUD2ZVPQZG5W2DTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/action/storage_attestation","attest_author":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/action/author_attestation","sign_citation":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/action/citation_signature","submit_replication":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/action/replication_record"}},"created_at":"2026-05-18T01:42:11.217124+00:00","updated_at":"2026-05-18T01:42:11.217124+00:00"}