{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LGCXYRA2N2C2EW4FZQYPJ4OQZQ","short_pith_number":"pith:LGCXYRA2","canonical_record":{"source":{"id":"1010.5141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-25T14:24:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c613b1c5cbc77098c209f4f097df6c0ae8e9b243a0c6d648c76bcb6e6998d30","abstract_canon_sha256":"bf3f2fd2d314742406b503e03ae32413a57882082835e93b199f5b200732ae3f"},"schema_version":"1.0"},"canonical_sha256":"59857c441a6e85a25b85cc30f4f1d0cc2f3f22b3a70d6e16c33c559c0e7e9920","source":{"kind":"arxiv","id":"1010.5141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5141","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5141v2","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5141","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"LGCXYRA2N2C2","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LGCXYRA2N2C2EW4F","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LGCXYRA2","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LGCXYRA2N2C2EW4FZQYPJ4OQZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-25T14:24:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1c613b1c5cbc77098c209f4f097df6c0ae8e9b243a0c6d648c76bcb6e6998d30","abstract_canon_sha256":"bf3f2fd2d314742406b503e03ae32413a57882082835e93b199f5b200732ae3f"},"schema_version":"1.0"},"canonical_sha256":"59857c441a6e85a25b85cc30f4f1d0cc2f3f22b3a70d6e16c33c559c0e7e9920","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:48.299479Z","signature_b64":"/R2uSTKK+Ke1zcra44GE5E783Z1OjgIIrBzr72POeO7ZNo9DISLKkYrg564uYRL4LtnyBbzyX1t+qiCE+LV4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59857c441a6e85a25b85cc30f4f1d0cc2f3f22b3a70d6e16c33c559c0e7e9920","last_reissued_at":"2026-05-18T03:48:48.298992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:48.298992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5141","source_version":2,"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-18T03:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2xTeLcP4lPbGoE1JWLbgqkM4bBq30lbFYWFhP1RN90NKJryhJSUWmje+TSwLxQsN8PwfYIRxiD8EmHm5tJSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:05:57.076090Z"},"content_sha256":"89dead55778948233a80e26ad983a54a7e72daab8feab9ca972286b669df503e","schema_version":"1.0","event_id":"sha256:89dead55778948233a80e26ad983a54a7e72daab8feab9ca972286b669df503e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LGCXYRA2N2C2EW4FZQYPJ4OQZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Approximate Message Passing for Estimation with Random Linear Mixing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sundeep Rangan","submitted_at":"2010-10-25T14:24:48Z","abstract_excerpt":"We consider the estimation of an i.i.d.\\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel. A novel algorithm, called generalized approximate message passing (GAMP), is presented that provides computationally efficient approximate implementations of max-sum and sum-problem loopy belief propagation for such problems. The algorithm extends earlier approximate message passing methods to incorporate arbitrary distributions on both the input and output of the transform and can be applied to a wide range of problems "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5141","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":""},"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-18T03:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXcZDA5TwSRKGByEqPP56JyR7UhZS6thWJoh+XswO7uVDDiXuG4DE4Cwk2Zu4UCKyfPTLuFCeUbUpik34rRAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:05:57.076876Z"},"content_sha256":"81d7188750712f68880095065b4d9becf6e5e87c98a8f6f383d6f3d820ec4c31","schema_version":"1.0","event_id":"sha256:81d7188750712f68880095065b4d9becf6e5e87c98a8f6f383d6f3d820ec4c31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGCXYRA2N2C2EW4FZQYPJ4OQZQ/bundle.json","state_url":"https://pith.science/pith/LGCXYRA2N2C2EW4FZQYPJ4OQZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGCXYRA2N2C2EW4FZQYPJ4OQZQ/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-22T19:05:57Z","links":{"resolver":"https://pith.science/pith/LGCXYRA2N2C2EW4FZQYPJ4OQZQ","bundle":"https://pith.science/pith/LGCXYRA2N2C2EW4FZQYPJ4OQZQ/bundle.json","state":"https://pith.science/pith/LGCXYRA2N2C2EW4FZQYPJ4OQZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGCXYRA2N2C2EW4FZQYPJ4OQZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LGCXYRA2N2C2EW4FZQYPJ4OQZQ","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":"bf3f2fd2d314742406b503e03ae32413a57882082835e93b199f5b200732ae3f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-25T14:24:48Z","title_canon_sha256":"1c613b1c5cbc77098c209f4f097df6c0ae8e9b243a0c6d648c76bcb6e6998d30"},"schema_version":"1.0","source":{"id":"1010.5141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5141","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5141v2","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5141","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"LGCXYRA2N2C2","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LGCXYRA2N2C2EW4F","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LGCXYRA2","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:81d7188750712f68880095065b4d9becf6e5e87c98a8f6f383d6f3d820ec4c31","target":"graph","created_at":"2026-05-18T03:48:48Z","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":"We consider the estimation of an i.i.d.\\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel. A novel algorithm, called generalized approximate message passing (GAMP), is presented that provides computationally efficient approximate implementations of max-sum and sum-problem loopy belief propagation for such problems. The algorithm extends earlier approximate message passing methods to incorporate arbitrary distributions on both the input and output of the transform and can be applied to a wide range of problems ","authors_text":"Sundeep Rangan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-25T14:24:48Z","title":"Generalized Approximate Message Passing for Estimation with Random Linear Mixing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5141","kind":"arxiv","version":2},"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:89dead55778948233a80e26ad983a54a7e72daab8feab9ca972286b669df503e","target":"record","created_at":"2026-05-18T03:48:48Z","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":"bf3f2fd2d314742406b503e03ae32413a57882082835e93b199f5b200732ae3f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-25T14:24:48Z","title_canon_sha256":"1c613b1c5cbc77098c209f4f097df6c0ae8e9b243a0c6d648c76bcb6e6998d30"},"schema_version":"1.0","source":{"id":"1010.5141","kind":"arxiv","version":2}},"canonical_sha256":"59857c441a6e85a25b85cc30f4f1d0cc2f3f22b3a70d6e16c33c559c0e7e9920","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59857c441a6e85a25b85cc30f4f1d0cc2f3f22b3a70d6e16c33c559c0e7e9920","first_computed_at":"2026-05-18T03:48:48.298992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:48.298992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/R2uSTKK+Ke1zcra44GE5E783Z1OjgIIrBzr72POeO7ZNo9DISLKkYrg564uYRL4LtnyBbzyX1t+qiCE+LV4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:48.299479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89dead55778948233a80e26ad983a54a7e72daab8feab9ca972286b669df503e","sha256:81d7188750712f68880095065b4d9becf6e5e87c98a8f6f383d6f3d820ec4c31"],"state_sha256":"42b7ce2b026d44063253c2e82eb678dd842e1e0b11ce55e2d98d57bb4f8fb860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3b37BPmWI921VdiibSJuARLeIZUbrYkxVyhFeCLtXHYtCSeNecw/FXolxU3HPVdTzZxGHkce+KD6QjfowwGICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T19:05:57.081644Z","bundle_sha256":"874a35eb743c4ba102ac97632b139742c1fd1d5aa299d8bb6f88ad5c3089fe5d"}}