{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JHCPAFLNQBQH62SZFKFRQWTHRH","short_pith_number":"pith:JHCPAFLN","schema_version":"1.0","canonical_sha256":"49c4f0156d80607f6a592a8b185a6789ce147964e910003d696a7332de3c81e4","source":{"kind":"arxiv","id":"1601.04595","version":1},"attestation_state":"computed","paper":{"title":"Multi-Processor Approximate Message Passing Using Lossy Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Dror Baron, Junan Zhu, Puxiao Han, Ruixin Niu","submitted_at":"2016-01-18T16:41:44Z","abstract_excerpt":"In this paper, a communication-efficient multi-processor compressed sensing framework based on the approximate message passing algorithm is proposed. We perform lossy compression on the data being communicated between processors, resulting in a reduction in communication costs with a minor degradation in recovery quality. In the proposed framework, a new state evolution formulation takes the quantization error into account, and analytically determines the coding rate required in each iteration. Two approaches for allocating the coding rate, an online back-tracking heuristic and an optimal allo"},"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.04595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-18T16:41:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ee6f17e4ebaf64123cfc7b995e7c531f1b1e9a010d350a54dce81ed779b51e41","abstract_canon_sha256":"5ca11904f4e2095635a2cd4a0e92b78c1d377dbeaf97c2e1c37ed01ed2becda4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:44.663882Z","signature_b64":"HtRM8KFwmw16oyAIIhdKugNqTN3BRabdybLTNyPFhgkSSQwsgchHH79VoVRzROO+fJj+FTwh554Yh1iatyTPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49c4f0156d80607f6a592a8b185a6789ce147964e910003d696a7332de3c81e4","last_reissued_at":"2026-05-18T01:22:44.663416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:44.663416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Processor Approximate Message Passing Using Lossy Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Dror Baron, Junan Zhu, Puxiao Han, Ruixin Niu","submitted_at":"2016-01-18T16:41:44Z","abstract_excerpt":"In this paper, a communication-efficient multi-processor compressed sensing framework based on the approximate message passing algorithm is proposed. We perform lossy compression on the data being communicated between processors, resulting in a reduction in communication costs with a minor degradation in recovery quality. In the proposed framework, a new state evolution formulation takes the quantization error into account, and analytically determines the coding rate required in each iteration. Two approaches for allocating the coding rate, an online back-tracking heuristic and an optimal allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04595","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04595","created_at":"2026-05-18T01:22:44.663489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04595v1","created_at":"2026-05-18T01:22:44.663489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04595","created_at":"2026-05-18T01:22:44.663489+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHCPAFLNQBQH","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHCPAFLNQBQH62SZ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHCPAFLN","created_at":"2026-05-18T12:30:25.849896+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/JHCPAFLNQBQH62SZFKFRQWTHRH","json":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH.json","graph_json":"https://pith.science/api/pith-number/JHCPAFLNQBQH62SZFKFRQWTHRH/graph.json","events_json":"https://pith.science/api/pith-number/JHCPAFLNQBQH62SZFKFRQWTHRH/events.json","paper":"https://pith.science/paper/JHCPAFLN"},"agent_actions":{"view_html":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH","download_json":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH.json","view_paper":"https://pith.science/paper/JHCPAFLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04595&json=true","fetch_graph":"https://pith.science/api/pith-number/JHCPAFLNQBQH62SZFKFRQWTHRH/graph.json","fetch_events":"https://pith.science/api/pith-number/JHCPAFLNQBQH62SZFKFRQWTHRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH/action/storage_attestation","attest_author":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH/action/author_attestation","sign_citation":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH/action/citation_signature","submit_replication":"https://pith.science/pith/JHCPAFLNQBQH62SZFKFRQWTHRH/action/replication_record"}},"created_at":"2026-05-18T01:22:44.663489+00:00","updated_at":"2026-05-18T01:22:44.663489+00:00"}