{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WLI4VABODOXYP5IGKNOLJEELOQ","short_pith_number":"pith:WLI4VABO","schema_version":"1.0","canonical_sha256":"b2d1ca802e1baf87f506535cb4908b740127a1b1e99848575c40811149a1a351","source":{"kind":"arxiv","id":"2304.10536","version":1},"attestation_state":"computed","paper":{"title":"Learning Sparse and Low-Rank Priors for Image Recovery via Iterative Reweighted Least Squares Minimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Iaroslav Koshelev, Stamatios Lefkimmiatis","submitted_at":"2023-04-20T17:59:45Z","abstract_excerpt":"We introduce a novel optimization algorithm for image recovery under learned sparse and low-rank constraints, which we parameterize as weighted extensions of the $\\ell_p^p$-vector and $\\mathcal S_p^p$ Schatten-matrix quasi-norms for $0\\!<p\\!\\le1$, respectively. Our proposed algorithm generalizes the Iteratively Reweighted Least Squares (IRLS) method, used for signal recovery under $\\ell_1$ and nuclear-norm constrained minimization. Further, we interpret our overall minimization approach as a recurrent network that we then employ to deal with inverse low-level computer vision problems. Thanks 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":"2304.10536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2023-04-20T17:59:45Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"acccf26c12c04ab23206b1095e98fa5d7ee9a89a6e8e47d33ff3435e162c782d","abstract_canon_sha256":"b539c595c54facd7abb1edc38bcbf325a1b5275b619392cf11e8b1fbe4fd4046"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:59.470033Z","signature_b64":"G5f8CMvuclT/BG94KTrsdAcCeL93X7D+rQM/aCcdRB+cOSgdghrk5rDKOAe+NvqmKc7qbJODQZJlUtKm8ndEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2d1ca802e1baf87f506535cb4908b740127a1b1e99848575c40811149a1a351","last_reissued_at":"2026-07-05T06:02:59.469658Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:59.469658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparse and Low-Rank Priors for Image Recovery via Iterative Reweighted Least Squares Minimization","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Iaroslav Koshelev, Stamatios Lefkimmiatis","submitted_at":"2023-04-20T17:59:45Z","abstract_excerpt":"We introduce a novel optimization algorithm for image recovery under learned sparse and low-rank constraints, which we parameterize as weighted extensions of the $\\ell_p^p$-vector and $\\mathcal S_p^p$ Schatten-matrix quasi-norms for $0\\!<p\\!\\le1$, respectively. Our proposed algorithm generalizes the Iteratively Reweighted Least Squares (IRLS) method, used for signal recovery under $\\ell_1$ and nuclear-norm constrained minimization. Further, we interpret our overall minimization approach as a recurrent network that we then employ to deal with inverse low-level computer vision problems. Thanks t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.10536","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/2304.10536/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":"2304.10536","created_at":"2026-07-05T06:02:59.469712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.10536v1","created_at":"2026-07-05T06:02:59.469712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.10536","created_at":"2026-07-05T06:02:59.469712+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLI4VABODOXY","created_at":"2026-07-05T06:02:59.469712+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLI4VABODOXYP5IG","created_at":"2026-07-05T06:02:59.469712+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLI4VABO","created_at":"2026-07-05T06:02:59.469712+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06828","citing_title":"Speckle2Self: Self-Supervised Ultrasound Speckle Reduction Without Clean Data","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ","json":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ.json","graph_json":"https://pith.science/api/pith-number/WLI4VABODOXYP5IGKNOLJEELOQ/graph.json","events_json":"https://pith.science/api/pith-number/WLI4VABODOXYP5IGKNOLJEELOQ/events.json","paper":"https://pith.science/paper/WLI4VABO"},"agent_actions":{"view_html":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ","download_json":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ.json","view_paper":"https://pith.science/paper/WLI4VABO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.10536&json=true","fetch_graph":"https://pith.science/api/pith-number/WLI4VABODOXYP5IGKNOLJEELOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WLI4VABODOXYP5IGKNOLJEELOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ/action/storage_attestation","attest_author":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ/action/author_attestation","sign_citation":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ/action/citation_signature","submit_replication":"https://pith.science/pith/WLI4VABODOXYP5IGKNOLJEELOQ/action/replication_record"}},"created_at":"2026-07-05T06:02:59.469712+00:00","updated_at":"2026-07-05T06:02:59.469712+00:00"}