{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QN3WPZJIBK5GLDZRKY472LO3LN","short_pith_number":"pith:QN3WPZJI","schema_version":"1.0","canonical_sha256":"837767e5280aba658f315639fd2ddb5b73321884384a43cf1e4d5c551f9b9142","source":{"kind":"arxiv","id":"1511.05261","version":1},"attestation_state":"computed","paper":{"title":"Robust PCA via Nonconvex Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.ML"],"primary_cat":"cs.CV","authors_text":"Chong Peng, Qiang Cheng, Zhao Kang","submitted_at":"2015-11-17T03:00:30Z","abstract_excerpt":"Numerous applications in data mining and machine learning require recovering a matrix of minimal rank. Robust principal component analysis (RPCA) is a general framework for handling this kind of problems. Nuclear norm based convex surrogate of the rank function in RPCA is widely investigated. Under certain assumptions, it can recover the underlying true low rank matrix with high probability. However, those assumptions may not hold in real-world applications. Since the nuclear norm approximates the rank by adding all singular values together, which is essentially a $\\ell_1$-norm of the singular"},"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":"1511.05261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-17T03:00:30Z","cross_cats_sorted":["cs.LG","cs.NA","stat.ML"],"title_canon_sha256":"39d68e7b6b983fdb14286da80ca5f4e239f88742adf8335b64ac6268c35b5297","abstract_canon_sha256":"815995193479d54f1a14d001f20c798620c436e70f080c7280bddc1c8b47dae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:34.546256Z","signature_b64":"iyaHbHOhs1Z6ANvKj21ZR67m2knEPX7vBB3/hfR5SNEwTq6e7ZuvGv4L5rTSsB6xdx3aboBmhOt1AcIeRvKiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837767e5280aba658f315639fd2ddb5b73321884384a43cf1e4d5c551f9b9142","last_reissued_at":"2026-05-18T00:58:34.545610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:34.545610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust PCA via Nonconvex Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","stat.ML"],"primary_cat":"cs.CV","authors_text":"Chong Peng, Qiang Cheng, Zhao Kang","submitted_at":"2015-11-17T03:00:30Z","abstract_excerpt":"Numerous applications in data mining and machine learning require recovering a matrix of minimal rank. Robust principal component analysis (RPCA) is a general framework for handling this kind of problems. Nuclear norm based convex surrogate of the rank function in RPCA is widely investigated. Under certain assumptions, it can recover the underlying true low rank matrix with high probability. However, those assumptions may not hold in real-world applications. Since the nuclear norm approximates the rank by adding all singular values together, which is essentially a $\\ell_1$-norm of the singular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05261","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":"1511.05261","created_at":"2026-05-18T00:58:34.545700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05261v1","created_at":"2026-05-18T00:58:34.545700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05261","created_at":"2026-05-18T00:58:34.545700+00:00"},{"alias_kind":"pith_short_12","alias_value":"QN3WPZJIBK5G","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QN3WPZJIBK5GLDZR","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QN3WPZJI","created_at":"2026-05-18T12:29:37.295048+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/QN3WPZJIBK5GLDZRKY472LO3LN","json":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN.json","graph_json":"https://pith.science/api/pith-number/QN3WPZJIBK5GLDZRKY472LO3LN/graph.json","events_json":"https://pith.science/api/pith-number/QN3WPZJIBK5GLDZRKY472LO3LN/events.json","paper":"https://pith.science/paper/QN3WPZJI"},"agent_actions":{"view_html":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN","download_json":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN.json","view_paper":"https://pith.science/paper/QN3WPZJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05261&json=true","fetch_graph":"https://pith.science/api/pith-number/QN3WPZJIBK5GLDZRKY472LO3LN/graph.json","fetch_events":"https://pith.science/api/pith-number/QN3WPZJIBK5GLDZRKY472LO3LN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN/action/storage_attestation","attest_author":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN/action/author_attestation","sign_citation":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN/action/citation_signature","submit_replication":"https://pith.science/pith/QN3WPZJIBK5GLDZRKY472LO3LN/action/replication_record"}},"created_at":"2026-05-18T00:58:34.545700+00:00","updated_at":"2026-05-18T00:58:34.545700+00:00"}