{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QIG6SM76SNJTG26L6NVEM7FZUS","short_pith_number":"pith:QIG6SM76","canonical_record":{"source":{"id":"0904.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-04-09T12:58:52Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"cc96abc669823433cb4981f66302e530d0df20f7993d73cd9e94446f049a3514","abstract_canon_sha256":"22dc64f3a7be742c409d3747b4b51bd6df1b1cc9aa83e4f275637f87c6354e49"},"schema_version":"1.0"},"canonical_sha256":"820de933fe9353336bcbf36a467cb9a4b92037b9d9c313d633b0e5febdfeef63","source":{"kind":"arxiv","id":"0904.1523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.1523","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"arxiv_version","alias_value":"0904.1523v1","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.1523","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"pith_short_12","alias_value":"QIG6SM76SNJT","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QIG6SM76SNJTG26L","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QIG6SM76","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QIG6SM76SNJTG26L6NVEM7FZUS","target":"record","payload":{"canonical_record":{"source":{"id":"0904.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-04-09T12:58:52Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"cc96abc669823433cb4981f66302e530d0df20f7993d73cd9e94446f049a3514","abstract_canon_sha256":"22dc64f3a7be742c409d3747b4b51bd6df1b1cc9aa83e4f275637f87c6354e49"},"schema_version":"1.0"},"canonical_sha256":"820de933fe9353336bcbf36a467cb9a4b92037b9d9c313d633b0e5febdfeef63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:50.915877Z","signature_b64":"5HWamVq98SY8W7sq5dOzb/lC846JKXGXuFXIKE1KiMR1sBtA+V5E59ROPiLLKZkhqZWfDxnMfNVy2xo1spItCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820de933fe9353336bcbf36a467cb9a4b92037b9d9c313d633b0e5febdfeef63","last_reissued_at":"2026-05-18T04:38:50.915442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:50.915442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.1523","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:38:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kN6ELyJd+to0JtvnJ2HVt9tcxjamCOlUl9Xa3MkV8Rmkm/7BriKSn0iRBdso7sMc47wFCEsjN22o8WAzUTXQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:56:43.561562Z"},"content_sha256":"f30124df986d420934e685aa42f17f00f0415a540eae63a0b65d111e1dbd2381","schema_version":"1.0","event_id":"sha256:f30124df986d420934e685aa42f17f00f0415a540eae63a0b65d111e1dbd2381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QIG6SM76SNJTG26L6NVEM7FZUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A projection proximal-point algorithm for l^1-minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.NA","authors_text":"Dirk A. Lorenz","submitted_at":"2009-04-09T12:58:52Z","abstract_excerpt":"The problem of the minimization of least squares functionals with $\\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are only a few of them which come with a proper convergence analysis in the infinite dimensional setting. In this work we provide an algorithm from a class which have not been considered for $\\ell^1$ minimization before, namely a proximal-point method in combination with a projection step. We show that this idea gives a simple and easy to implement algorithm. We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.1523","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:38:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NH5LrIr/8vK8hnrd04SNwvK6PVUNJdcASAvuSOsetJjpdxtlTUzudFh62XW+W+Sd9iiFq/EXq0o2oHg6/UQsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:56:43.561942Z"},"content_sha256":"e8599ebd6600519d15a3fe5627211e0ef388f4a8917df8cead2b95aab1fd29ac","schema_version":"1.0","event_id":"sha256:e8599ebd6600519d15a3fe5627211e0ef388f4a8917df8cead2b95aab1fd29ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/bundle.json","state_url":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIG6SM76SNJTG26L6NVEM7FZUS/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-05-20T09:56:43Z","links":{"resolver":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS","bundle":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/bundle.json","state":"https://pith.science/pith/QIG6SM76SNJTG26L6NVEM7FZUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIG6SM76SNJTG26L6NVEM7FZUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QIG6SM76SNJTG26L6NVEM7FZUS","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":"22dc64f3a7be742c409d3747b4b51bd6df1b1cc9aa83e4f275637f87c6354e49","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-04-09T12:58:52Z","title_canon_sha256":"cc96abc669823433cb4981f66302e530d0df20f7993d73cd9e94446f049a3514"},"schema_version":"1.0","source":{"id":"0904.1523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.1523","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"arxiv_version","alias_value":"0904.1523v1","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.1523","created_at":"2026-05-18T04:38:50Z"},{"alias_kind":"pith_short_12","alias_value":"QIG6SM76SNJT","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QIG6SM76SNJTG26L","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QIG6SM76","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:e8599ebd6600519d15a3fe5627211e0ef388f4a8917df8cead2b95aab1fd29ac","target":"graph","created_at":"2026-05-18T04:38:50Z","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":"The problem of the minimization of least squares functionals with $\\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are only a few of them which come with a proper convergence analysis in the infinite dimensional setting. In this work we provide an algorithm from a class which have not been considered for $\\ell^1$ minimization before, namely a proximal-point method in combination with a projection step. We show that this idea gives a simple and easy to implement algorithm. We p","authors_text":"Dirk A. Lorenz","cross_cats":["math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-04-09T12:58:52Z","title":"A projection proximal-point algorithm for l^1-minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.1523","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:f30124df986d420934e685aa42f17f00f0415a540eae63a0b65d111e1dbd2381","target":"record","created_at":"2026-05-18T04:38:50Z","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":"22dc64f3a7be742c409d3747b4b51bd6df1b1cc9aa83e4f275637f87c6354e49","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-04-09T12:58:52Z","title_canon_sha256":"cc96abc669823433cb4981f66302e530d0df20f7993d73cd9e94446f049a3514"},"schema_version":"1.0","source":{"id":"0904.1523","kind":"arxiv","version":1}},"canonical_sha256":"820de933fe9353336bcbf36a467cb9a4b92037b9d9c313d633b0e5febdfeef63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"820de933fe9353336bcbf36a467cb9a4b92037b9d9c313d633b0e5febdfeef63","first_computed_at":"2026-05-18T04:38:50.915442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:50.915442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5HWamVq98SY8W7sq5dOzb/lC846JKXGXuFXIKE1KiMR1sBtA+V5E59ROPiLLKZkhqZWfDxnMfNVy2xo1spItCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:50.915877Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.1523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f30124df986d420934e685aa42f17f00f0415a540eae63a0b65d111e1dbd2381","sha256:e8599ebd6600519d15a3fe5627211e0ef388f4a8917df8cead2b95aab1fd29ac"],"state_sha256":"48fb915a32f812a5674b9ac977f6143110ec50440f062e4a1546619c175dc464"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mYY8UooCO8h7nbTSgBgfNfD+gGjzE5AU1ytM3NpzzysMJtVCVzr3FAz2zOVmndLed0fqBw8P/lgxNPqvBZ3oAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:56:43.563968Z","bundle_sha256":"68726af27c832834bb18e8540cb1da48f1e8d7736989ef63fafd4f238c3564f5"}}