{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H6F2SJH7ABZRS74AEEWMBPRGPK","short_pith_number":"pith:H6F2SJH7","schema_version":"1.0","canonical_sha256":"3f8ba924ff0073197f80212cc0be267a95eac8fb939b6d633da6879a98a615fa","source":{"kind":"arxiv","id":"1211.5058","version":1},"attestation_state":"computed","paper":{"title":"Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Golbabaee, Pierre Vandergheynst","submitted_at":"2012-11-21T15:24:13Z","abstract_excerpt":"In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is generic enough to find a lot of applications, for instance in multichannel signal compressed sensing (e.g. sensor networks, hyperspectral imaging) and compressive sparse principal component analysis (s-PCA). We assume data matrices have a simultaneous low-rank and joint sparse structure, and we propose a novel approach for efficient compressed sensing (CS) of"},"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":"1211.5058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-21T15:24:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5b349de314f0fb286351027c670904754443e08616a8ef4496951312d702bf8c","abstract_canon_sha256":"2e06472629b1e1696ea3dc6fba0c292bee02b3277f1ac13d5a1fb8be3183ff9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:15.147010Z","signature_b64":"riEQWcEzZU1SIZSb2YFj6MIGrsqmO9rW9AfDFevJfKAFz656cAozlC4QJHYj/quakjBuZA2xUOPuh7jeSzJcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f8ba924ff0073197f80212cc0be267a95eac8fb939b6d633da6879a98a615fa","last_reissued_at":"2026-05-18T03:40:15.146275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:15.146275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Golbabaee, Pierre Vandergheynst","submitted_at":"2012-11-21T15:24:13Z","abstract_excerpt":"In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is generic enough to find a lot of applications, for instance in multichannel signal compressed sensing (e.g. sensor networks, hyperspectral imaging) and compressive sparse principal component analysis (s-PCA). We assume data matrices have a simultaneous low-rank and joint sparse structure, and we propose a novel approach for efficient compressed sensing (CS) of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5058","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":"1211.5058","created_at":"2026-05-18T03:40:15.146406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.5058v1","created_at":"2026-05-18T03:40:15.146406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5058","created_at":"2026-05-18T03:40:15.146406+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6F2SJH7ABZR","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6F2SJH7ABZRS74A","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6F2SJH7","created_at":"2026-05-18T12:27:06.952714+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/H6F2SJH7ABZRS74AEEWMBPRGPK","json":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK.json","graph_json":"https://pith.science/api/pith-number/H6F2SJH7ABZRS74AEEWMBPRGPK/graph.json","events_json":"https://pith.science/api/pith-number/H6F2SJH7ABZRS74AEEWMBPRGPK/events.json","paper":"https://pith.science/paper/H6F2SJH7"},"agent_actions":{"view_html":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK","download_json":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK.json","view_paper":"https://pith.science/paper/H6F2SJH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.5058&json=true","fetch_graph":"https://pith.science/api/pith-number/H6F2SJH7ABZRS74AEEWMBPRGPK/graph.json","fetch_events":"https://pith.science/api/pith-number/H6F2SJH7ABZRS74AEEWMBPRGPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/action/storage_attestation","attest_author":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/action/author_attestation","sign_citation":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/action/citation_signature","submit_replication":"https://pith.science/pith/H6F2SJH7ABZRS74AEEWMBPRGPK/action/replication_record"}},"created_at":"2026-05-18T03:40:15.146406+00:00","updated_at":"2026-05-18T03:40:15.146406+00:00"}