{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UAEA2X2R75ZAW5CQ5DG7WXGA4U","short_pith_number":"pith:UAEA2X2R","schema_version":"1.0","canonical_sha256":"a0080d5f51ff720b7450e8cdfb5cc0e52fda4914d3d0e7a68a65b1c09a41c93c","source":{"kind":"arxiv","id":"1104.0262","version":1},"attestation_state":"computed","paper":{"title":"Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Bin Dong, Stanley Osher, Wotao Yin, Yu Mao","submitted_at":"2011-04-01T21:09:19Z","abstract_excerpt":"We propose and analyze an extremely fast, efficient, and simple method for solving the problem:min{parallel to u parallel to(1) : Au = f, u is an element of R-n}.This method was first described in [J. Darbon and S. Osher, preprint, 2007], with more details in [W. Yin, S. Osher, D. Goldfarb and J. Darbon, SIAM J. Imaging Sciences, 1(1), 143-168, 2008] and rigorous theory given in [J. Cai, S. Osher and Z. Shen, Math. Comp., to appear, 2008, see also UCLA CAM Report 08-06] and [J. Cai, S. Osher and Z. Shen, UCLA CAM Report, 08-52, 2008]. The motivation was compressive sensing, which now has a vas"},"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":"1104.0262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-01T21:09:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"41ed18076d9fa6cd8cd02fc73e90e4e78e93b4c1d5f396dd32b43a47b8c64713","abstract_canon_sha256":"cbb51f59c0988598f9c30e55b3f403e7a2da74750888835ba3a274443bd597ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:04.347083Z","signature_b64":"CdsuHiQZIU6jFur6w7sL2RWIGz2FWPXTkojfVCTy01z5N91Z1VZnzwAHLGDFKdqQY7FPJ1A/Bgu3AChHk30FBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0080d5f51ff720b7450e8cdfb5cc0e52fda4914d3d0e7a68a65b1c09a41c93c","last_reissued_at":"2026-05-18T04:25:04.346583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:04.346583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Bin Dong, Stanley Osher, Wotao Yin, Yu Mao","submitted_at":"2011-04-01T21:09:19Z","abstract_excerpt":"We propose and analyze an extremely fast, efficient, and simple method for solving the problem:min{parallel to u parallel to(1) : Au = f, u is an element of R-n}.This method was first described in [J. Darbon and S. Osher, preprint, 2007], with more details in [W. Yin, S. Osher, D. Goldfarb and J. Darbon, SIAM J. Imaging Sciences, 1(1), 143-168, 2008] and rigorous theory given in [J. Cai, S. Osher and Z. Shen, Math. Comp., to appear, 2008, see also UCLA CAM Report 08-06] and [J. Cai, S. Osher and Z. Shen, UCLA CAM Report, 08-52, 2008]. The motivation was compressive sensing, which now has a vas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0262","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":"1104.0262","created_at":"2026-05-18T04:25:04.346656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0262v1","created_at":"2026-05-18T04:25:04.346656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0262","created_at":"2026-05-18T04:25:04.346656+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAEA2X2R75ZA","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAEA2X2R75ZAW5CQ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAEA2X2R","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00723","citing_title":"A greedy algorithm for sparse precision matrix approximation","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U","json":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U.json","graph_json":"https://pith.science/api/pith-number/UAEA2X2R75ZAW5CQ5DG7WXGA4U/graph.json","events_json":"https://pith.science/api/pith-number/UAEA2X2R75ZAW5CQ5DG7WXGA4U/events.json","paper":"https://pith.science/paper/UAEA2X2R"},"agent_actions":{"view_html":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U","download_json":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U.json","view_paper":"https://pith.science/paper/UAEA2X2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0262&json=true","fetch_graph":"https://pith.science/api/pith-number/UAEA2X2R75ZAW5CQ5DG7WXGA4U/graph.json","fetch_events":"https://pith.science/api/pith-number/UAEA2X2R75ZAW5CQ5DG7WXGA4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U/action/storage_attestation","attest_author":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U/action/author_attestation","sign_citation":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U/action/citation_signature","submit_replication":"https://pith.science/pith/UAEA2X2R75ZAW5CQ5DG7WXGA4U/action/replication_record"}},"created_at":"2026-05-18T04:25:04.346656+00:00","updated_at":"2026-05-18T04:25:04.346656+00:00"}