{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:45R7HITOEIIZTRXUG7EGEQJN37","short_pith_number":"pith:45R7HITO","schema_version":"1.0","canonical_sha256":"e763f3a26e221199c6f437c862412ddfeacf4a61e7a8bf4771ec2bcbdf2abdd7","source":{"kind":"arxiv","id":"1103.2208","version":1},"attestation_state":"computed","paper":{"title":"Linear inverse problems with noise: primal and primal-dual splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Fran\\c{c}ois-Xavier Dup\\'e (DSM), Jalal Fadili (GREYC), Jean-Luc Starck (DSM)","submitted_at":"2011-03-11T08:06:20Z","abstract_excerpt":"In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by noise. A proper data fidelity term (log-likelihood) is introduced to reflect the statistics of the noise (e.g. Gaussian, Poisson). On the other hand, as a prior, the images to restore are assumed to be positive and sparsely represented in a dictionary of waveforms. Piecing together the data fidelity and the prior terms, the solution to the inverse problem is cast as the minimization of a non-smooth convex functional. We establish the well-posedness of the optimization problem, ch"},"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":"1103.2208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-03-11T08:06:20Z","cross_cats_sorted":[],"title_canon_sha256":"0d023f457f68409c20bb9bd945191172b4798e1ffdc9487c8c203a7f309ce01a","abstract_canon_sha256":"5238b7badb69b74c8e041b1fc411ed2f5cb7be7c2770790b6abd226f7ec762c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:55.985235Z","signature_b64":"h5V/5HYRxisQPgBwaZsp2e5SUqA4QJ7UAs9F1Hx4mgxy0xLU6f47AwrlqLA+BzhihBGGPntJK+BarPEtus+bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e763f3a26e221199c6f437c862412ddfeacf4a61e7a8bf4771ec2bcbdf2abdd7","last_reissued_at":"2026-05-18T04:26:55.984830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:55.984830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear inverse problems with noise: primal and primal-dual splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Fran\\c{c}ois-Xavier Dup\\'e (DSM), Jalal Fadili (GREYC), Jean-Luc Starck (DSM)","submitted_at":"2011-03-11T08:06:20Z","abstract_excerpt":"In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by noise. A proper data fidelity term (log-likelihood) is introduced to reflect the statistics of the noise (e.g. Gaussian, Poisson). On the other hand, as a prior, the images to restore are assumed to be positive and sparsely represented in a dictionary of waveforms. Piecing together the data fidelity and the prior terms, the solution to the inverse problem is cast as the minimization of a non-smooth convex functional. We establish the well-posedness of the optimization problem, ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2208","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":"1103.2208","created_at":"2026-05-18T04:26:55.984888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2208v1","created_at":"2026-05-18T04:26:55.984888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2208","created_at":"2026-05-18T04:26:55.984888+00:00"},{"alias_kind":"pith_short_12","alias_value":"45R7HITOEIIZ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"45R7HITOEIIZTRXU","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"45R7HITO","created_at":"2026-05-18T12:26:20.644004+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/45R7HITOEIIZTRXUG7EGEQJN37","json":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37.json","graph_json":"https://pith.science/api/pith-number/45R7HITOEIIZTRXUG7EGEQJN37/graph.json","events_json":"https://pith.science/api/pith-number/45R7HITOEIIZTRXUG7EGEQJN37/events.json","paper":"https://pith.science/paper/45R7HITO"},"agent_actions":{"view_html":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37","download_json":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37.json","view_paper":"https://pith.science/paper/45R7HITO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2208&json=true","fetch_graph":"https://pith.science/api/pith-number/45R7HITOEIIZTRXUG7EGEQJN37/graph.json","fetch_events":"https://pith.science/api/pith-number/45R7HITOEIIZTRXUG7EGEQJN37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/action/storage_attestation","attest_author":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/action/author_attestation","sign_citation":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/action/citation_signature","submit_replication":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/action/replication_record"}},"created_at":"2026-05-18T04:26:55.984888+00:00","updated_at":"2026-05-18T04:26:55.984888+00:00"}