{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:A4N74W6QYEW3GVMYOO3AGWTZQU","short_pith_number":"pith:A4N74W6Q","schema_version":"1.0","canonical_sha256":"071bfe5bd0c12db3559873b6035a798517528ab02f6eb5392a39e02f7840bea1","source":{"kind":"arxiv","id":"1004.3071","version":4},"attestation_state":"computed","paper":{"title":"Subspace Methods for Joint Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Marius Junge, Yoram Bresler","submitted_at":"2010-04-18T23:52:49Z","abstract_excerpt":"We propose robust and efficient algorithms for the joint sparse recovery problem in compressed sensing, which simultaneously recover the supports of jointly sparse signals from their multiple measurement vectors obtained through a common sensing matrix. In a favorable situation, the unknown matrix, which consists of the jointly sparse signals, has linearly independent nonzero rows. In this case, the MUSIC (MUltiple SIgnal Classification) algorithm, originally proposed by Schmidt for the direction of arrival problem in sensor array processing and later proposed and analyzed for joint sparse rec"},"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":"1004.3071","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-18T23:52:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f78cd7277a1155a732be7dd8b5795e93d3d466fff1ded4e6a12812be486becf1","abstract_canon_sha256":"63f40d6520c78b79723b60bb27137c8dee4a408f56669706771b23cd7fc4db01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.605640Z","signature_b64":"ITaxpd0/v16zIevlQ5/sbiajuzohsVflBWwZbMSjEQ8Lv9iou8KFpNlVwxX1sTHhDiwgRJxDn0WAO9k8Uq6/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"071bfe5bd0c12db3559873b6035a798517528ab02f6eb5392a39e02f7840bea1","last_reissued_at":"2026-05-18T00:58:19.604895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.604895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace Methods for Joint Sparse Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kiryung Lee, Marius Junge, Yoram Bresler","submitted_at":"2010-04-18T23:52:49Z","abstract_excerpt":"We propose robust and efficient algorithms for the joint sparse recovery problem in compressed sensing, which simultaneously recover the supports of jointly sparse signals from their multiple measurement vectors obtained through a common sensing matrix. In a favorable situation, the unknown matrix, which consists of the jointly sparse signals, has linearly independent nonzero rows. In this case, the MUSIC (MUltiple SIgnal Classification) algorithm, originally proposed by Schmidt for the direction of arrival problem in sensor array processing and later proposed and analyzed for joint sparse rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3071","kind":"arxiv","version":4},"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":"1004.3071","created_at":"2026-05-18T00:58:19.605021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.3071v4","created_at":"2026-05-18T00:58:19.605021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3071","created_at":"2026-05-18T00:58:19.605021+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4N74W6QYEW3","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4N74W6QYEW3GVMY","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4N74W6Q","created_at":"2026-05-18T12:26:05.355336+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/A4N74W6QYEW3GVMYOO3AGWTZQU","json":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU.json","graph_json":"https://pith.science/api/pith-number/A4N74W6QYEW3GVMYOO3AGWTZQU/graph.json","events_json":"https://pith.science/api/pith-number/A4N74W6QYEW3GVMYOO3AGWTZQU/events.json","paper":"https://pith.science/paper/A4N74W6Q"},"agent_actions":{"view_html":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU","download_json":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU.json","view_paper":"https://pith.science/paper/A4N74W6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.3071&json=true","fetch_graph":"https://pith.science/api/pith-number/A4N74W6QYEW3GVMYOO3AGWTZQU/graph.json","fetch_events":"https://pith.science/api/pith-number/A4N74W6QYEW3GVMYOO3AGWTZQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU/action/storage_attestation","attest_author":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU/action/author_attestation","sign_citation":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU/action/citation_signature","submit_replication":"https://pith.science/pith/A4N74W6QYEW3GVMYOO3AGWTZQU/action/replication_record"}},"created_at":"2026-05-18T00:58:19.605021+00:00","updated_at":"2026-05-18T00:58:19.605021+00:00"}