{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:45R7HITOEIIZTRXUG7EGEQJN37","short_pith_number":"pith:45R7HITO","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"},"canonical_sha256":"e763f3a26e221199c6f437c862412ddfeacf4a61e7a8bf4771ec2bcbdf2abdd7","source":{"kind":"arxiv","id":"1103.2208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2208","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2208v1","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2208","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"pith_short_12","alias_value":"45R7HITOEIIZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"45R7HITOEIIZTRXU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"45R7HITO","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:45R7HITOEIIZTRXUG7EGEQJN37","target":"record","payload":{"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"},"canonical_sha256":"e763f3a26e221199c6f437c862412ddfeacf4a61e7a8bf4771ec2bcbdf2abdd7","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"},"source_kind":"arxiv","source_id":"1103.2208","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-18T04:26:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gldQ57VUAxdxqaHknJLz5Y78y07Y762gSSrLqRW9QSY+qpjstkOcZLSvyIdMBHFYK2WSC5sFFgxV6g6wmg2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:00:48.411455Z"},"content_sha256":"870240e774286545064dc4a4b920cdb8b994e436874e4ff2489bb2bff00fb016","schema_version":"1.0","event_id":"sha256:870240e774286545064dc4a4b920cdb8b994e436874e4ff2489bb2bff00fb016"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:45R7HITOEIIZTRXUG7EGEQJN37","target":"graph","payload":{"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"},"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-18T04:26:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfqOHzDzTkPK7mefRp/6HbGj0XQuRJIyAVXUVSOP6Wpc887TY63rQpOEP9JZNklyJ/IToEYdfXzPmAxa7O3yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:00:48.411799Z"},"content_sha256":"5b16ac8ed1a2e953fc2d6f9a4173056b68b8c1c29ea48297d62ac35d2fde04b8","schema_version":"1.0","event_id":"sha256:5b16ac8ed1a2e953fc2d6f9a4173056b68b8c1c29ea48297d62ac35d2fde04b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/bundle.json","state_url":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45R7HITOEIIZTRXUG7EGEQJN37/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-07-04T11:00:48Z","links":{"resolver":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37","bundle":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/bundle.json","state":"https://pith.science/pith/45R7HITOEIIZTRXUG7EGEQJN37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45R7HITOEIIZTRXUG7EGEQJN37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:45R7HITOEIIZTRXUG7EGEQJN37","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":"5238b7badb69b74c8e041b1fc411ed2f5cb7be7c2770790b6abd226f7ec762c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-03-11T08:06:20Z","title_canon_sha256":"0d023f457f68409c20bb9bd945191172b4798e1ffdc9487c8c203a7f309ce01a"},"schema_version":"1.0","source":{"id":"1103.2208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2208","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2208v1","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2208","created_at":"2026-05-18T04:26:55Z"},{"alias_kind":"pith_short_12","alias_value":"45R7HITOEIIZ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"45R7HITOEIIZTRXU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"45R7HITO","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:5b16ac8ed1a2e953fc2d6f9a4173056b68b8c1c29ea48297d62ac35d2fde04b8","target":"graph","created_at":"2026-05-18T04:26:55Z","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":"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","authors_text":"Fran\\c{c}ois-Xavier Dup\\'e (DSM), Jalal Fadili (GREYC), Jean-Luc Starck (DSM)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-03-11T08:06:20Z","title":"Linear inverse problems with noise: primal and primal-dual splitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2208","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:870240e774286545064dc4a4b920cdb8b994e436874e4ff2489bb2bff00fb016","target":"record","created_at":"2026-05-18T04:26:55Z","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":"5238b7badb69b74c8e041b1fc411ed2f5cb7be7c2770790b6abd226f7ec762c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-03-11T08:06:20Z","title_canon_sha256":"0d023f457f68409c20bb9bd945191172b4798e1ffdc9487c8c203a7f309ce01a"},"schema_version":"1.0","source":{"id":"1103.2208","kind":"arxiv","version":1}},"canonical_sha256":"e763f3a26e221199c6f437c862412ddfeacf4a61e7a8bf4771ec2bcbdf2abdd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e763f3a26e221199c6f437c862412ddfeacf4a61e7a8bf4771ec2bcbdf2abdd7","first_computed_at":"2026-05-18T04:26:55.984830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:55.984830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h5V/5HYRxisQPgBwaZsp2e5SUqA4QJ7UAs9F1Hx4mgxy0xLU6f47AwrlqLA+BzhihBGGPntJK+BarPEtus+bBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:55.985235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:870240e774286545064dc4a4b920cdb8b994e436874e4ff2489bb2bff00fb016","sha256:5b16ac8ed1a2e953fc2d6f9a4173056b68b8c1c29ea48297d62ac35d2fde04b8"],"state_sha256":"8f10fe2c029e85bb0b90fa5369afbe140d8f6c2db9110a2d7c82136442cbc095"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMfQ8AxvNwidK5q1K/yvaOZENU5R12QV7cImDwpEQOhHjX4jNOCvtlQuuTxpqm4HAcoyFuVOongkbvKnoKemCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:00:48.413716Z","bundle_sha256":"4df2005b874b0718d42b7132ecb3aabbb06b44868038468bc960df6b7da70239"}}