{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7AKHUXRDGA34G7O2C6DLPDTXDL","short_pith_number":"pith:7AKHUXRD","schema_version":"1.0","canonical_sha256":"f8147a5e233037c37dda1786b78e771acd55107afbd7ff3ad9d0b008185d57d7","source":{"kind":"arxiv","id":"2201.07487","version":3},"attestation_state":"computed","paper":{"title":"A Concise Tutorial on Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongwen Yang, Qiuyun Zou","submitted_at":"2022-01-19T09:22:42Z","abstract_excerpt":"High-dimensional signal recovery of standard linear regression is a key challenge in many engineering fields, such as, communications, compressed sensing, and image processing. The approximate message passing (AMP) algorithm proposed by Donoho \\textit{et al} is a computational efficient method to such problems, which can attain Bayes-optimal performance in independent identical distributed (IID) sub-Gaussian random matrices region. A significant feature of AMP is that the dynamical behavior of AMP can be fully predicted by a scalar equation termed station evolution (SE). Although AMP is optima"},"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":"2201.07487","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-19T09:22:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"890fc1f1da1d5b95cee6f11398075b3d692d0a1269bea18d820049b795a1af4f","abstract_canon_sha256":"e553b371db101daaa74a80b22bae04daf2e9c60af046bbb03574694c31b11615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:01:08.968539Z","signature_b64":"Fd+kMQZWhOS2VszyE6ogaEJzNknfJ1cyAQzKpMs74VbEDUjzgKwi1G0soxf/mmFJKf1O6MNr7WxHOGbBW0b7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8147a5e233037c37dda1786b78e771acd55107afbd7ff3ad9d0b008185d57d7","last_reissued_at":"2026-07-05T04:01:08.968087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:01:08.968087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Concise Tutorial on Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongwen Yang, Qiuyun Zou","submitted_at":"2022-01-19T09:22:42Z","abstract_excerpt":"High-dimensional signal recovery of standard linear regression is a key challenge in many engineering fields, such as, communications, compressed sensing, and image processing. The approximate message passing (AMP) algorithm proposed by Donoho \\textit{et al} is a computational efficient method to such problems, which can attain Bayes-optimal performance in independent identical distributed (IID) sub-Gaussian random matrices region. A significant feature of AMP is that the dynamical behavior of AMP can be fully predicted by a scalar equation termed station evolution (SE). Although AMP is optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.07487","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.07487/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2201.07487","created_at":"2026-07-05T04:01:08.968143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.07487v3","created_at":"2026-07-05T04:01:08.968143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.07487","created_at":"2026-07-05T04:01:08.968143+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AKHUXRDGA34","created_at":"2026-07-05T04:01:08.968143+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AKHUXRDGA34G7O2","created_at":"2026-07-05T04:01:08.968143+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AKHUXRD","created_at":"2026-07-05T04:01:08.968143+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.03717","citing_title":"Regularized Approximate Message Passing for Overloaded Discrete Linear Inversion","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL","json":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL.json","graph_json":"https://pith.science/api/pith-number/7AKHUXRDGA34G7O2C6DLPDTXDL/graph.json","events_json":"https://pith.science/api/pith-number/7AKHUXRDGA34G7O2C6DLPDTXDL/events.json","paper":"https://pith.science/paper/7AKHUXRD"},"agent_actions":{"view_html":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL","download_json":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL.json","view_paper":"https://pith.science/paper/7AKHUXRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.07487&json=true","fetch_graph":"https://pith.science/api/pith-number/7AKHUXRDGA34G7O2C6DLPDTXDL/graph.json","fetch_events":"https://pith.science/api/pith-number/7AKHUXRDGA34G7O2C6DLPDTXDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL/action/storage_attestation","attest_author":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL/action/author_attestation","sign_citation":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL/action/citation_signature","submit_replication":"https://pith.science/pith/7AKHUXRDGA34G7O2C6DLPDTXDL/action/replication_record"}},"created_at":"2026-07-05T04:01:08.968143+00:00","updated_at":"2026-07-05T04:01:08.968143+00:00"}