{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QYX3YCFWYQONIROI6RZEZT5MEK","short_pith_number":"pith:QYX3YCFW","schema_version":"1.0","canonical_sha256":"862fbc08b6c41cd445c8f4724ccfac228d3278dc252c26e43a1a89999e771523","source":{"kind":"arxiv","id":"1401.7538","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Pursuit Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ang\\'elique Dr\\'emeau, C\\'edric Herzet","submitted_at":"2014-01-29T15:24:50Z","abstract_excerpt":"This paper addresses the sparse representation (SR) problem within a general Bayesian framework. We show that the Lagrangian formulation of the standard SR problem, i.e., $\\mathbf{x}^\\star=\\arg\\min_\\mathbf{x} \\lbrace \\| \\mathbf{y}-\\mathbf{D}\\mathbf{x} \\|_2^2+\\lambda\\| \\mathbf{x}\\|_0 \\rbrace$, can be regarded as a limit case of a general maximum a posteriori (MAP) problem involving Bernoulli-Gaussian variables. We then propose different tractable implementations of this MAP problem that we refer to as \"Bayesian pursuit algorithms\". The Bayesian algorithms are shown to have strong connections wi"},"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":"1401.7538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T15:24:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7ff0fb7ac22d51c83ea8cef25e8da5e8b59916172e4d1ab4e6baa179a7a2b116","abstract_canon_sha256":"a8cf8097a2ef9893199b0a046b7134184dc318f419ffe9b519e2374254e917c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:48.013726Z","signature_b64":"9CwccSFouP/lGbscPBkcoeCh46a6CkD6Im9dATrITLDUIci703gKonBdoTXc2GTVALGJ3srBBuCAjozjo1BfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"862fbc08b6c41cd445c8f4724ccfac228d3278dc252c26e43a1a89999e771523","last_reissued_at":"2026-05-18T03:00:48.013087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:48.013087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Pursuit Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ang\\'elique Dr\\'emeau, C\\'edric Herzet","submitted_at":"2014-01-29T15:24:50Z","abstract_excerpt":"This paper addresses the sparse representation (SR) problem within a general Bayesian framework. We show that the Lagrangian formulation of the standard SR problem, i.e., $\\mathbf{x}^\\star=\\arg\\min_\\mathbf{x} \\lbrace \\| \\mathbf{y}-\\mathbf{D}\\mathbf{x} \\|_2^2+\\lambda\\| \\mathbf{x}\\|_0 \\rbrace$, can be regarded as a limit case of a general maximum a posteriori (MAP) problem involving Bernoulli-Gaussian variables. We then propose different tractable implementations of this MAP problem that we refer to as \"Bayesian pursuit algorithms\". The Bayesian algorithms are shown to have strong connections wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7538","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":"1401.7538","created_at":"2026-05-18T03:00:48.013175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7538v1","created_at":"2026-05-18T03:00:48.013175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7538","created_at":"2026-05-18T03:00:48.013175+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYX3YCFWYQON","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYX3YCFWYQONIROI","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYX3YCFW","created_at":"2026-05-18T12:28:46.137349+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/QYX3YCFWYQONIROI6RZEZT5MEK","json":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK.json","graph_json":"https://pith.science/api/pith-number/QYX3YCFWYQONIROI6RZEZT5MEK/graph.json","events_json":"https://pith.science/api/pith-number/QYX3YCFWYQONIROI6RZEZT5MEK/events.json","paper":"https://pith.science/paper/QYX3YCFW"},"agent_actions":{"view_html":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK","download_json":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK.json","view_paper":"https://pith.science/paper/QYX3YCFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7538&json=true","fetch_graph":"https://pith.science/api/pith-number/QYX3YCFWYQONIROI6RZEZT5MEK/graph.json","fetch_events":"https://pith.science/api/pith-number/QYX3YCFWYQONIROI6RZEZT5MEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/action/storage_attestation","attest_author":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/action/author_attestation","sign_citation":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/action/citation_signature","submit_replication":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/action/replication_record"}},"created_at":"2026-05-18T03:00:48.013175+00:00","updated_at":"2026-05-18T03:00:48.013175+00:00"}