{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6MX2KFQYVPEQH5GLFOPHQQ5GA4","short_pith_number":"pith:6MX2KFQY","schema_version":"1.0","canonical_sha256":"f32fa51618abc903f4cb2b9e7843a6072ebd8759bfc3e62a3dbe6cd73ab54862","source":{"kind":"arxiv","id":"1606.01800","version":4},"attestation_state":"computed","paper":{"title":"Finite Sample Analysis of Approximate Message Passing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Cynthia Rush, Ramji Venkataramanan","submitted_at":"2016-06-06T15:59:14Z","abstract_excerpt":"Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the regime where the problem dimension is large but finite. For concreteness, we consider the setting of high-dimensional regression, where the goal is to estimate a high-dimensional vector $\\beta_0$ from a noisy measurement $y=A \\beta_0 + w$. AMP is a low-complexity, scalable algorithm for this problem. Under suitable assumptions on the measurement matrix $A$,"},"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":"1606.01800","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-06T15:59:14Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"aa301d98e18e66640990725ea62d9ac286fb5c00205655c383db7b5c6d1c1288","abstract_canon_sha256":"956cc814c873e3bbeae353bf09895c0549b38ba130b019d530aaf0080e5ce2e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.973850Z","signature_b64":"zjTdKgmLrUfy+R1HuwjdSQHx2hPAS6KmmFKH4nCrs/OwkjumpzizMAsGQHYAih1uwfQIlCxgev9BeDbFkQBTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f32fa51618abc903f4cb2b9e7843a6072ebd8759bfc3e62a3dbe6cd73ab54862","last_reissued_at":"2026-05-18T00:02:45.973510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.973510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite Sample Analysis of Approximate Message Passing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Cynthia Rush, Ramji Venkataramanan","submitted_at":"2016-06-06T15:59:14Z","abstract_excerpt":"Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the regime where the problem dimension is large but finite. For concreteness, we consider the setting of high-dimensional regression, where the goal is to estimate a high-dimensional vector $\\beta_0$ from a noisy measurement $y=A \\beta_0 + w$. AMP is a low-complexity, scalable algorithm for this problem. Under suitable assumptions on the measurement matrix $A$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01800","kind":"arxiv","version":4},"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":"1606.01800","created_at":"2026-05-18T00:02:45.973558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01800v4","created_at":"2026-05-18T00:02:45.973558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01800","created_at":"2026-05-18T00:02:45.973558+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MX2KFQYVPEQ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MX2KFQYVPEQH5GL","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MX2KFQY","created_at":"2026-05-18T12:30:01.593930+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/6MX2KFQYVPEQH5GLFOPHQQ5GA4","json":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4.json","graph_json":"https://pith.science/api/pith-number/6MX2KFQYVPEQH5GLFOPHQQ5GA4/graph.json","events_json":"https://pith.science/api/pith-number/6MX2KFQYVPEQH5GLFOPHQQ5GA4/events.json","paper":"https://pith.science/paper/6MX2KFQY"},"agent_actions":{"view_html":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4","download_json":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4.json","view_paper":"https://pith.science/paper/6MX2KFQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01800&json=true","fetch_graph":"https://pith.science/api/pith-number/6MX2KFQYVPEQH5GLFOPHQQ5GA4/graph.json","fetch_events":"https://pith.science/api/pith-number/6MX2KFQYVPEQH5GLFOPHQQ5GA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4/action/storage_attestation","attest_author":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4/action/author_attestation","sign_citation":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4/action/citation_signature","submit_replication":"https://pith.science/pith/6MX2KFQYVPEQH5GLFOPHQQ5GA4/action/replication_record"}},"created_at":"2026-05-18T00:02:45.973558+00:00","updated_at":"2026-05-18T00:02:45.973558+00:00"}