{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:22XVDULNRTBSOR2UYS7R7IGRQL","short_pith_number":"pith:22XVDULN","canonical_record":{"source":{"id":"1604.02752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-10T22:28:10Z","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"title_canon_sha256":"9104ecc77cd938b7fdac978cb935f691e8e7b5bcbba5bff8c3d55636926923a0","abstract_canon_sha256":"d28bb3cb65288f0a1d336702a3f93ca1d04ea5f2e8aac58f3053fcc240bb343d"},"schema_version":"1.0"},"canonical_sha256":"d6af51d16d8cc3274754c4bf1fa0d182f3e48dd3727b0f8a77cd27b93116df3f","source":{"kind":"arxiv","id":"1604.02752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02752","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02752v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02752","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"22XVDULNRTBS","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"22XVDULNRTBSOR2U","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"22XVDULN","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:22XVDULNRTBSOR2UYS7R7IGRQL","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-10T22:28:10Z","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"title_canon_sha256":"9104ecc77cd938b7fdac978cb935f691e8e7b5bcbba5bff8c3d55636926923a0","abstract_canon_sha256":"d28bb3cb65288f0a1d336702a3f93ca1d04ea5f2e8aac58f3053fcc240bb343d"},"schema_version":"1.0"},"canonical_sha256":"d6af51d16d8cc3274754c4bf1fa0d182f3e48dd3727b0f8a77cd27b93116df3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:33.726146Z","signature_b64":"tMj7DowiD+pwAj4btpzlcRRnvo2MkPQx/fJ0gjnX06XglNP2AlmOoSjMloLhyJ1bG3EFwag2b9PDacliHgtmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6af51d16d8cc3274754c4bf1fa0d182f3e48dd3727b0f8a77cd27b93116df3f","last_reissued_at":"2026-05-18T00:58:33.725422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:33.725422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02752","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:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NscoJkytGC9cXcN31qEktvk15smLYQlZXJO8Z0Kw/SMs+vble1h0ATCv7gD1j35lmghtvOFO353NmaPhznrMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:58:37.216285Z"},"content_sha256":"318a3f3d14414b0a35192c466efca9060348247002ad4ad00e8f8052f5289038","schema_version":"1.0","event_id":"sha256:318a3f3d14414b0a35192c466efca9060348247002ad4ad00e8f8052f5289038"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:22XVDULNRTBSOR2UYS7R7IGRQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Performance Trade-Offs in Multi-Processor Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Dror Baron, Junan Zhu","submitted_at":"2016-04-10T22:28:10Z","abstract_excerpt":"We consider large-scale linear inverse problems in Bayesian settings. Our general approach follows a recent line of work that applies the approximate message passing (AMP) framework in multi-processor (MP) computational systems by storing and processing a subset of rows of the measurement matrix along with corresponding measurements at each MP node. In each MP-AMP iteration, nodes of the MP system and its fusion center exchange lossily compressed messages pertaining to their estimates of the input. There is a trade-off between the physical costs of the reconstruction process including computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02752","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:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVaivV/YFw6WIFurbSDa2t5yKmcGZhL/SxAmoCedoZm1aNRllyeTJBLYj9JzAAQ78CeJrtPev2o7czJOg6CRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:58:37.216660Z"},"content_sha256":"3e1dd3caaf69861ade187f280aade1dc1bbf640195d9dac5804c26bf486d1c1a","schema_version":"1.0","event_id":"sha256:3e1dd3caaf69861ade187f280aade1dc1bbf640195d9dac5804c26bf486d1c1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22XVDULNRTBSOR2UYS7R7IGRQL/bundle.json","state_url":"https://pith.science/pith/22XVDULNRTBSOR2UYS7R7IGRQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22XVDULNRTBSOR2UYS7R7IGRQL/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-06-20T03:58:37Z","links":{"resolver":"https://pith.science/pith/22XVDULNRTBSOR2UYS7R7IGRQL","bundle":"https://pith.science/pith/22XVDULNRTBSOR2UYS7R7IGRQL/bundle.json","state":"https://pith.science/pith/22XVDULNRTBSOR2UYS7R7IGRQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22XVDULNRTBSOR2UYS7R7IGRQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:22XVDULNRTBSOR2UYS7R7IGRQL","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":"d28bb3cb65288f0a1d336702a3f93ca1d04ea5f2e8aac58f3053fcc240bb343d","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-10T22:28:10Z","title_canon_sha256":"9104ecc77cd938b7fdac978cb935f691e8e7b5bcbba5bff8c3d55636926923a0"},"schema_version":"1.0","source":{"id":"1604.02752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02752","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02752v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02752","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"22XVDULNRTBS","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"22XVDULNRTBSOR2U","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"22XVDULN","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:3e1dd3caaf69861ade187f280aade1dc1bbf640195d9dac5804c26bf486d1c1a","target":"graph","created_at":"2026-05-18T00:58:33Z","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 large-scale linear inverse problems in Bayesian settings. Our general approach follows a recent line of work that applies the approximate message passing (AMP) framework in multi-processor (MP) computational systems by storing and processing a subset of rows of the measurement matrix along with corresponding measurements at each MP node. In each MP-AMP iteration, nodes of the MP system and its fusion center exchange lossily compressed messages pertaining to their estimates of the input. There is a trade-off between the physical costs of the reconstruction process including computat","authors_text":"Ahmad Beirami, Dror Baron, Junan Zhu","cross_cats":["cs.DC","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-10T22:28:10Z","title":"Performance Trade-Offs in Multi-Processor Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02752","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:318a3f3d14414b0a35192c466efca9060348247002ad4ad00e8f8052f5289038","target":"record","created_at":"2026-05-18T00:58:33Z","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":"d28bb3cb65288f0a1d336702a3f93ca1d04ea5f2e8aac58f3053fcc240bb343d","cross_cats_sorted":["cs.DC","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-10T22:28:10Z","title_canon_sha256":"9104ecc77cd938b7fdac978cb935f691e8e7b5bcbba5bff8c3d55636926923a0"},"schema_version":"1.0","source":{"id":"1604.02752","kind":"arxiv","version":1}},"canonical_sha256":"d6af51d16d8cc3274754c4bf1fa0d182f3e48dd3727b0f8a77cd27b93116df3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6af51d16d8cc3274754c4bf1fa0d182f3e48dd3727b0f8a77cd27b93116df3f","first_computed_at":"2026-05-18T00:58:33.725422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:33.725422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tMj7DowiD+pwAj4btpzlcRRnvo2MkPQx/fJ0gjnX06XglNP2AlmOoSjMloLhyJ1bG3EFwag2b9PDacliHgtmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:33.726146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:318a3f3d14414b0a35192c466efca9060348247002ad4ad00e8f8052f5289038","sha256:3e1dd3caaf69861ade187f280aade1dc1bbf640195d9dac5804c26bf486d1c1a"],"state_sha256":"2b4728a9f205e596123c7c074af511abfaced3fd80fd89d03fc31c65ad90b740"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFKPLku4mvR0kLQtjEEMwl9m1t58XiygTR6DYDghYWXDSe5iHF0rMYYhrljbqll5hzOu8k4JPbyQKrDm9scbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:58:37.218612Z","bundle_sha256":"76f11b076be0713d206c3877ab5849795a47e99e8b7c058ac0d24e41c2838f7a"}}