{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OEWBZQMFZC3WK37MNSNEPYPCK3","short_pith_number":"pith:OEWBZQMF","schema_version":"1.0","canonical_sha256":"712c1cc185c8b7656fec6c9a47e1e256e16f3327bc068a9e0b494266d15de716","source":{"kind":"arxiv","id":"2202.02806","version":1},"attestation_state":"computed","paper":{"title":"Multi-component separation, inpainting and denoising with recovery guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Van Tiep Do","submitted_at":"2022-02-06T15:58:38Z","abstract_excerpt":"In image processing, problems of separation and reconstruction of missing pixels from incomplete digital images have been far more advanced in past decades. Many empirical results have produced very good results, however, providing a theoretical analysis for the success of algorithms is not an easy task, especially, for inpainting and separating multi-component signals. In this paper, we propose two main algorithms based on $l_1$ constrained and unconstrained minimization for separating $N$ distinct geometric components and simultaneously filling-in the missing part of the observed image. We t"},"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":"2202.02806","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.FA","submitted_at":"2022-02-06T15:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"300beebb9c65473fa407bb5d132007f4a6712240f5e7cfa2175e1c902457f23b","abstract_canon_sha256":"5a5666b30d5badd92167c3d0abbea3af904715193c06f44a3fa3f858c3fc92bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:33.130123Z","signature_b64":"PcMgifmrukMJ8ByJVKy+tJJGGe13O269bClAEDtIfN+rVGMZK3qHgLcL0vp0zTZ1hebtnUP9lDtk6keV9NKEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"712c1cc185c8b7656fec6c9a47e1e256e16f3327bc068a9e0b494266d15de716","last_reissued_at":"2026-07-05T03:54:33.129777Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:33.129777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-component separation, inpainting and denoising with recovery guarantees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.FA","authors_text":"Van Tiep Do","submitted_at":"2022-02-06T15:58:38Z","abstract_excerpt":"In image processing, problems of separation and reconstruction of missing pixels from incomplete digital images have been far more advanced in past decades. Many empirical results have produced very good results, however, providing a theoretical analysis for the success of algorithms is not an easy task, especially, for inpainting and separating multi-component signals. In this paper, we propose two main algorithms based on $l_1$ constrained and unconstrained minimization for separating $N$ distinct geometric components and simultaneously filling-in the missing part of the observed image. We t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02806","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.02806/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2202.02806","created_at":"2026-07-05T03:54:33.129833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.02806v1","created_at":"2026-07-05T03:54:33.129833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02806","created_at":"2026-07-05T03:54:33.129833+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEWBZQMFZC3W","created_at":"2026-07-05T03:54:33.129833+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEWBZQMFZC3WK37M","created_at":"2026-07-05T03:54:33.129833+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEWBZQMF","created_at":"2026-07-05T03:54:33.129833+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/OEWBZQMFZC3WK37MNSNEPYPCK3","json":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3.json","graph_json":"https://pith.science/api/pith-number/OEWBZQMFZC3WK37MNSNEPYPCK3/graph.json","events_json":"https://pith.science/api/pith-number/OEWBZQMFZC3WK37MNSNEPYPCK3/events.json","paper":"https://pith.science/paper/OEWBZQMF"},"agent_actions":{"view_html":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3","download_json":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3.json","view_paper":"https://pith.science/paper/OEWBZQMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.02806&json=true","fetch_graph":"https://pith.science/api/pith-number/OEWBZQMFZC3WK37MNSNEPYPCK3/graph.json","fetch_events":"https://pith.science/api/pith-number/OEWBZQMFZC3WK37MNSNEPYPCK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3/action/storage_attestation","attest_author":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3/action/author_attestation","sign_citation":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3/action/citation_signature","submit_replication":"https://pith.science/pith/OEWBZQMFZC3WK37MNSNEPYPCK3/action/replication_record"}},"created_at":"2026-07-05T03:54:33.129833+00:00","updated_at":"2026-07-05T03:54:33.129833+00:00"}