{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X5YUXJEBQFWD43RQRX47MKP3RP","short_pith_number":"pith:X5YUXJEB","canonical_record":{"source":{"id":"1601.03790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T01:10:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9742f8c973ac5ec9ed65f73b0efadef5636e1fcf7b12534949da5ae33c56a01","abstract_canon_sha256":"cb0f4603cf5b63aaae30ad012003b9a6bfe2d8eba7c312cdbb48d69c67c38f79"},"schema_version":"1.0"},"canonical_sha256":"bf714ba481816c3e6e308df9f629fb8bfe30aed051a256c270d32fb5070fe6cb","source":{"kind":"arxiv","id":"1601.03790","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03790","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03790v2","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03790","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"X5YUXJEBQFWD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X5YUXJEBQFWD43RQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X5YUXJEB","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X5YUXJEBQFWD43RQRX47MKP3RP","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03790","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T01:10:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9742f8c973ac5ec9ed65f73b0efadef5636e1fcf7b12534949da5ae33c56a01","abstract_canon_sha256":"cb0f4603cf5b63aaae30ad012003b9a6bfe2d8eba7c312cdbb48d69c67c38f79"},"schema_version":"1.0"},"canonical_sha256":"bf714ba481816c3e6e308df9f629fb8bfe30aed051a256c270d32fb5070fe6cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:58.836559Z","signature_b64":"OujWPlOs9YP0W0Wi4MOLshsKQ+HiDOxpzoZ9v84E6myhmombLi7+z8dOvv/XBdEFXdfFj241bZRPjA9fvGySAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf714ba481816c3e6e308df9f629fb8bfe30aed051a256c270d32fb5070fe6cb","last_reissued_at":"2026-05-18T00:59:58.835921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:58.835921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03790","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-18T00:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4PS5pIMaESGPFVQ/lK+H+wGqFGzXh7icb2aBbMZwu09mnZIlH0IT4hCIjtpjcvUI+Pz5/4mbA/rcZoCZsYhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:32:25.690296Z"},"content_sha256":"ce1b6a8896045d64044c8d5de42a0f57befd4cfff216b112e7a7cb3d52a3cc66","schema_version":"1.0","event_id":"sha256:ce1b6a8896045d64044c8d5de42a0f57befd4cfff216b112e7a7cb3d52a3cc66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X5YUXJEBQFWD43RQRX47MKP3RP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Trade-offs in Multi-Processor Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmad Beirami, Dror Baron, Junan Zhu","submitted_at":"2016-01-15T01:10:52Z","abstract_excerpt":"We consider large-scale linear inverse problems in Bayesian settings. We follow a recent line of work that applies the approximate message passing (AMP) framework to multi-processor (MP) computational systems, where each processor node stores and processes a subset of rows of the measurement matrix along with corresponding measurements. 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. In this setup, we derive the optimal per-iteration coding rates using dynamic programming. We analyze the exc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03790","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-18T00:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UFjGyeFUC3xiXj9MKV3SvUcFfLl0AOPoZoxCzUYH2UOZrXqSUMuvNcvJ5yJoJb4n0qEyUC4PJOUlIGW3/tGvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:32:25.690669Z"},"content_sha256":"eecad64e938838c340558091ba8c11ab316d83e717da679e817f1a180328ecea","schema_version":"1.0","event_id":"sha256:eecad64e938838c340558091ba8c11ab316d83e717da679e817f1a180328ecea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/bundle.json","state_url":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5YUXJEBQFWD43RQRX47MKP3RP/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-20T05:32:25Z","links":{"resolver":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP","bundle":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/bundle.json","state":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5YUXJEBQFWD43RQRX47MKP3RP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X5YUXJEBQFWD43RQRX47MKP3RP","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":"cb0f4603cf5b63aaae30ad012003b9a6bfe2d8eba7c312cdbb48d69c67c38f79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T01:10:52Z","title_canon_sha256":"c9742f8c973ac5ec9ed65f73b0efadef5636e1fcf7b12534949da5ae33c56a01"},"schema_version":"1.0","source":{"id":"1601.03790","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03790","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03790v2","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03790","created_at":"2026-05-18T00:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"X5YUXJEBQFWD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X5YUXJEBQFWD43RQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X5YUXJEB","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:eecad64e938838c340558091ba8c11ab316d83e717da679e817f1a180328ecea","target":"graph","created_at":"2026-05-18T00:59:58Z","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. We follow a recent line of work that applies the approximate message passing (AMP) framework to multi-processor (MP) computational systems, where each processor node stores and processes a subset of rows of the measurement matrix along with corresponding measurements. 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. In this setup, we derive the optimal per-iteration coding rates using dynamic programming. We analyze the exc","authors_text":"Ahmad Beirami, Dror Baron, Junan Zhu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T01:10:52Z","title":"Optimal Trade-offs in Multi-Processor Approximate Message Passing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03790","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:ce1b6a8896045d64044c8d5de42a0f57befd4cfff216b112e7a7cb3d52a3cc66","target":"record","created_at":"2026-05-18T00:59:58Z","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":"cb0f4603cf5b63aaae30ad012003b9a6bfe2d8eba7c312cdbb48d69c67c38f79","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-15T01:10:52Z","title_canon_sha256":"c9742f8c973ac5ec9ed65f73b0efadef5636e1fcf7b12534949da5ae33c56a01"},"schema_version":"1.0","source":{"id":"1601.03790","kind":"arxiv","version":2}},"canonical_sha256":"bf714ba481816c3e6e308df9f629fb8bfe30aed051a256c270d32fb5070fe6cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf714ba481816c3e6e308df9f629fb8bfe30aed051a256c270d32fb5070fe6cb","first_computed_at":"2026-05-18T00:59:58.835921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:58.835921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OujWPlOs9YP0W0Wi4MOLshsKQ+HiDOxpzoZ9v84E6myhmombLi7+z8dOvv/XBdEFXdfFj241bZRPjA9fvGySAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:58.836559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03790","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce1b6a8896045d64044c8d5de42a0f57befd4cfff216b112e7a7cb3d52a3cc66","sha256:eecad64e938838c340558091ba8c11ab316d83e717da679e817f1a180328ecea"],"state_sha256":"88616cab37eed75e6a6cf26f6a46ad9e1cf89838a284f0a268ebe6c2282f5eb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"px6fm7yE4BFGrSsmx72NzW5q0wRoD34irePbu4QxobiOcSRlIewCwpgOgsAS99Yi/tqfRfTJV/Bkg1ctKFiaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:32:25.692649Z","bundle_sha256":"fefbd11b338e159585d28c060c10b1bffe5c3e1cba7df7979ca106cbb6af1669"}}