{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X5YUXJEBQFWD43RQRX47MKP3RP","short_pith_number":"pith:X5YUXJEB","schema_version":"1.0","canonical_sha256":"bf714ba481816c3e6e308df9f629fb8bfe30aed051a256c270d32fb5070fe6cb","source":{"kind":"arxiv","id":"1601.03790","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.03790","created_at":"2026-05-18T00:59:58.836129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03790v2","created_at":"2026-05-18T00:59:58.836129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03790","created_at":"2026-05-18T00:59:58.836129+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5YUXJEBQFWD","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5YUXJEBQFWD43RQ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5YUXJEB","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP","json":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP.json","graph_json":"https://pith.science/api/pith-number/X5YUXJEBQFWD43RQRX47MKP3RP/graph.json","events_json":"https://pith.science/api/pith-number/X5YUXJEBQFWD43RQRX47MKP3RP/events.json","paper":"https://pith.science/paper/X5YUXJEB"},"agent_actions":{"view_html":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP","download_json":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP.json","view_paper":"https://pith.science/paper/X5YUXJEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03790&json=true","fetch_graph":"https://pith.science/api/pith-number/X5YUXJEBQFWD43RQRX47MKP3RP/graph.json","fetch_events":"https://pith.science/api/pith-number/X5YUXJEBQFWD43RQRX47MKP3RP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/action/storage_attestation","attest_author":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/action/author_attestation","sign_citation":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/action/citation_signature","submit_replication":"https://pith.science/pith/X5YUXJEBQFWD43RQRX47MKP3RP/action/replication_record"}},"created_at":"2026-05-18T00:59:58.836129+00:00","updated_at":"2026-05-18T00:59:58.836129+00:00"}