{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WFEGOPED7RODVW7Q6CNVZWV5N7","short_pith_number":"pith:WFEGOPED","schema_version":"1.0","canonical_sha256":"b148673c83fc5c3adbf0f09b5cdabd6fccc1de92974df4b86ebc4ed792cbab83","source":{"kind":"arxiv","id":"1510.02877","version":2},"attestation_state":"computed","paper":{"title":"Simultaneous Sparse Approximation and Common Component Extraction using Fast Distributed Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Golibagh Mahyari, Selin Aviyente","submitted_at":"2015-10-10T04:54:38Z","abstract_excerpt":"Simultaneous sparse approximation is a generalization of the standard sparse approximation, for simultaneously representing a set of signals using a common sparsity model. Generalizing the compressive sensing concept to the simultaneous sparse approximation yields distributed compressive sensing (DCS). DCS finds the sparse representation of multiple correlated signals using the common + innovation signal model. However, DCS is not efficient for joint recovery of a large number of signals since it requires large memory and computational time. In this paper, we propose a new hierarchical algorit"},"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":"1510.02877","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-10T04:54:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9e5646436a9ab706c7035c0bd6ea3279fea0bdad84e41937824db0c7f2e89513","abstract_canon_sha256":"b1e150598d00718bb4ff23919135b4634a14e070752eef18493d1bb6e4482da5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:40.058943Z","signature_b64":"bSWd6YcU0KQ0CibEKDtq4eUSEiR1lSE7Pz1UpxwQCW9Rb4bsrI422zDE9cyN9AG5y6gxO9pxQYPq5nPJts1sBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b148673c83fc5c3adbf0f09b5cdabd6fccc1de92974df4b86ebc4ed792cbab83","last_reissued_at":"2026-05-18T00:05:40.058529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:40.058529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Sparse Approximation and Common Component Extraction using Fast Distributed Compressive Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Golibagh Mahyari, Selin Aviyente","submitted_at":"2015-10-10T04:54:38Z","abstract_excerpt":"Simultaneous sparse approximation is a generalization of the standard sparse approximation, for simultaneously representing a set of signals using a common sparsity model. Generalizing the compressive sensing concept to the simultaneous sparse approximation yields distributed compressive sensing (DCS). DCS finds the sparse representation of multiple correlated signals using the common + innovation signal model. However, DCS is not efficient for joint recovery of a large number of signals since it requires large memory and computational time. In this paper, we propose a new hierarchical algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02877","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":"1510.02877","created_at":"2026-05-18T00:05:40.058593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02877v2","created_at":"2026-05-18T00:05:40.058593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02877","created_at":"2026-05-18T00:05:40.058593+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFEGOPED7ROD","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFEGOPED7RODVW7Q","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFEGOPED","created_at":"2026-05-18T12:29:47.479230+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/WFEGOPED7RODVW7Q6CNVZWV5N7","json":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7.json","graph_json":"https://pith.science/api/pith-number/WFEGOPED7RODVW7Q6CNVZWV5N7/graph.json","events_json":"https://pith.science/api/pith-number/WFEGOPED7RODVW7Q6CNVZWV5N7/events.json","paper":"https://pith.science/paper/WFEGOPED"},"agent_actions":{"view_html":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7","download_json":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7.json","view_paper":"https://pith.science/paper/WFEGOPED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02877&json=true","fetch_graph":"https://pith.science/api/pith-number/WFEGOPED7RODVW7Q6CNVZWV5N7/graph.json","fetch_events":"https://pith.science/api/pith-number/WFEGOPED7RODVW7Q6CNVZWV5N7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7/action/storage_attestation","attest_author":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7/action/author_attestation","sign_citation":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7/action/citation_signature","submit_replication":"https://pith.science/pith/WFEGOPED7RODVW7Q6CNVZWV5N7/action/replication_record"}},"created_at":"2026-05-18T00:05:40.058593+00:00","updated_at":"2026-05-18T00:05:40.058593+00:00"}