{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PQHLJ5MUF6P54IR6AZD2YRX53N","short_pith_number":"pith:PQHLJ5MU","schema_version":"1.0","canonical_sha256":"7c0eb4f5942f9fde223e0647ac46fddb7cd97492280eb71a1aeadee03cb100a7","source":{"kind":"arxiv","id":"1302.5010","version":2},"attestation_state":"computed","paper":{"title":"Matching Pursuit LASSO Part II: Applications and Sparse Recovery over Batch Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Ivor W. Tsang, Li Wang, Mingkui Tan","submitted_at":"2013-02-20T16:09:38Z","abstract_excerpt":"Matching Pursuit LASSIn Part I \\cite{TanPMLPart1}, a Matching Pursuit LASSO ({MPL}) algorithm has been presented for solving large-scale sparse recovery (SR) problems. In this paper, we present a subspace search to further improve the performance of MPL, and then continue to address another major challenge of SR -- batch SR with many signals, a consideration which is absent from most of previous $\\ell_1$-norm methods. As a result, a batch-mode {MPL} is developed to vastly speed up sparse recovery of many signals simultaneously. Comprehensive numerical experiments on compressive sensing and fac"},"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":"1302.5010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-02-20T16:09:38Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ae1666bb5dcfe3b6290d8587f2469f5ba4925c4620d616e7f83a56fd0365e069","abstract_canon_sha256":"ba7b34d5ca8adc1e1a509a6e37f4ce9737caa824eccdf98a8889a6570966e12d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:33.962991Z","signature_b64":"yDQpb4VeNYSB4jgBzhBZbx1e/yVw9EeyFYeSkE+T0h+D9Ekrvt9vRNd0p2pWXH023CjY7vRaEvSqthcdaoaYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c0eb4f5942f9fde223e0647ac46fddb7cd97492280eb71a1aeadee03cb100a7","last_reissued_at":"2026-05-18T02:30:33.962586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:33.962586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching Pursuit LASSO Part II: Applications and Sparse Recovery over Batch Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Ivor W. Tsang, Li Wang, Mingkui Tan","submitted_at":"2013-02-20T16:09:38Z","abstract_excerpt":"Matching Pursuit LASSIn Part I \\cite{TanPMLPart1}, a Matching Pursuit LASSO ({MPL}) algorithm has been presented for solving large-scale sparse recovery (SR) problems. In this paper, we present a subspace search to further improve the performance of MPL, and then continue to address another major challenge of SR -- batch SR with many signals, a consideration which is absent from most of previous $\\ell_1$-norm methods. As a result, a batch-mode {MPL} is developed to vastly speed up sparse recovery of many signals simultaneously. Comprehensive numerical experiments on compressive sensing and fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5010","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":"1302.5010","created_at":"2026-05-18T02:30:33.962642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.5010v2","created_at":"2026-05-18T02:30:33.962642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5010","created_at":"2026-05-18T02:30:33.962642+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQHLJ5MUF6P5","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQHLJ5MUF6P54IR6","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQHLJ5MU","created_at":"2026-05-18T12:27:54.935989+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/PQHLJ5MUF6P54IR6AZD2YRX53N","json":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N.json","graph_json":"https://pith.science/api/pith-number/PQHLJ5MUF6P54IR6AZD2YRX53N/graph.json","events_json":"https://pith.science/api/pith-number/PQHLJ5MUF6P54IR6AZD2YRX53N/events.json","paper":"https://pith.science/paper/PQHLJ5MU"},"agent_actions":{"view_html":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N","download_json":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N.json","view_paper":"https://pith.science/paper/PQHLJ5MU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.5010&json=true","fetch_graph":"https://pith.science/api/pith-number/PQHLJ5MUF6P54IR6AZD2YRX53N/graph.json","fetch_events":"https://pith.science/api/pith-number/PQHLJ5MUF6P54IR6AZD2YRX53N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N/action/storage_attestation","attest_author":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N/action/author_attestation","sign_citation":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N/action/citation_signature","submit_replication":"https://pith.science/pith/PQHLJ5MUF6P54IR6AZD2YRX53N/action/replication_record"}},"created_at":"2026-05-18T02:30:33.962642+00:00","updated_at":"2026-05-18T02:30:33.962642+00:00"}