{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZS33UNMMJWODXISOFUFCT7P7FK","short_pith_number":"pith:ZS33UNMM","schema_version":"1.0","canonical_sha256":"ccb7ba358c4d9c3ba24e2d0a29fdff2a8fa090a694baac9a080c982680e43bfa","source":{"kind":"arxiv","id":"1907.08288","version":1},"attestation_state":"computed","paper":{"title":"Exact Recovery of Tensor Robust Principal Component Analysis under Linear Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Pan Zhou","submitted_at":"2019-07-16T19:05:15Z","abstract_excerpt":"This work studies the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is motivated by the recently proposed linear transforms based tensor-tensor product and tensor SVD. We define a new transforms depended tensor rank and the corresponding tensor nuclear norm. Then we solve the TRPCA problem by convex optimization whose objective is a weighted combination of the new tensor nuclear norm and the $\\ell_1$-norm. In theory, we show that under certain incoherence conditions, the convex program exac"},"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":"1907.08288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-16T19:05:15Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"338c9397337199a807f27b346489e391f33199c94a4ea6a81d806d6697d27e68","abstract_canon_sha256":"258e56e9ca158d4176baf907e40e10cd1f7488692ed7d2fb5a60ab994746fd03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.328410Z","signature_b64":"tPK35CszH2FYYiv0E9bDo0yf1Lf+L4smDJSu0F1d8vZ2Gh8jO2Ar04sYrjBhcqhfi6lUgZuLWve3AWZkJ7o9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccb7ba358c4d9c3ba24e2d0a29fdff2a8fa090a694baac9a080c982680e43bfa","last_reissued_at":"2026-05-17T23:40:10.327930Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.327930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Recovery of Tensor Robust Principal Component Analysis under Linear Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Canyi Lu, Pan Zhou","submitted_at":"2019-07-16T19:05:15Z","abstract_excerpt":"This work studies the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is motivated by the recently proposed linear transforms based tensor-tensor product and tensor SVD. We define a new transforms depended tensor rank and the corresponding tensor nuclear norm. Then we solve the TRPCA problem by convex optimization whose objective is a weighted combination of the new tensor nuclear norm and the $\\ell_1$-norm. In theory, we show that under certain incoherence conditions, the convex program exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08288","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":"1907.08288","created_at":"2026-05-17T23:40:10.328007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08288v1","created_at":"2026-05-17T23:40:10.328007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08288","created_at":"2026-05-17T23:40:10.328007+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS33UNMMJWOD","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS33UNMMJWODXISO","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS33UNMM","created_at":"2026-05-18T12:33:33.725879+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/ZS33UNMMJWODXISOFUFCT7P7FK","json":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK.json","graph_json":"https://pith.science/api/pith-number/ZS33UNMMJWODXISOFUFCT7P7FK/graph.json","events_json":"https://pith.science/api/pith-number/ZS33UNMMJWODXISOFUFCT7P7FK/events.json","paper":"https://pith.science/paper/ZS33UNMM"},"agent_actions":{"view_html":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK","download_json":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK.json","view_paper":"https://pith.science/paper/ZS33UNMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08288&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS33UNMMJWODXISOFUFCT7P7FK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS33UNMMJWODXISOFUFCT7P7FK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK/action/storage_attestation","attest_author":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK/action/author_attestation","sign_citation":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK/action/citation_signature","submit_replication":"https://pith.science/pith/ZS33UNMMJWODXISOFUFCT7P7FK/action/replication_record"}},"created_at":"2026-05-17T23:40:10.328007+00:00","updated_at":"2026-05-17T23:40:10.328007+00:00"}