{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CVZPHDT7SXS74NVKHUNSF73HNH","short_pith_number":"pith:CVZPHDT7","schema_version":"1.0","canonical_sha256":"1572f38e7f95e5fe36aa3d1b22ff6769c652f3f3981398c9dd6b0e7162b21800","source":{"kind":"arxiv","id":"1403.6718","version":1},"attestation_state":"computed","paper":{"title":"Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Steffen Peter, Valeriya Naumova","submitted_at":"2014-03-26T15:44:35Z","abstract_excerpt":"Inspired by several recent developments in regularization theory, optimization, and signal processing, we present and analyze a numerical approach to multi-penalty regularization in spaces of sparsely represented functions. The sparsity prior is motivated by the largely expected geometrical/structured features of high-dimensional data, which may not be well-represented in the framework of typically more isotropic Hilbert spaces. In this paper, we are particularly interested in regularizers which are able to correctly model and separate the multiple components of additively mixed signals. This "},"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":"1403.6718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-03-26T15:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"a5df46d0bf1f29671bfed88c54a17f5b91ecc54fd861c8fbad9d4e6caa284eb5","abstract_canon_sha256":"551207175fcc4db6c4e3d429c9fcb69fa731bbe06d16b28c8d25b796e4e67a61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:55.295193Z","signature_b64":"++BoB8E3ATbHi8JShCxKEww4urVWzuIjJG6FniqHA2cc7fggDKBgpvTs4BSlSNO8GRizZNlE3TChZ0xbCoPDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1572f38e7f95e5fe36aa3d1b22ff6769c652f3f3981398c9dd6b0e7162b21800","last_reissued_at":"2026-05-18T02:32:55.294766Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:55.294766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Steffen Peter, Valeriya Naumova","submitted_at":"2014-03-26T15:44:35Z","abstract_excerpt":"Inspired by several recent developments in regularization theory, optimization, and signal processing, we present and analyze a numerical approach to multi-penalty regularization in spaces of sparsely represented functions. The sparsity prior is motivated by the largely expected geometrical/structured features of high-dimensional data, which may not be well-represented in the framework of typically more isotropic Hilbert spaces. In this paper, we are particularly interested in regularizers which are able to correctly model and separate the multiple components of additively mixed signals. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6718","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":"1403.6718","created_at":"2026-05-18T02:32:55.294824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6718v1","created_at":"2026-05-18T02:32:55.294824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6718","created_at":"2026-05-18T02:32:55.294824+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVZPHDT7SXS7","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVZPHDT7SXS74NVK","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVZPHDT7","created_at":"2026-05-18T12:28:25.294606+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/CVZPHDT7SXS74NVKHUNSF73HNH","json":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH.json","graph_json":"https://pith.science/api/pith-number/CVZPHDT7SXS74NVKHUNSF73HNH/graph.json","events_json":"https://pith.science/api/pith-number/CVZPHDT7SXS74NVKHUNSF73HNH/events.json","paper":"https://pith.science/paper/CVZPHDT7"},"agent_actions":{"view_html":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH","download_json":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH.json","view_paper":"https://pith.science/paper/CVZPHDT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6718&json=true","fetch_graph":"https://pith.science/api/pith-number/CVZPHDT7SXS74NVKHUNSF73HNH/graph.json","fetch_events":"https://pith.science/api/pith-number/CVZPHDT7SXS74NVKHUNSF73HNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH/action/storage_attestation","attest_author":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH/action/author_attestation","sign_citation":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH/action/citation_signature","submit_replication":"https://pith.science/pith/CVZPHDT7SXS74NVKHUNSF73HNH/action/replication_record"}},"created_at":"2026-05-18T02:32:55.294824+00:00","updated_at":"2026-05-18T02:32:55.294824+00:00"}