{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4WMUM7V2LJMVKINSGMGVHSFM7L","short_pith_number":"pith:4WMUM7V2","canonical_record":{"source":{"id":"1708.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-13T18:38:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11c5fe25a0bbb0c0f329a4823ddd326d22e949cf193931af502e00ca0a815625","abstract_canon_sha256":"a227eb2d4301ce9f76f7b36ae8ec5bb43e60e4182a85de39cb1a26bb4700a7c3"},"schema_version":"1.0"},"canonical_sha256":"e599467eba5a595521b2330d53c8acfae227dd209504cb230bd6b6dcf57b8691","source":{"kind":"arxiv","id":"1708.03950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03950","created_at":"2026-05-18T00:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03950v1","created_at":"2026-05-18T00:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03950","created_at":"2026-05-18T00:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"4WMUM7V2LJMV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WMUM7V2LJMVKINS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WMUM7V2","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4WMUM7V2LJMVKINSGMGVHSFM7L","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-13T18:38:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"11c5fe25a0bbb0c0f329a4823ddd326d22e949cf193931af502e00ca0a815625","abstract_canon_sha256":"a227eb2d4301ce9f76f7b36ae8ec5bb43e60e4182a85de39cb1a26bb4700a7c3"},"schema_version":"1.0"},"canonical_sha256":"e599467eba5a595521b2330d53c8acfae227dd209504cb230bd6b6dcf57b8691","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:07.443083Z","signature_b64":"Te/VBwFnkAtLqFNKCQ65fFpR0eL0Tru1XSkuj9yfaSSx7DyJwnlACdGAUqNzHlUY/eNa6BmZtT+mu2WD5VkFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e599467eba5a595521b2330d53c8acfae227dd209504cb230bd6b6dcf57b8691","last_reissued_at":"2026-05-18T00:38:07.442674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:07.442674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03950","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-18T00:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNOtpk4RdFHb6QoMiTUvfUXFc9A1IUHKf4N6ut3i0GlgZKaqZT/hFZfZe2WnU+9HMZ1Ycw456dzomKDJNes1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:48.563258Z"},"content_sha256":"e2e18b8cdd6dae3c2349787873b8eed9fa5f6dc1b52ab515d9c1f67cc040b113","schema_version":"1.0","event_id":"sha256:e2e18b8cdd6dae3c2349787873b8eed9fa5f6dc1b52ab515d9c1f67cc040b113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4WMUM7V2LJMVKINSGMGVHSFM7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"State Evolution for Approximate Message Passing with Non-Separable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Montanari, Phan-Minh Nguyen, Raphael Berthier","submitted_at":"2017-08-13T18:38:10Z","abstract_excerpt":"Given a high-dimensional data matrix ${\\boldsymbol A}\\in{\\mathbb R}^{m\\times n}$, Approximate Message Passing (AMP) algorithms construct sequences of vectors ${\\boldsymbol u}^t\\in{\\mathbb R}^n$, ${\\boldsymbol v}^t\\in{\\mathbb R}^m$, indexed by $t\\in\\{0,1,2\\dots\\}$ by iteratively applying ${\\boldsymbol A}$ or ${\\boldsymbol A}^{{\\sf T}}$, and suitable non-linear functions, which depend on the specific application. Special instances of this approach have been developed --among other applications-- for compressed sensing reconstruction, robust regression, Bayesian estimation, low-rank matrix recove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03950","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-18T00:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21d4lh+svAuusEloLiFKDG52SNlXGfrDTvZbFPzXGzc/mRkxLrZ+qUrXA64c/h4lmy/HLndWRyEw1VvPHn1PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:48.563958Z"},"content_sha256":"4191a103ef99fe117e53f1012fc9d072e86f8fc9679f545e02cfa0e5c86318b5","schema_version":"1.0","event_id":"sha256:4191a103ef99fe117e53f1012fc9d072e86f8fc9679f545e02cfa0e5c86318b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4WMUM7V2LJMVKINSGMGVHSFM7L/bundle.json","state_url":"https://pith.science/pith/4WMUM7V2LJMVKINSGMGVHSFM7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4WMUM7V2LJMVKINSGMGVHSFM7L/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-25T17:40:48Z","links":{"resolver":"https://pith.science/pith/4WMUM7V2LJMVKINSGMGVHSFM7L","bundle":"https://pith.science/pith/4WMUM7V2LJMVKINSGMGVHSFM7L/bundle.json","state":"https://pith.science/pith/4WMUM7V2LJMVKINSGMGVHSFM7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4WMUM7V2LJMVKINSGMGVHSFM7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4WMUM7V2LJMVKINSGMGVHSFM7L","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":"a227eb2d4301ce9f76f7b36ae8ec5bb43e60e4182a85de39cb1a26bb4700a7c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-13T18:38:10Z","title_canon_sha256":"11c5fe25a0bbb0c0f329a4823ddd326d22e949cf193931af502e00ca0a815625"},"schema_version":"1.0","source":{"id":"1708.03950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03950","created_at":"2026-05-18T00:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03950v1","created_at":"2026-05-18T00:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03950","created_at":"2026-05-18T00:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"4WMUM7V2LJMV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4WMUM7V2LJMVKINS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4WMUM7V2","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:4191a103ef99fe117e53f1012fc9d072e86f8fc9679f545e02cfa0e5c86318b5","target":"graph","created_at":"2026-05-18T00:38:07Z","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":"Given a high-dimensional data matrix ${\\boldsymbol A}\\in{\\mathbb R}^{m\\times n}$, Approximate Message Passing (AMP) algorithms construct sequences of vectors ${\\boldsymbol u}^t\\in{\\mathbb R}^n$, ${\\boldsymbol v}^t\\in{\\mathbb R}^m$, indexed by $t\\in\\{0,1,2\\dots\\}$ by iteratively applying ${\\boldsymbol A}$ or ${\\boldsymbol A}^{{\\sf T}}$, and suitable non-linear functions, which depend on the specific application. Special instances of this approach have been developed --among other applications-- for compressed sensing reconstruction, robust regression, Bayesian estimation, low-rank matrix recove","authors_text":"Andrea Montanari, Phan-Minh Nguyen, Raphael Berthier","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-13T18:38:10Z","title":"State Evolution for Approximate Message Passing with Non-Separable Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03950","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:e2e18b8cdd6dae3c2349787873b8eed9fa5f6dc1b52ab515d9c1f67cc040b113","target":"record","created_at":"2026-05-18T00:38:07Z","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":"a227eb2d4301ce9f76f7b36ae8ec5bb43e60e4182a85de39cb1a26bb4700a7c3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-13T18:38:10Z","title_canon_sha256":"11c5fe25a0bbb0c0f329a4823ddd326d22e949cf193931af502e00ca0a815625"},"schema_version":"1.0","source":{"id":"1708.03950","kind":"arxiv","version":1}},"canonical_sha256":"e599467eba5a595521b2330d53c8acfae227dd209504cb230bd6b6dcf57b8691","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e599467eba5a595521b2330d53c8acfae227dd209504cb230bd6b6dcf57b8691","first_computed_at":"2026-05-18T00:38:07.442674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:07.442674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Te/VBwFnkAtLqFNKCQ65fFpR0eL0Tru1XSkuj9yfaSSx7DyJwnlACdGAUqNzHlUY/eNa6BmZtT+mu2WD5VkFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:07.443083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2e18b8cdd6dae3c2349787873b8eed9fa5f6dc1b52ab515d9c1f67cc040b113","sha256:4191a103ef99fe117e53f1012fc9d072e86f8fc9679f545e02cfa0e5c86318b5"],"state_sha256":"baf93aca6cc96f547fb3d8abacc0a04ff9d710aebb429653d3d1845279c97aff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kd22LMta7UvDjaghOjZrnr1Lt5O0MezDxjjTBJqU/fGr7KUOcC6MoorR5bHsMZM0ODgKxFPAJ30nrwBD+nnGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:40:48.567601Z","bundle_sha256":"90f7c0ea09511b75d90e120b0265ba4c3dbfb38fea56f882f47d77c83b9516bc"}}