{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2PBXUR5J5NE3XSI5ZVN3TUNJYC","short_pith_number":"pith:2PBXUR5J","canonical_record":{"source":{"id":"1404.3394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-13T15:35:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"323664a8edad57184475684fe13a5b98070649b7052247eaa6546fe9379c6d8c","abstract_canon_sha256":"4885bbaa516f69310989679526966a503e1eba63afcdf46e17ceaafd5290ad3f"},"schema_version":"1.0"},"canonical_sha256":"d3c37a47a9eb49bbc91dcd5bb9d1a9c080c6d5de9644073e4aeea65b39f971c5","source":{"kind":"arxiv","id":"1404.3394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3394","created_at":"2026-05-18T01:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3394v2","created_at":"2026-05-18T01:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3394","created_at":"2026-05-18T01:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"2PBXUR5J5NE3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2PBXUR5J5NE3XSI5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2PBXUR5J","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2PBXUR5J5NE3XSI5ZVN3TUNJYC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-13T15:35:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"323664a8edad57184475684fe13a5b98070649b7052247eaa6546fe9379c6d8c","abstract_canon_sha256":"4885bbaa516f69310989679526966a503e1eba63afcdf46e17ceaafd5290ad3f"},"schema_version":"1.0"},"canonical_sha256":"d3c37a47a9eb49bbc91dcd5bb9d1a9c080c6d5de9644073e4aeea65b39f971c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:56.055279Z","signature_b64":"AAFwl4v4JmrfNvXVev1r1QMt5luBhiKFN2IwVw6HVYciMYpHJehW0TZFYYmeI+ECEh+e57UKWbSVj9f3uRwHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3c37a47a9eb49bbc91dcd5bb9d1a9c080c6d5de9644073e4aeea65b39f971c5","last_reissued_at":"2026-05-18T01:21:56.054488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:56.054488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3394","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-18T01:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IXx7raoH3k1BlXHru3K2JP+5RM1wLcsXtjjcg7lxLX0/q4KISGARmUFbv2O6LeEe1fvkQJ5E21qsX7XAk0iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:28:39.603877Z"},"content_sha256":"d01fc4079d628173cdbcc2592b9a1dd0c5cd11595eb92034998c04a484d83f65","schema_version":"1.0","event_id":"sha256:d01fc4079d628173cdbcc2592b9a1dd0c5cd11595eb92034998c04a484d83f65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2PBXUR5J5NE3XSI5ZVN3TUNJYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized and Collaborative Subspace Pursuit: A Communication-Efficient Algorithm for Joint Sparsity Pattern Recovery with Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gang Li, Pramod K. Varshney, Thakshila Wimalajeewa","submitted_at":"2014-04-13T15:35:33Z","abstract_excerpt":"In this paper, we consider the problem of joint sparsity pattern recovery in a distributed sensor network. The sparse multiple measurement vector signals (MMVs) observed by all the nodes are assumed to have a common (but unknown) sparsity pattern. To accurately recover the common sparsity pattern in a decentralized manner with a low communication overhead of the network, we develop an algorithm named decentralized and collaborative subspace pursuit (DCSP). In DCSP, each node is required to perform three kinds of operations per iteration: 1) estimate the local sparsity pattern by finding the su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3394","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-18T01:21:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wh+mEXOLGgkA+5CUaBIdj89s7Fi8gUWx6FFHlLupPezQ+niwIkMOcefcyHnasNnlCEDzjdoy4/xZv7Iz1wdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:28:39.604462Z"},"content_sha256":"a6300ea15332e4be95c31384199dfd97e562dc08d76d3b0a528307308fed1d21","schema_version":"1.0","event_id":"sha256:a6300ea15332e4be95c31384199dfd97e562dc08d76d3b0a528307308fed1d21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PBXUR5J5NE3XSI5ZVN3TUNJYC/bundle.json","state_url":"https://pith.science/pith/2PBXUR5J5NE3XSI5ZVN3TUNJYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PBXUR5J5NE3XSI5ZVN3TUNJYC/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-05-30T11:28:39Z","links":{"resolver":"https://pith.science/pith/2PBXUR5J5NE3XSI5ZVN3TUNJYC","bundle":"https://pith.science/pith/2PBXUR5J5NE3XSI5ZVN3TUNJYC/bundle.json","state":"https://pith.science/pith/2PBXUR5J5NE3XSI5ZVN3TUNJYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PBXUR5J5NE3XSI5ZVN3TUNJYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2PBXUR5J5NE3XSI5ZVN3TUNJYC","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":"4885bbaa516f69310989679526966a503e1eba63afcdf46e17ceaafd5290ad3f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-13T15:35:33Z","title_canon_sha256":"323664a8edad57184475684fe13a5b98070649b7052247eaa6546fe9379c6d8c"},"schema_version":"1.0","source":{"id":"1404.3394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3394","created_at":"2026-05-18T01:21:56Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3394v2","created_at":"2026-05-18T01:21:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3394","created_at":"2026-05-18T01:21:56Z"},{"alias_kind":"pith_short_12","alias_value":"2PBXUR5J5NE3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2PBXUR5J5NE3XSI5","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2PBXUR5J","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:a6300ea15332e4be95c31384199dfd97e562dc08d76d3b0a528307308fed1d21","target":"graph","created_at":"2026-05-18T01:21:56Z","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, we consider the problem of joint sparsity pattern recovery in a distributed sensor network. The sparse multiple measurement vector signals (MMVs) observed by all the nodes are assumed to have a common (but unknown) sparsity pattern. To accurately recover the common sparsity pattern in a decentralized manner with a low communication overhead of the network, we develop an algorithm named decentralized and collaborative subspace pursuit (DCSP). In DCSP, each node is required to perform three kinds of operations per iteration: 1) estimate the local sparsity pattern by finding the su","authors_text":"Gang Li, Pramod K. Varshney, Thakshila Wimalajeewa","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-13T15:35:33Z","title":"Decentralized and Collaborative Subspace Pursuit: A Communication-Efficient Algorithm for Joint Sparsity Pattern Recovery with Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3394","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:d01fc4079d628173cdbcc2592b9a1dd0c5cd11595eb92034998c04a484d83f65","target":"record","created_at":"2026-05-18T01:21:56Z","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":"4885bbaa516f69310989679526966a503e1eba63afcdf46e17ceaafd5290ad3f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-13T15:35:33Z","title_canon_sha256":"323664a8edad57184475684fe13a5b98070649b7052247eaa6546fe9379c6d8c"},"schema_version":"1.0","source":{"id":"1404.3394","kind":"arxiv","version":2}},"canonical_sha256":"d3c37a47a9eb49bbc91dcd5bb9d1a9c080c6d5de9644073e4aeea65b39f971c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3c37a47a9eb49bbc91dcd5bb9d1a9c080c6d5de9644073e4aeea65b39f971c5","first_computed_at":"2026-05-18T01:21:56.054488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:56.054488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AAFwl4v4JmrfNvXVev1r1QMt5luBhiKFN2IwVw6HVYciMYpHJehW0TZFYYmeI+ECEh+e57UKWbSVj9f3uRwHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:56.055279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d01fc4079d628173cdbcc2592b9a1dd0c5cd11595eb92034998c04a484d83f65","sha256:a6300ea15332e4be95c31384199dfd97e562dc08d76d3b0a528307308fed1d21"],"state_sha256":"456b2e41a58b0b56f7324f5629504afc73d3e7dafb286982558d0e861adec2a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zEMt1ZXzviM79+QLsr07d2q0u616etD+1M9hXHVQfhiTUYSvLvHziqjXJmVhakB6YnCSvbPaIA5uKH/m7bQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:28:39.606970Z","bundle_sha256":"5386ad7f6b4029f753e9af8344c71318c41008391931845fc3726533dbadb0f7"}}