{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AJAALQ4J72PZDRFV5PQ6LFTB2L","short_pith_number":"pith:AJAALQ4J","schema_version":"1.0","canonical_sha256":"024005c389fe9f91c4b5ebe1e59661d2fb5a54b334d68f902ca3f141351fca1a","source":{"kind":"arxiv","id":"1309.2094","version":2},"attestation_state":"computed","paper":{"title":"The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Dirk A. Lorenz, Frank Sch\\\"opfer, Stephan Wenger","submitted_at":"2013-09-09T10:04:34Z","abstract_excerpt":"The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a split feasibility problem, propose an algorithmic framework based on Bregman projections and prove a general convergence result for this framework. Convergence of the linearized Bregman method will be obtained as a special case. Our approach also allows for several generalizations such as other objective functions, incremental iterations, incorporation of non-gaussian noise models or box constraints."},"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":"1309.2094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-09T10:04:34Z","cross_cats_sorted":["cs.CV","cs.NA","math.NA"],"title_canon_sha256":"456c89fb62f3e6e230b824ae2f059318b7bbb0b2cf7536f4a7fc1f24e0fbe030","abstract_canon_sha256":"99e46f144779be6b93b6adf7afeb2c2a220b07cdef0e412dc5d94a3805614cc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:45.202539Z","signature_b64":"d6m6x8M52SSwjAHN/6xH+nAiQh5Y4s3E0MEdsFmZHYaYp2qma4qJBbH7w5lffBw9hHknUVBjf3TaZKSUqAq7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"024005c389fe9f91c4b5ebe1e59661d2fb5a54b334d68f902ca3f141351fca1a","last_reissued_at":"2026-05-18T03:13:45.201898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:45.201898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Dirk A. Lorenz, Frank Sch\\\"opfer, Stephan Wenger","submitted_at":"2013-09-09T10:04:34Z","abstract_excerpt":"The linearized Bregman method is a method to calculate sparse solutions to systems of linear equations. We formulate this problem as a split feasibility problem, propose an algorithmic framework based on Bregman projections and prove a general convergence result for this framework. Convergence of the linearized Bregman method will be obtained as a special case. Our approach also allows for several generalizations such as other objective functions, incremental iterations, incorporation of non-gaussian noise models or box constraints."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2094","kind":"arxiv","version":2},"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":"1309.2094","created_at":"2026-05-18T03:13:45.202002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.2094v2","created_at":"2026-05-18T03:13:45.202002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2094","created_at":"2026-05-18T03:13:45.202002+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJAALQ4J72PZ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJAALQ4J72PZDRFV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJAALQ4J","created_at":"2026-05-18T12:27:38.830355+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/AJAALQ4J72PZDRFV5PQ6LFTB2L","json":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L.json","graph_json":"https://pith.science/api/pith-number/AJAALQ4J72PZDRFV5PQ6LFTB2L/graph.json","events_json":"https://pith.science/api/pith-number/AJAALQ4J72PZDRFV5PQ6LFTB2L/events.json","paper":"https://pith.science/paper/AJAALQ4J"},"agent_actions":{"view_html":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L","download_json":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L.json","view_paper":"https://pith.science/paper/AJAALQ4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.2094&json=true","fetch_graph":"https://pith.science/api/pith-number/AJAALQ4J72PZDRFV5PQ6LFTB2L/graph.json","fetch_events":"https://pith.science/api/pith-number/AJAALQ4J72PZDRFV5PQ6LFTB2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L/action/storage_attestation","attest_author":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L/action/author_attestation","sign_citation":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L/action/citation_signature","submit_replication":"https://pith.science/pith/AJAALQ4J72PZDRFV5PQ6LFTB2L/action/replication_record"}},"created_at":"2026-05-18T03:13:45.202002+00:00","updated_at":"2026-05-18T03:13:45.202002+00:00"}