{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VMTXUZUKOCX5CA4XS3MHROH2VG","short_pith_number":"pith:VMTXUZUK","canonical_record":{"source":{"id":"1508.04924","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:57:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7292cb761d616f1f92d0d9c721bce23925cec03309932eb959c9affde056abff","abstract_canon_sha256":"adad09deda14eeaf66f9080727c87c6f00b0c07923690d050119f853b107f5da"},"schema_version":"1.0"},"canonical_sha256":"ab277a668a70afd1039796d878b8faa98aa0a4140c51cd3c1bac6dff245da854","source":{"kind":"arxiv","id":"1508.04924","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04924","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04924v3","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04924","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"VMTXUZUKOCX5","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VMTXUZUKOCX5CA4X","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VMTXUZUK","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VMTXUZUKOCX5CA4XS3MHROH2VG","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04924","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:57:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7292cb761d616f1f92d0d9c721bce23925cec03309932eb959c9affde056abff","abstract_canon_sha256":"adad09deda14eeaf66f9080727c87c6f00b0c07923690d050119f853b107f5da"},"schema_version":"1.0"},"canonical_sha256":"ab277a668a70afd1039796d878b8faa98aa0a4140c51cd3c1bac6dff245da854","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.739938Z","signature_b64":"EpXEHvbu6H9Z/nfiWkcGKeEfT+V1afcv8K/kJeUUMVNDF+UHm3kARSQ3D4OGdejkg+S5OoKN9rlqZafNnnFNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab277a668a70afd1039796d878b8faa98aa0a4140c51cd3c1bac6dff245da854","last_reissued_at":"2026-05-18T00:59:34.739229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.739229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04924","source_version":3,"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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYZruzb8jLUlUfqB6rZUIOQ37b+JcuSfJvnpWZ5fXHIQhn9OSX/zD28fitgTt07f7AVKMVlxYDixR9WkthR/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:39:35.151422Z"},"content_sha256":"c8664f385bc1bce6e44d580b8078a0be21b78efc8045416ad6ad8a1c568f688d","schema_version":"1.0","event_id":"sha256:c8664f385bc1bce6e44d580b8078a0be21b78efc8045416ad6ad8a1c568f688d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VMTXUZUKOCX5CA4XS3MHROH2VG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Compressive Sensing: A Deep Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hamid Palangi, Li Deng, Rabab Ward","submitted_at":"2015-08-20T08:57:29Z","abstract_excerpt":"Various studies that address the compressed sensing problem with Multiple Measurement Vectors (MMVs) have been recently carried. These studies assume the vectors of the different channels to be jointly sparse. In this paper, we relax this condition. Instead we assume that these sparse vectors depend on each other but that this dependency is unknown. We capture this dependency by computing the conditional probability of each entry in each vector being non-zero, given the \"residuals\" of all previous vectors. To estimate these probabilities, we propose the use of the Long Short-Term Memory (LSTM)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04924","kind":"arxiv","version":3},"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:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWdFM3GxBuTSN5rWH0pzxiQu7ZG32tx3JG1Fl3PQA/F/AAp3y2Ji9imGLqLDkr87Iu+OYLXANrQviRmcNHdgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:39:35.152087Z"},"content_sha256":"2e51b4b5ffebcb113fec4b407c42b0585002fe4956b2311554a06620ec81809c","schema_version":"1.0","event_id":"sha256:2e51b4b5ffebcb113fec4b407c42b0585002fe4956b2311554a06620ec81809c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMTXUZUKOCX5CA4XS3MHROH2VG/bundle.json","state_url":"https://pith.science/pith/VMTXUZUKOCX5CA4XS3MHROH2VG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMTXUZUKOCX5CA4XS3MHROH2VG/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-08T18:39:35Z","links":{"resolver":"https://pith.science/pith/VMTXUZUKOCX5CA4XS3MHROH2VG","bundle":"https://pith.science/pith/VMTXUZUKOCX5CA4XS3MHROH2VG/bundle.json","state":"https://pith.science/pith/VMTXUZUKOCX5CA4XS3MHROH2VG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMTXUZUKOCX5CA4XS3MHROH2VG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VMTXUZUKOCX5CA4XS3MHROH2VG","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":"adad09deda14eeaf66f9080727c87c6f00b0c07923690d050119f853b107f5da","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:57:29Z","title_canon_sha256":"7292cb761d616f1f92d0d9c721bce23925cec03309932eb959c9affde056abff"},"schema_version":"1.0","source":{"id":"1508.04924","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04924","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04924v3","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04924","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"VMTXUZUKOCX5","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VMTXUZUKOCX5CA4X","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VMTXUZUK","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:2e51b4b5ffebcb113fec4b407c42b0585002fe4956b2311554a06620ec81809c","target":"graph","created_at":"2026-05-18T00:59:34Z","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":"Various studies that address the compressed sensing problem with Multiple Measurement Vectors (MMVs) have been recently carried. These studies assume the vectors of the different channels to be jointly sparse. In this paper, we relax this condition. Instead we assume that these sparse vectors depend on each other but that this dependency is unknown. We capture this dependency by computing the conditional probability of each entry in each vector being non-zero, given the \"residuals\" of all previous vectors. To estimate these probabilities, we propose the use of the Long Short-Term Memory (LSTM)","authors_text":"Hamid Palangi, Li Deng, Rabab Ward","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:57:29Z","title":"Distributed Compressive Sensing: A Deep Learning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04924","kind":"arxiv","version":3},"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:c8664f385bc1bce6e44d580b8078a0be21b78efc8045416ad6ad8a1c568f688d","target":"record","created_at":"2026-05-18T00:59:34Z","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":"adad09deda14eeaf66f9080727c87c6f00b0c07923690d050119f853b107f5da","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:57:29Z","title_canon_sha256":"7292cb761d616f1f92d0d9c721bce23925cec03309932eb959c9affde056abff"},"schema_version":"1.0","source":{"id":"1508.04924","kind":"arxiv","version":3}},"canonical_sha256":"ab277a668a70afd1039796d878b8faa98aa0a4140c51cd3c1bac6dff245da854","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab277a668a70afd1039796d878b8faa98aa0a4140c51cd3c1bac6dff245da854","first_computed_at":"2026-05-18T00:59:34.739229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:34.739229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EpXEHvbu6H9Z/nfiWkcGKeEfT+V1afcv8K/kJeUUMVNDF+UHm3kARSQ3D4OGdejkg+S5OoKN9rlqZafNnnFNAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:34.739938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04924","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8664f385bc1bce6e44d580b8078a0be21b78efc8045416ad6ad8a1c568f688d","sha256:2e51b4b5ffebcb113fec4b407c42b0585002fe4956b2311554a06620ec81809c"],"state_sha256":"c97e1375fdc7eb588127d7a48caad2ffa3ca0e10da243836b7f149d5588eca6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dB6NbXSExmKuCXNeBFPaGRjhtgC4uFLIQ8bmVkq+XBz5gqewAA4Fy2lglzUNfcMrBfcAOP4c9oAW5rhRMWH4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:39:35.156279Z","bundle_sha256":"f7cdca6b8a366ccc30f0337c494e2580dc8b45de65ffe143742385c365d48a9e"}}