{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UYPVRDWDNT64TW32ELA4OJIJR7","short_pith_number":"pith:UYPVRDWD","canonical_record":{"source":{"id":"1404.3766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-14T22:05:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c8f02161111fa62d948b037090319e9076459df5eda1da737cf6864247901284","abstract_canon_sha256":"1cc7bf1fd01233ae7df48fac20a0c2e788717b2e8770a246fb90c4370689b006"},"schema_version":"1.0"},"canonical_sha256":"a61f588ec36cfdc9db7a22c1c725098fde4ff3ede92f490ee3df3cc225d5866b","source":{"kind":"arxiv","id":"1404.3766","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3766","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3766v2","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3766","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"UYPVRDWDNT64","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UYPVRDWDNT64TW32","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UYPVRDWD","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UYPVRDWDNT64TW32ELA4OJIJR7","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-14T22:05:50Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c8f02161111fa62d948b037090319e9076459df5eda1da737cf6864247901284","abstract_canon_sha256":"1cc7bf1fd01233ae7df48fac20a0c2e788717b2e8770a246fb90c4370689b006"},"schema_version":"1.0"},"canonical_sha256":"a61f588ec36cfdc9db7a22c1c725098fde4ff3ede92f490ee3df3cc225d5866b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.655777Z","signature_b64":"GBZYR2YhbequKlHIsbhoBx3YLZwmcRsPheE1Tm6NRA0cgoz72PUoTO2wbufglHWuvV/dOzNSwQECtoDErn+kCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a61f588ec36cfdc9db7a22c1c725098fde4ff3ede92f490ee3df3cc225d5866b","last_reissued_at":"2026-05-18T02:51:14.655293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.655293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3766","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-18T02:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VVHQc7drxw3l77rP2S1RzFpkHIouMTg8PJ0nelZ4V3q9Q3eYsCI9/Wb8dq32kNNQcXM+6KoInRFLluxsT+iBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:04:44.949492Z"},"content_sha256":"deb9185679e32ad43c0bfb468d974204b2185acc5dee3d841ca1500eb8501993","schema_version":"1.0","event_id":"sha256:deb9185679e32ad43c0bfb468d974204b2185acc5dee3d841ca1500eb8501993"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UYPVRDWDNT64TW32ELA4OJIJR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Approximate Message Passing for Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Mengqi Ren, Puxiao Han, Ruixin Niu","submitted_at":"2014-04-14T22:05:50Z","abstract_excerpt":"In this paper, an efficient distributed approach for implementing the approximate message passing (AMP) algorithm, named distributed AMP (DAMP), is developed for compressed sensing (CS) recovery in sensor networks with the sparsity K unknown. In the proposed DAMP, distributed sensors do not have to use or know the entire global sensing matrix, and the burden of computation and storage for each sensor is reduced. To reduce communications among the sensors, a new data query algorithm, called global computation for AMP (GCAMP), is proposed. The proposed GCAMP based DAMP approach has exactly the s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3766","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-18T02:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MXbMkJ5cMyPgDqAk35cJnm2R4TwCV94/10DJ+BpeEMI5vhK+Ptt03CTd6bJAo7wl1u+44+7aKdZFuLKMK4DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:04:44.949865Z"},"content_sha256":"c30cfe030ce2f08215e28c8771f2b5996f0379ab0149057f4dc32ea803283215","schema_version":"1.0","event_id":"sha256:c30cfe030ce2f08215e28c8771f2b5996f0379ab0149057f4dc32ea803283215"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYPVRDWDNT64TW32ELA4OJIJR7/bundle.json","state_url":"https://pith.science/pith/UYPVRDWDNT64TW32ELA4OJIJR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYPVRDWDNT64TW32ELA4OJIJR7/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-03T06:04:44Z","links":{"resolver":"https://pith.science/pith/UYPVRDWDNT64TW32ELA4OJIJR7","bundle":"https://pith.science/pith/UYPVRDWDNT64TW32ELA4OJIJR7/bundle.json","state":"https://pith.science/pith/UYPVRDWDNT64TW32ELA4OJIJR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYPVRDWDNT64TW32ELA4OJIJR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UYPVRDWDNT64TW32ELA4OJIJR7","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":"1cc7bf1fd01233ae7df48fac20a0c2e788717b2e8770a246fb90c4370689b006","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-14T22:05:50Z","title_canon_sha256":"c8f02161111fa62d948b037090319e9076459df5eda1da737cf6864247901284"},"schema_version":"1.0","source":{"id":"1404.3766","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3766","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3766v2","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3766","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"UYPVRDWDNT64","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UYPVRDWDNT64TW32","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UYPVRDWD","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:c30cfe030ce2f08215e28c8771f2b5996f0379ab0149057f4dc32ea803283215","target":"graph","created_at":"2026-05-18T02:51:14Z","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":"In this paper, an efficient distributed approach for implementing the approximate message passing (AMP) algorithm, named distributed AMP (DAMP), is developed for compressed sensing (CS) recovery in sensor networks with the sparsity K unknown. In the proposed DAMP, distributed sensors do not have to use or know the entire global sensing matrix, and the burden of computation and storage for each sensor is reduced. To reduce communications among the sensors, a new data query algorithm, called global computation for AMP (GCAMP), is proposed. The proposed GCAMP based DAMP approach has exactly the s","authors_text":"Mengqi Ren, Puxiao Han, Ruixin Niu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-14T22:05:50Z","title":"Distributed Approximate Message Passing for Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3766","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:deb9185679e32ad43c0bfb468d974204b2185acc5dee3d841ca1500eb8501993","target":"record","created_at":"2026-05-18T02:51:14Z","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":"1cc7bf1fd01233ae7df48fac20a0c2e788717b2e8770a246fb90c4370689b006","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-14T22:05:50Z","title_canon_sha256":"c8f02161111fa62d948b037090319e9076459df5eda1da737cf6864247901284"},"schema_version":"1.0","source":{"id":"1404.3766","kind":"arxiv","version":2}},"canonical_sha256":"a61f588ec36cfdc9db7a22c1c725098fde4ff3ede92f490ee3df3cc225d5866b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a61f588ec36cfdc9db7a22c1c725098fde4ff3ede92f490ee3df3cc225d5866b","first_computed_at":"2026-05-18T02:51:14.655293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:14.655293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GBZYR2YhbequKlHIsbhoBx3YLZwmcRsPheE1Tm6NRA0cgoz72PUoTO2wbufglHWuvV/dOzNSwQECtoDErn+kCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:14.655777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3766","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:deb9185679e32ad43c0bfb468d974204b2185acc5dee3d841ca1500eb8501993","sha256:c30cfe030ce2f08215e28c8771f2b5996f0379ab0149057f4dc32ea803283215"],"state_sha256":"7d1cdd3f8fc933a465fca78baea62dae51571c212b8e005ae624c1a8aeccdc41"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGHbVIbjM2But2ShMp99o8uOdqWPgrbItzgkcOuzUR1Kov92WlyaviIEEaJiibxIsUMhue9vF26rcxhA6Rd2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:04:44.951901Z","bundle_sha256":"bd348ccb2b71cef520ea9855f63ad992a45c85bd37a6eded741e94dcc4591931"}}