{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:64YT5C2KB3M7Y64ISHJDGFXMEV","short_pith_number":"pith:64YT5C2K","schema_version":"1.0","canonical_sha256":"f7313e8b4a0ed9fc7b8891d23316ec25760845c5d8ff53cc7f3f8ff422d9b0d5","source":{"kind":"arxiv","id":"1401.7413","version":2},"attestation_state":"computed","paper":{"title":"Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Shuicheng Yan, Zhouchen Lin","submitted_at":"2014-01-29T05:16:52Z","abstract_excerpt":"This work presents a general framework for solving the low rank and/or sparse matrix minimization problems, which may involve multiple non-smooth terms. The Iteratively Reweighted Least Squares (IRLS) method is a fast solver, which smooths the objective function and minimizes it by alternately updating the variables and their weights. However, the traditional IRLS can only solve a sparse only or low rank only minimization problem with squared loss or an affine constraint. This work generalizes IRLS to solve joint/mixed low rank and sparse minimization problems, which are essential formulations"},"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":"1401.7413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-29T05:16:52Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"bfb0c3b7dd294ed6ea068c093df5a5d3b85bcbffd27fff85d914e1359487455d","abstract_canon_sha256":"4e1862b52db81d35148b4a88e3faf18798a11f2f2b3b348e3614295657df684a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:45:11.369828Z","signature_b64":"lR5LsBfHZyFIjWJGs16cNrDavP7Utjn4cvIMulW3/bfGN1Ue6BOgLCMiMwlapUTxq62lBjkoOPLOQnKP6ntEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7313e8b4a0ed9fc7b8891d23316ec25760845c5d8ff53cc7f3f8ff422d9b0d5","last_reissued_at":"2026-05-18T01:45:11.369067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:45:11.369067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Shuicheng Yan, Zhouchen Lin","submitted_at":"2014-01-29T05:16:52Z","abstract_excerpt":"This work presents a general framework for solving the low rank and/or sparse matrix minimization problems, which may involve multiple non-smooth terms. The Iteratively Reweighted Least Squares (IRLS) method is a fast solver, which smooths the objective function and minimizes it by alternately updating the variables and their weights. However, the traditional IRLS can only solve a sparse only or low rank only minimization problem with squared loss or an affine constraint. This work generalizes IRLS to solve joint/mixed low rank and sparse minimization problems, which are essential formulations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7413","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":"1401.7413","created_at":"2026-05-18T01:45:11.369186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7413v2","created_at":"2026-05-18T01:45:11.369186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7413","created_at":"2026-05-18T01:45:11.369186+00:00"},{"alias_kind":"pith_short_12","alias_value":"64YT5C2KB3M7","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"64YT5C2KB3M7Y64I","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"64YT5C2K","created_at":"2026-05-18T12:28:16.859392+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/64YT5C2KB3M7Y64ISHJDGFXMEV","json":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV.json","graph_json":"https://pith.science/api/pith-number/64YT5C2KB3M7Y64ISHJDGFXMEV/graph.json","events_json":"https://pith.science/api/pith-number/64YT5C2KB3M7Y64ISHJDGFXMEV/events.json","paper":"https://pith.science/paper/64YT5C2K"},"agent_actions":{"view_html":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV","download_json":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV.json","view_paper":"https://pith.science/paper/64YT5C2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7413&json=true","fetch_graph":"https://pith.science/api/pith-number/64YT5C2KB3M7Y64ISHJDGFXMEV/graph.json","fetch_events":"https://pith.science/api/pith-number/64YT5C2KB3M7Y64ISHJDGFXMEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/action/storage_attestation","attest_author":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/action/author_attestation","sign_citation":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/action/citation_signature","submit_replication":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/action/replication_record"}},"created_at":"2026-05-18T01:45:11.369186+00:00","updated_at":"2026-05-18T01:45:11.369186+00:00"}