{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IGIGJA37TIK2PBJTIOBUQY56FW","short_pith_number":"pith:IGIGJA37","schema_version":"1.0","canonical_sha256":"419064837f9a15a7853343834863be2daf251466425052a7fddc0a09d14587ec","source":{"kind":"arxiv","id":"2305.04080","version":2},"attestation_state":"computed","paper":{"title":"Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Deanna Needell, HanQin Cai, Longxiu Huang, Zehan Chao","submitted_at":"2023-05-06T16:02:37Z","abstract_excerpt":"We study the tensor robust principal component analysis (TRPCA) problem, a tensorial extension of matrix robust principal component analysis (RPCA), that aims to split the given tensor into an underlying low-rank component and a sparse outlier component. This work proposes a fast algorithm, called Robust Tensor CUR Decompositions (RTCUR), for large-scale non-convex TRPCA problems under the Tucker rank setting. RTCUR is developed within a framework of alternating projections that projects between the set of low-rank tensors and the set of sparse tensors. We utilize the recently developed tensor"},"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":"2305.04080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-05-06T16:02:37Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"a0ad97855d68a5de14a1b4b675b6aafb5e0f0faed1f657930bd04ec607cff703","abstract_canon_sha256":"533a84ba097ccced22ee157786832069eb74c7fbd7fadff814d55fa9d694fe5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:27.408463Z","signature_b64":"PSJTX4TJMz38bqamE6mgM17LoPWNL8+oSasN1cTdG+s0gKYzdLR387cX8xIxKEMEfDyXR2VdmsR1Cbx0P0m2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"419064837f9a15a7853343834863be2daf251466425052a7fddc0a09d14587ec","last_reissued_at":"2026-07-05T07:38:27.408016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:27.408016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Deanna Needell, HanQin Cai, Longxiu Huang, Zehan Chao","submitted_at":"2023-05-06T16:02:37Z","abstract_excerpt":"We study the tensor robust principal component analysis (TRPCA) problem, a tensorial extension of matrix robust principal component analysis (RPCA), that aims to split the given tensor into an underlying low-rank component and a sparse outlier component. This work proposes a fast algorithm, called Robust Tensor CUR Decompositions (RTCUR), for large-scale non-convex TRPCA problems under the Tucker rank setting. RTCUR is developed within a framework of alternating projections that projects between the set of low-rank tensors and the set of sparse tensors. We utilize the recently developed tensor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04080","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.04080/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.04080","created_at":"2026-07-05T07:38:27.408071+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04080v2","created_at":"2026-07-05T07:38:27.408071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04080","created_at":"2026-07-05T07:38:27.408071+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGIGJA37TIK2","created_at":"2026-07-05T07:38:27.408071+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGIGJA37TIK2PBJT","created_at":"2026-07-05T07:38:27.408071+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGIGJA37","created_at":"2026-07-05T07:38:27.408071+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09926","citing_title":"Robust Anomaly Detection via Tensor Pseudoskeleton Decomposition","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW","json":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW.json","graph_json":"https://pith.science/api/pith-number/IGIGJA37TIK2PBJTIOBUQY56FW/graph.json","events_json":"https://pith.science/api/pith-number/IGIGJA37TIK2PBJTIOBUQY56FW/events.json","paper":"https://pith.science/paper/IGIGJA37"},"agent_actions":{"view_html":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW","download_json":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW.json","view_paper":"https://pith.science/paper/IGIGJA37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04080&json=true","fetch_graph":"https://pith.science/api/pith-number/IGIGJA37TIK2PBJTIOBUQY56FW/graph.json","fetch_events":"https://pith.science/api/pith-number/IGIGJA37TIK2PBJTIOBUQY56FW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/action/storage_attestation","attest_author":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/action/author_attestation","sign_citation":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/action/citation_signature","submit_replication":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/action/replication_record"}},"created_at":"2026-07-05T07:38:27.408071+00:00","updated_at":"2026-07-05T07:38:27.408071+00:00"}