{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ARDDSWA3KLFEEADTYAGH7TSA4H","short_pith_number":"pith:ARDDSWA3","schema_version":"1.0","canonical_sha256":"044639581b52ca420073c00c7fce40e1f9b8b28970b40d59c3bb1ad74dc93cd8","source":{"kind":"arxiv","id":"1610.08495","version":1},"attestation_state":"computed","paper":{"title":"Adaptive matching pursuit for sparse signal recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hojjat S. Mousavi, Tiep H. Vu, Vishal Monga","submitted_at":"2016-09-12T17:48:38Z","abstract_excerpt":"Spike and Slab priors have been of much recent interest in signal processing as a means of inducing sparsity in Bayesian inference. Applications domains that benefit from the use of these priors include sparse recovery, regression and classification. It is well-known that solving for the sparse coefficient vector to maximize these priors results in a hard non-convex and mixed integer programming problem. Most existing solutions to this optimization problem either involve simplifying assumptions/relaxations or are computationally expensive. We propose a new greedy and adaptive matching pursuit "},"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":"1610.08495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-12T17:48:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f1107d42077383a9f0ebf1dcfeff138148ea2965e575cfb84c6265a4ddbc8392","abstract_canon_sha256":"4876d45216346832bd5b7dd2559e0ebc71560365262d3c12cf26a6263ba90fe1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:09.258220Z","signature_b64":"yKk4GDUanirpngEkZUOP+s9dL1P9dxkzPHTtXExs5Ro+uzwzVCtIhLRK3Y79dt/udKqF3+IY4m9IYh34B/XVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"044639581b52ca420073c00c7fce40e1f9b8b28970b40d59c3bb1ad74dc93cd8","last_reissued_at":"2026-05-18T01:01:09.257509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:09.257509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive matching pursuit for sparse signal recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hojjat S. Mousavi, Tiep H. Vu, Vishal Monga","submitted_at":"2016-09-12T17:48:38Z","abstract_excerpt":"Spike and Slab priors have been of much recent interest in signal processing as a means of inducing sparsity in Bayesian inference. Applications domains that benefit from the use of these priors include sparse recovery, regression and classification. It is well-known that solving for the sparse coefficient vector to maximize these priors results in a hard non-convex and mixed integer programming problem. Most existing solutions to this optimization problem either involve simplifying assumptions/relaxations or are computationally expensive. We propose a new greedy and adaptive matching pursuit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08495","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":"1610.08495","created_at":"2026-05-18T01:01:09.257774+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08495v1","created_at":"2026-05-18T01:01:09.257774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08495","created_at":"2026-05-18T01:01:09.257774+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARDDSWA3KLFE","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARDDSWA3KLFEEADT","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARDDSWA3","created_at":"2026-05-18T12:30:07.202191+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/ARDDSWA3KLFEEADTYAGH7TSA4H","json":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H.json","graph_json":"https://pith.science/api/pith-number/ARDDSWA3KLFEEADTYAGH7TSA4H/graph.json","events_json":"https://pith.science/api/pith-number/ARDDSWA3KLFEEADTYAGH7TSA4H/events.json","paper":"https://pith.science/paper/ARDDSWA3"},"agent_actions":{"view_html":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H","download_json":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H.json","view_paper":"https://pith.science/paper/ARDDSWA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08495&json=true","fetch_graph":"https://pith.science/api/pith-number/ARDDSWA3KLFEEADTYAGH7TSA4H/graph.json","fetch_events":"https://pith.science/api/pith-number/ARDDSWA3KLFEEADTYAGH7TSA4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/action/storage_attestation","attest_author":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/action/author_attestation","sign_citation":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/action/citation_signature","submit_replication":"https://pith.science/pith/ARDDSWA3KLFEEADTYAGH7TSA4H/action/replication_record"}},"created_at":"2026-05-18T01:01:09.257774+00:00","updated_at":"2026-05-18T01:01:09.257774+00:00"}