{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MATEUNMI5X5XDELNNESICLZLRT","short_pith_number":"pith:MATEUNMI","schema_version":"1.0","canonical_sha256":"60264a3588edfb71916d6924812f2b8cc57b41232a9793e2d58f86b565eea806","source":{"kind":"arxiv","id":"1103.2209","version":1},"attestation_state":"computed","paper":{"title":"Inverse Problems with Poisson 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:56Z","abstract_excerpt":"In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by Poisson noise. A proper data fidelity term (log-likelihood) is introduced to reflect the Poisson statistics of the noise. 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, characteriz"},"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.2209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-03-11T08:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"7e5f93ce26564de4c433dadab64578e9790ef42eed7b19351388a27c4104123c","abstract_canon_sha256":"cc30c494ba14e8c8557bb9dd8dfe7c97305cad59e730b828d77e74ab5ca910ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:55.979799Z","signature_b64":"ElwIIOqDy1ogZtlybII4bq0hQDXy7KKOU3T+WDICkjlHRVG9KwToSwe4PlCQD4a9+k07GbrbZ1SuQ9VhceuyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60264a3588edfb71916d6924812f2b8cc57b41232a9793e2d58f86b565eea806","last_reissued_at":"2026-05-18T04:26:55.979389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:55.979389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverse Problems with Poisson 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:56Z","abstract_excerpt":"In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by Poisson noise. A proper data fidelity term (log-likelihood) is introduced to reflect the Poisson statistics of the noise. 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, characteriz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2209","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.2209","created_at":"2026-05-18T04:26:55.979446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2209v1","created_at":"2026-05-18T04:26:55.979446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2209","created_at":"2026-05-18T04:26:55.979446+00:00"},{"alias_kind":"pith_short_12","alias_value":"MATEUNMI5X5X","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MATEUNMI5X5XDELN","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MATEUNMI","created_at":"2026-05-18T12:26:34.985390+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/MATEUNMI5X5XDELNNESICLZLRT","json":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT.json","graph_json":"https://pith.science/api/pith-number/MATEUNMI5X5XDELNNESICLZLRT/graph.json","events_json":"https://pith.science/api/pith-number/MATEUNMI5X5XDELNNESICLZLRT/events.json","paper":"https://pith.science/paper/MATEUNMI"},"agent_actions":{"view_html":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT","download_json":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT.json","view_paper":"https://pith.science/paper/MATEUNMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2209&json=true","fetch_graph":"https://pith.science/api/pith-number/MATEUNMI5X5XDELNNESICLZLRT/graph.json","fetch_events":"https://pith.science/api/pith-number/MATEUNMI5X5XDELNNESICLZLRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT/action/storage_attestation","attest_author":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT/action/author_attestation","sign_citation":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT/action/citation_signature","submit_replication":"https://pith.science/pith/MATEUNMI5X5XDELNNESICLZLRT/action/replication_record"}},"created_at":"2026-05-18T04:26:55.979446+00:00","updated_at":"2026-05-18T04:26:55.979446+00:00"}