{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QYX3YCFWYQONIROI6RZEZT5MEK","short_pith_number":"pith:QYX3YCFW","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"},"canonical_sha256":"862fbc08b6c41cd445c8f4724ccfac228d3278dc252c26e43a1a89999e771523","source":{"kind":"arxiv","id":"1401.7538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7538","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7538v1","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7538","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"QYX3YCFWYQON","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QYX3YCFWYQONIROI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QYX3YCFW","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QYX3YCFWYQONIROI6RZEZT5MEK","target":"record","payload":{"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"},"canonical_sha256":"862fbc08b6c41cd445c8f4724ccfac228d3278dc252c26e43a1a89999e771523","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"},"source_kind":"arxiv","source_id":"1401.7538","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BI0DUAkfwpY7qVG0GDjNJ8G/zhDObPTX/GDGwklCFkxV+wdVymFeDxzjh5VhPOHz3kuN+ao+eNuINsaeVWwtBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:19:17.028563Z"},"content_sha256":"8b9fa9700cf6665bb692ea71d9589bacb55a0cd024e6a945ae837c0a2130f7c3","schema_version":"1.0","event_id":"sha256:8b9fa9700cf6665bb692ea71d9589bacb55a0cd024e6a945ae837c0a2130f7c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QYX3YCFWYQONIROI6RZEZT5MEK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23YO7D2Jv+eRM2ew6OcJAy+2p8LN2ugTXGA9wGZDZogWGWtVWivjFr0ZnKH3EixjbWgM1aLUVZZC01X53oqTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:19:17.029232Z"},"content_sha256":"1ac4ccbc54c63e09468daf8eb911f8920c73a42fe9d32e40c06aded864d7158e","schema_version":"1.0","event_id":"sha256:1ac4ccbc54c63e09468daf8eb911f8920c73a42fe9d32e40c06aded864d7158e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/bundle.json","state_url":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYX3YCFWYQONIROI6RZEZT5MEK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T04:19:17Z","links":{"resolver":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK","bundle":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/bundle.json","state":"https://pith.science/pith/QYX3YCFWYQONIROI6RZEZT5MEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYX3YCFWYQONIROI6RZEZT5MEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QYX3YCFWYQONIROI6RZEZT5MEK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a8cf8097a2ef9893199b0a046b7134184dc318f419ffe9b519e2374254e917c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T15:24:50Z","title_canon_sha256":"7ff0fb7ac22d51c83ea8cef25e8da5e8b59916172e4d1ab4e6baa179a7a2b116"},"schema_version":"1.0","source":{"id":"1401.7538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7538","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7538v1","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7538","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"QYX3YCFWYQON","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QYX3YCFWYQONIROI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QYX3YCFW","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:1ac4ccbc54c63e09468daf8eb911f8920c73a42fe9d32e40c06aded864d7158e","target":"graph","created_at":"2026-05-18T03:00:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ang\\'elique Dr\\'emeau, C\\'edric Herzet","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T15:24:50Z","title":"Bayesian Pursuit Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7538","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8b9fa9700cf6665bb692ea71d9589bacb55a0cd024e6a945ae837c0a2130f7c3","target":"record","created_at":"2026-05-18T03:00:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a8cf8097a2ef9893199b0a046b7134184dc318f419ffe9b519e2374254e917c4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-29T15:24:50Z","title_canon_sha256":"7ff0fb7ac22d51c83ea8cef25e8da5e8b59916172e4d1ab4e6baa179a7a2b116"},"schema_version":"1.0","source":{"id":"1401.7538","kind":"arxiv","version":1}},"canonical_sha256":"862fbc08b6c41cd445c8f4724ccfac228d3278dc252c26e43a1a89999e771523","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"862fbc08b6c41cd445c8f4724ccfac228d3278dc252c26e43a1a89999e771523","first_computed_at":"2026-05-18T03:00:48.013087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:48.013087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9CwccSFouP/lGbscPBkcoeCh46a6CkD6Im9dATrITLDUIci703gKonBdoTXc2GTVALGJ3srBBuCAjozjo1BfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:48.013726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b9fa9700cf6665bb692ea71d9589bacb55a0cd024e6a945ae837c0a2130f7c3","sha256:1ac4ccbc54c63e09468daf8eb911f8920c73a42fe9d32e40c06aded864d7158e"],"state_sha256":"b4c28e38f85dc94c3d16bbc9ec7e4750e49f1c4990031a6cf7948caa7b3ff0ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EczUCuUIWRXLLPjtp+G/QfHrjXCZM6jIxeiuEBebZy3rCRZxZfzs5cxkh0Rnw1llqkPY+dmU39IwBCsr3pjbBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:19:17.033108Z","bundle_sha256":"6d791338b96ea55864180b744ba4e9ca113b622ebe420e506d320da3d1b5e7cc"}}