{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NSOVZPQCZQZJQBNDMFRIPOOQQ5","short_pith_number":"pith:NSOVZPQC","schema_version":"1.0","canonical_sha256":"6c9d5cbe02cc329805a3616287b9d087786db04132cb5d9c21f2adab7e2be87d","source":{"kind":"arxiv","id":"2109.11905","version":2},"attestation_state":"computed","paper":{"title":"Graph-based Approximate Message Passing Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"C\\'edric Gerbelot, Rapha\\\"el Berthier","submitted_at":"2021-09-24T11:56:59Z","abstract_excerpt":"Approximate-message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by the growing number of new iterations proposed for increasingly complex problems, ranging from multi-layer inference to low-rank matrix estimation with elaborate priors. In this paper, we address the following questions: is there a structure underlying all AMP iterations that unifies them in a common framework? Can we use such a structure to give a modula"},"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":"2109.11905","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-09-24T11:56:59Z","cross_cats_sorted":["math.IT","math.PR","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"5ce856e7f99f399a31ef0a0aa67ade05be47b3e503717cd616bec9b3c365da86","abstract_canon_sha256":"0ab60a60dbe6c6c839d781cfe27710691535164618e5623225849470bb187daf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:15:46.308557Z","signature_b64":"5VVxDLwWOGXLs/gO+XnmitPgzVYXKrWurfnbnMQeHf/wSj2Anh+9bNCqMuQNGnEAXy5gKgwsxP+KhBcXdFJIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c9d5cbe02cc329805a3616287b9d087786db04132cb5d9c21f2adab7e2be87d","last_reissued_at":"2026-07-05T04:15:46.307954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:15:46.307954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-based Approximate Message Passing Iterations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"C\\'edric Gerbelot, Rapha\\\"el Berthier","submitted_at":"2021-09-24T11:56:59Z","abstract_excerpt":"Approximate-message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by the growing number of new iterations proposed for increasingly complex problems, ranging from multi-layer inference to low-rank matrix estimation with elaborate priors. In this paper, we address the following questions: is there a structure underlying all AMP iterations that unifies them in a common framework? Can we use such a structure to give a modula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.11905","kind":"arxiv","version":2},"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/2109.11905/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":"2109.11905","created_at":"2026-07-05T04:15:46.308010+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.11905v2","created_at":"2026-07-05T04:15:46.308010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.11905","created_at":"2026-07-05T04:15:46.308010+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSOVZPQCZQZJ","created_at":"2026-07-05T04:15:46.308010+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSOVZPQCZQZJQBND","created_at":"2026-07-05T04:15:46.308010+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSOVZPQC","created_at":"2026-07-05T04:15:46.308010+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19894","citing_title":"Sharp Spectral Thresholds for Multi-View Spiked Wigner Models","ref_index":159,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15688","citing_title":"$\\alpha$-TCAV: A Unified Framework for Testing with Concept Activation Vectors","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5","json":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5.json","graph_json":"https://pith.science/api/pith-number/NSOVZPQCZQZJQBNDMFRIPOOQQ5/graph.json","events_json":"https://pith.science/api/pith-number/NSOVZPQCZQZJQBNDMFRIPOOQQ5/events.json","paper":"https://pith.science/paper/NSOVZPQC"},"agent_actions":{"view_html":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5","download_json":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5.json","view_paper":"https://pith.science/paper/NSOVZPQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.11905&json=true","fetch_graph":"https://pith.science/api/pith-number/NSOVZPQCZQZJQBNDMFRIPOOQQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/NSOVZPQCZQZJQBNDMFRIPOOQQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5/action/storage_attestation","attest_author":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5/action/author_attestation","sign_citation":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5/action/citation_signature","submit_replication":"https://pith.science/pith/NSOVZPQCZQZJQBNDMFRIPOOQQ5/action/replication_record"}},"created_at":"2026-07-05T04:15:46.308010+00:00","updated_at":"2026-07-05T04:15:46.308010+00:00"}