{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4BIX37NTLRDUD2ZVPQZG5W2DTE","short_pith_number":"pith:4BIX37NT","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"},"canonical_sha256":"e0517dfdb35c4741eb357c326edb43993565b3129b204b67fdeac5600d0520a8","source":{"kind":"arxiv","id":"1409.0440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0440","created_at":"2026-05-18T01:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0440v1","created_at":"2026-05-18T01:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0440","created_at":"2026-05-18T01:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"4BIX37NTLRDU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4BIX37NTLRDUD2ZV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4BIX37NT","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4BIX37NTLRDUD2ZVPQZG5W2DTE","target":"record","payload":{"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"},"canonical_sha256":"e0517dfdb35c4741eb357c326edb43993565b3129b204b67fdeac5600d0520a8","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"},"source_kind":"arxiv","source_id":"1409.0440","source_version":1,"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:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03Px+4A8q85gugNMVAyVjguRqqe7Lcq9uNnyqAqGu8fbiQ8JK68tsF3/JjfhXUlctq4DyxRLLmDwFu2alde+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:43:38.012072Z"},"content_sha256":"b6d26855e4186678332408909f685040eedd56ad9c85d0741775c90799be23b7","schema_version":"1.0","event_id":"sha256:b6d26855e4186678332408909f685040eedd56ad9c85d0741775c90799be23b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4BIX37NTLRDUD2ZVPQZG5W2DTE","target":"graph","payload":{"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"},"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:42:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+2scbMTAG8mi4uoPLS1+I/QnnlxnvrwrTeEipkHKC+xUCXpo+naW2/wQNejoR3LD3wmzKp42b8a3ixj7i0YAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:43:38.012466Z"},"content_sha256":"a08ca8ab14c91c46489e0cf420d04dc6c196fffe5e37d0227a7df6a6ffe04c95","schema_version":"1.0","event_id":"sha256:a08ca8ab14c91c46489e0cf420d04dc6c196fffe5e37d0227a7df6a6ffe04c95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/bundle.json","state_url":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/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-05-28T02:43:38Z","links":{"resolver":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE","bundle":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/bundle.json","state":"https://pith.science/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BIX37NTLRDUD2ZVPQZG5W2DTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4BIX37NTLRDUD2ZVPQZG5W2DTE","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":"db6222955a181d15370f669a860f50f119fd29a70f18b793195533f382075c36","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T17:16:38Z","title_canon_sha256":"e0e417905bd24a147ee43fdf55e77fae3a50c1e7a98b6ba1022ff8cd2f5dbd7e"},"schema_version":"1.0","source":{"id":"1409.0440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0440","created_at":"2026-05-18T01:42:11Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0440v1","created_at":"2026-05-18T01:42:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0440","created_at":"2026-05-18T01:42:11Z"},{"alias_kind":"pith_short_12","alias_value":"4BIX37NTLRDU","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4BIX37NTLRDUD2ZV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4BIX37NT","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:a08ca8ab14c91c46489e0cf420d04dc6c196fffe5e37d0227a7df6a6ffe04c95","target":"graph","created_at":"2026-05-18T01:42:11Z","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":"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","authors_text":"Chunli Guo, Mike E. Davies","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T17:16:38Z","title":"Near optimal compressed sensing without priors: Parametric SURE Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0440","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:b6d26855e4186678332408909f685040eedd56ad9c85d0741775c90799be23b7","target":"record","created_at":"2026-05-18T01:42:11Z","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":"db6222955a181d15370f669a860f50f119fd29a70f18b793195533f382075c36","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2014-08-12T17:16:38Z","title_canon_sha256":"e0e417905bd24a147ee43fdf55e77fae3a50c1e7a98b6ba1022ff8cd2f5dbd7e"},"schema_version":"1.0","source":{"id":"1409.0440","kind":"arxiv","version":1}},"canonical_sha256":"e0517dfdb35c4741eb357c326edb43993565b3129b204b67fdeac5600d0520a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0517dfdb35c4741eb357c326edb43993565b3129b204b67fdeac5600d0520a8","first_computed_at":"2026-05-18T01:42:11.217047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:11.217047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4PNvFizI3RlZd0AK1kF56yusXWrk6EEqdeiiSWYNhAtGwQmxziVsP+vG7mTvxQDbKAoE4yKzruvv5Xy3UP50DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:11.217573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6d26855e4186678332408909f685040eedd56ad9c85d0741775c90799be23b7","sha256:a08ca8ab14c91c46489e0cf420d04dc6c196fffe5e37d0227a7df6a6ffe04c95"],"state_sha256":"beec2ba6524b74aa5a348e74701f013d4ef97d35d81744e5e54079c978bc2490"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NrbUtkaxbCx7fXBeczARCmdFRUP/2Oua75n9iu/QtuDIZMtJbLLvKsRY346hqaixaVZIHO5wTjGL3xXU3HZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:43:38.014496Z","bundle_sha256":"625ca45be7aa9372d304f517f01bb756a5460e287c95ddc0d5356c8b4ab4bff0"}}