{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:64YT5C2KB3M7Y64ISHJDGFXMEV","short_pith_number":"pith:64YT5C2K","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"},"canonical_sha256":"f7313e8b4a0ed9fc7b8891d23316ec25760845c5d8ff53cc7f3f8ff422d9b0d5","source":{"kind":"arxiv","id":"1401.7413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7413","created_at":"2026-05-18T01:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7413v2","created_at":"2026-05-18T01:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7413","created_at":"2026-05-18T01:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"64YT5C2KB3M7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"64YT5C2KB3M7Y64I","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"64YT5C2K","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:64YT5C2KB3M7Y64ISHJDGFXMEV","target":"record","payload":{"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"},"canonical_sha256":"f7313e8b4a0ed9fc7b8891d23316ec25760845c5d8ff53cc7f3f8ff422d9b0d5","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"},"source_kind":"arxiv","source_id":"1401.7413","source_version":2,"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-18T01:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmOdvUkrlN1fhbjHp4zKuyedyhhEYoYahsAd08fqzsazXJTH4DPZw9ZstT6k6NhSuR+tH64lDyMAq48WAWa7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T02:09:18.037695Z"},"content_sha256":"e45e79a176c64538db893884429a20c4938b0342d25d5e838a277933ca974399","schema_version":"1.0","event_id":"sha256:e45e79a176c64538db893884429a20c4938b0342d25d5e838a277933ca974399"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:64YT5C2KB3M7Y64ISHJDGFXMEV","target":"graph","payload":{"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"},"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-18T01:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3ieGdEs8nWoRiJEfTrUAaoJ0/i0UHhqffrCMaVsdJ07IEse59Kk5cosjJXTSK67LVsiCy3DsQk81CeFhHNmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T02:09:18.038265Z"},"content_sha256":"769d449a1c37f7315b2538ad5f8145248fc6691d9d749eee0a385fe835992642","schema_version":"1.0","event_id":"sha256:769d449a1c37f7315b2538ad5f8145248fc6691d9d749eee0a385fe835992642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/bundle.json","state_url":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/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-21T02:09:18Z","links":{"resolver":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV","bundle":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/bundle.json","state":"https://pith.science/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64YT5C2KB3M7Y64ISHJDGFXMEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:64YT5C2KB3M7Y64ISHJDGFXMEV","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":"4e1862b52db81d35148b4a88e3faf18798a11f2f2b3b348e3614295657df684a","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-29T05:16:52Z","title_canon_sha256":"bfb0c3b7dd294ed6ea068c093df5a5d3b85bcbffd27fff85d914e1359487455d"},"schema_version":"1.0","source":{"id":"1401.7413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7413","created_at":"2026-05-18T01:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7413v2","created_at":"2026-05-18T01:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7413","created_at":"2026-05-18T01:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"64YT5C2KB3M7","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"64YT5C2KB3M7Y64I","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"64YT5C2K","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:769d449a1c37f7315b2538ad5f8145248fc6691d9d749eee0a385fe835992642","target":"graph","created_at":"2026-05-18T01:45:11Z","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":"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","authors_text":"Canyi Lu, Shuicheng Yan, Zhouchen Lin","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-29T05:16:52Z","title":"Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7413","kind":"arxiv","version":2},"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:e45e79a176c64538db893884429a20c4938b0342d25d5e838a277933ca974399","target":"record","created_at":"2026-05-18T01:45:11Z","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":"4e1862b52db81d35148b4a88e3faf18798a11f2f2b3b348e3614295657df684a","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-29T05:16:52Z","title_canon_sha256":"bfb0c3b7dd294ed6ea068c093df5a5d3b85bcbffd27fff85d914e1359487455d"},"schema_version":"1.0","source":{"id":"1401.7413","kind":"arxiv","version":2}},"canonical_sha256":"f7313e8b4a0ed9fc7b8891d23316ec25760845c5d8ff53cc7f3f8ff422d9b0d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7313e8b4a0ed9fc7b8891d23316ec25760845c5d8ff53cc7f3f8ff422d9b0d5","first_computed_at":"2026-05-18T01:45:11.369067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:45:11.369067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lR5LsBfHZyFIjWJGs16cNrDavP7Utjn4cvIMulW3/bfGN1Ue6BOgLCMiMwlapUTxq62lBjkoOPLOQnKP6ntEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:45:11.369828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e45e79a176c64538db893884429a20c4938b0342d25d5e838a277933ca974399","sha256:769d449a1c37f7315b2538ad5f8145248fc6691d9d749eee0a385fe835992642"],"state_sha256":"c02d5d7147ef6f814b0b367ba5436fae4c680477f0c72b4397611f74e42c9ffb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BSTkb1eBRj9f06GWAEUu5aTfMhm+8Sj+IRgNFih5+ZXVX8Spv9G+lyP9XA+9btwymPBbRUdvc9cViTi/4hICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T02:09:18.041573Z","bundle_sha256":"09c16bf7c0cf4706ff118028dfe30432fc25121c82a5174a3a16497311891c7c"}}