{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:VJPSS5AR226SPONSEFCZ5LSYX4","short_pith_number":"pith:VJPSS5AR","schema_version":"1.0","canonical_sha256":"aa5f297411d6bd27b9b221459eae58bf05438bc76c9e33bd58d5524a26420853","source":{"kind":"arxiv","id":"0904.2051","version":1},"attestation_state":"computed","paper":{"title":"Joint-sparse recovery from multiple measurements","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ewout van den Berg, Michael P. Friedlander","submitted_at":"2009-04-14T05:54:33Z","abstract_excerpt":"The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely studied in compressed sensing. We analyze the recovery properties for two types of recovery algorithms. First, we show that recovery using sum-of-norm minimization cannot exceed the uniform recovery rate of sequential SMV using $\\ell_1$ minimization, and that there are problems that can be solved with one approach but not with the other. Second, we analyze "},"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":"0904.2051","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2009-04-14T05:54:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ffad5c1e3c10747dce7f971d7b1112d5bfa3ebd2a51776cb2b5e145fe6804eb7","abstract_canon_sha256":"f15e77cd4e8265efecf64045f75b45084a716a319ce6cbaacfcd334e17df64d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:33.548925Z","signature_b64":"xDRgKtl8brqvYq4VJ+wOMUrWmRx6pFgve7gAQxjIx1z216sYEC2lMHD+gMAMt1XyvuDDyF4Z+uuGkoOVEa4OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa5f297411d6bd27b9b221459eae58bf05438bc76c9e33bd58d5524a26420853","last_reissued_at":"2026-05-18T00:07:33.548329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:33.548329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint-sparse recovery from multiple measurements","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ewout van den Berg, Michael P. Friedlander","submitted_at":"2009-04-14T05:54:33Z","abstract_excerpt":"The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely studied in compressed sensing. We analyze the recovery properties for two types of recovery algorithms. First, we show that recovery using sum-of-norm minimization cannot exceed the uniform recovery rate of sequential SMV using $\\ell_1$ minimization, and that there are problems that can be solved with one approach but not with the other. Second, we analyze "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2051","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":"0904.2051","created_at":"2026-05-18T00:07:33.548438+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.2051v1","created_at":"2026-05-18T00:07:33.548438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2051","created_at":"2026-05-18T00:07:33.548438+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJPSS5AR226S","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJPSS5AR226SPONS","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJPSS5AR","created_at":"2026-05-18T12:26:02.257875+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/VJPSS5AR226SPONSEFCZ5LSYX4","json":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4.json","graph_json":"https://pith.science/api/pith-number/VJPSS5AR226SPONSEFCZ5LSYX4/graph.json","events_json":"https://pith.science/api/pith-number/VJPSS5AR226SPONSEFCZ5LSYX4/events.json","paper":"https://pith.science/paper/VJPSS5AR"},"agent_actions":{"view_html":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4","download_json":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4.json","view_paper":"https://pith.science/paper/VJPSS5AR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.2051&json=true","fetch_graph":"https://pith.science/api/pith-number/VJPSS5AR226SPONSEFCZ5LSYX4/graph.json","fetch_events":"https://pith.science/api/pith-number/VJPSS5AR226SPONSEFCZ5LSYX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4/action/storage_attestation","attest_author":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4/action/author_attestation","sign_citation":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4/action/citation_signature","submit_replication":"https://pith.science/pith/VJPSS5AR226SPONSEFCZ5LSYX4/action/replication_record"}},"created_at":"2026-05-18T00:07:33.548438+00:00","updated_at":"2026-05-18T00:07:33.548438+00:00"}