{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JFDMLVMRCIVWAA4JHDG5UDIRVP","short_pith_number":"pith:JFDMLVMR","schema_version":"1.0","canonical_sha256":"4946c5d591122b60038938cdda0d11abe3b7fce08d0ed9a272b6644b672dd637","source":{"kind":"arxiv","id":"1402.4371","version":1},"attestation_state":"computed","paper":{"title":"A convergence proof of the split Bregman method for regularized least-squares problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Hung Nien, Jeffrey A. Fessler","submitted_at":"2014-02-18T15:16:45Z","abstract_excerpt":"The split Bregman (SB) method [T. Goldstein and S. Osher, SIAM J. Imaging Sci., 2 (2009), pp. 323-43] is a fast splitting-based algorithm that solves image reconstruction problems with general l1, e.g., total-variation (TV) and compressed sensing (CS), regularizations by introducing a single variable split to decouple the data-fitting term and the regularization term, yielding simple subproblems that are separable (or partially separable) and easy to minimize. Several convergence proofs have been proposed, and these proofs either impose a \"full column rank\" assumption to the split or assume ex"},"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":"1402.4371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-02-18T15:16:45Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"761baa745944d1728fc2e0d2b26275d22893f27c19a78ae77db0bc7b865905e5","abstract_canon_sha256":"554298f9da4c654554eef7b04201149297e55899b5261338297c900be409f643"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:44.058824Z","signature_b64":"SNhbgOh4YsS4gnh6qWJHnj0ZYKY37r1fFO4Nd87l0BrF7IHKXAxXT5KELSytVqN7u8isyUTxkYNOGhhORAFCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4946c5d591122b60038938cdda0d11abe3b7fce08d0ed9a272b6644b672dd637","last_reissued_at":"2026-05-18T02:58:44.058286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:44.058286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A convergence proof of the split Bregman method for regularized least-squares problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Hung Nien, Jeffrey A. Fessler","submitted_at":"2014-02-18T15:16:45Z","abstract_excerpt":"The split Bregman (SB) method [T. Goldstein and S. Osher, SIAM J. Imaging Sci., 2 (2009), pp. 323-43] is a fast splitting-based algorithm that solves image reconstruction problems with general l1, e.g., total-variation (TV) and compressed sensing (CS), regularizations by introducing a single variable split to decouple the data-fitting term and the regularization term, yielding simple subproblems that are separable (or partially separable) and easy to minimize. Several convergence proofs have been proposed, and these proofs either impose a \"full column rank\" assumption to the split or assume ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4371","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":"1402.4371","created_at":"2026-05-18T02:58:44.058373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4371v1","created_at":"2026-05-18T02:58:44.058373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4371","created_at":"2026-05-18T02:58:44.058373+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFDMLVMRCIVW","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFDMLVMRCIVWAA4J","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFDMLVMR","created_at":"2026-05-18T12:28:33.132498+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/JFDMLVMRCIVWAA4JHDG5UDIRVP","json":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP.json","graph_json":"https://pith.science/api/pith-number/JFDMLVMRCIVWAA4JHDG5UDIRVP/graph.json","events_json":"https://pith.science/api/pith-number/JFDMLVMRCIVWAA4JHDG5UDIRVP/events.json","paper":"https://pith.science/paper/JFDMLVMR"},"agent_actions":{"view_html":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP","download_json":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP.json","view_paper":"https://pith.science/paper/JFDMLVMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4371&json=true","fetch_graph":"https://pith.science/api/pith-number/JFDMLVMRCIVWAA4JHDG5UDIRVP/graph.json","fetch_events":"https://pith.science/api/pith-number/JFDMLVMRCIVWAA4JHDG5UDIRVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP/action/storage_attestation","attest_author":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP/action/author_attestation","sign_citation":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP/action/citation_signature","submit_replication":"https://pith.science/pith/JFDMLVMRCIVWAA4JHDG5UDIRVP/action/replication_record"}},"created_at":"2026-05-18T02:58:44.058373+00:00","updated_at":"2026-05-18T02:58:44.058373+00:00"}