{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IGIGJA37TIK2PBJTIOBUQY56FW","short_pith_number":"pith:IGIGJA37","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"},"canonical_sha256":"419064837f9a15a7853343834863be2daf251466425052a7fddc0a09d14587ec","source":{"kind":"arxiv","id":"2305.04080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.04080","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2305.04080v2","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04080","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"IGIGJA37TIK2","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"IGIGJA37TIK2PBJT","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"IGIGJA37","created_at":"2026-07-05T07:38:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IGIGJA37TIK2PBJTIOBUQY56FW","target":"record","payload":{"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"},"canonical_sha256":"419064837f9a15a7853343834863be2daf251466425052a7fddc0a09d14587ec","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"},"source_kind":"arxiv","source_id":"2305.04080","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-07-05T07:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fh59o0jJJMRJjafAR8FBFOvY17kz902PWMO6wg5YFHvnPW6WJOv1pkcYGBODbbUFwWRrsuVSQ/797FwytOkADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:50:32.425230Z"},"content_sha256":"610cff3da7171a1982ce0e8e4c4aea7985cacd2867341399b50a7b8a3c588563","schema_version":"1.0","event_id":"sha256:610cff3da7171a1982ce0e8e4c4aea7985cacd2867341399b50a7b8a3c588563"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IGIGJA37TIK2PBJTIOBUQY56FW","target":"graph","payload":{"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"},"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-07-05T07:38:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PuYVglmiNJBGBQQ8qYV1gABIFVc0WX07ziQIPQUa8vZjoDDsY4PR/QE5xoQ+leWhsxiqHo597RBrwOCdLbZgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:50:32.425738Z"},"content_sha256":"fbffa615c65e086a4703c31cdcb34c72593a37946fc408394213e1b237c5f52e","schema_version":"1.0","event_id":"sha256:fbffa615c65e086a4703c31cdcb34c72593a37946fc408394213e1b237c5f52e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/bundle.json","state_url":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGIGJA37TIK2PBJTIOBUQY56FW/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-08-21T17:50:32Z","links":{"resolver":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW","bundle":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/bundle.json","state":"https://pith.science/pith/IGIGJA37TIK2PBJTIOBUQY56FW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGIGJA37TIK2PBJTIOBUQY56FW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IGIGJA37TIK2PBJTIOBUQY56FW","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":"533a84ba097ccced22ee157786832069eb74c7fbd7fadff814d55fa9d694fe5f","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-05-06T16:02:37Z","title_canon_sha256":"a0ad97855d68a5de14a1b4b675b6aafb5e0f0faed1f657930bd04ec607cff703"},"schema_version":"1.0","source":{"id":"2305.04080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.04080","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"arxiv_version","alias_value":"2305.04080v2","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04080","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"pith_short_12","alias_value":"IGIGJA37TIK2","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"pith_short_16","alias_value":"IGIGJA37TIK2PBJT","created_at":"2026-07-05T07:38:27Z"},{"alias_kind":"pith_short_8","alias_value":"IGIGJA37","created_at":"2026-07-05T07:38:27Z"}],"graph_snapshots":[{"event_id":"sha256:fbffa615c65e086a4703c31cdcb34c72593a37946fc408394213e1b237c5f52e","target":"graph","created_at":"2026-07-05T07:38:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.04080/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Deanna Needell, HanQin Cai, Longxiu Huang, Zehan Chao","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-05-06T16:02:37Z","title":"Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04080","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:610cff3da7171a1982ce0e8e4c4aea7985cacd2867341399b50a7b8a3c588563","target":"record","created_at":"2026-07-05T07:38:27Z","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":"533a84ba097ccced22ee157786832069eb74c7fbd7fadff814d55fa9d694fe5f","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-05-06T16:02:37Z","title_canon_sha256":"a0ad97855d68a5de14a1b4b675b6aafb5e0f0faed1f657930bd04ec607cff703"},"schema_version":"1.0","source":{"id":"2305.04080","kind":"arxiv","version":2}},"canonical_sha256":"419064837f9a15a7853343834863be2daf251466425052a7fddc0a09d14587ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"419064837f9a15a7853343834863be2daf251466425052a7fddc0a09d14587ec","first_computed_at":"2026-07-05T07:38:27.408016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:27.408016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PSJTX4TJMz38bqamE6mgM17LoPWNL8+oSasN1cTdG+s0gKYzdLR387cX8xIxKEMEfDyXR2VdmsR1Cbx0P0m2Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:27.408463Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.04080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:610cff3da7171a1982ce0e8e4c4aea7985cacd2867341399b50a7b8a3c588563","sha256:fbffa615c65e086a4703c31cdcb34c72593a37946fc408394213e1b237c5f52e"],"state_sha256":"e951cb178b7fbf02e92c6f032efccda2bf0023364c434956428dc8579ea40b04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"khdt1rGy35rBA3/ZqYprqD0/RszMoSgN/2B1Tf1GobRKIr9rZcI3DIz8G1kjFFaQ+9EpaAqxbIf5LKw2HilxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:50:32.429902Z","bundle_sha256":"8f41b911f62fd2cca2f67dd39c270c76fa415b482f0b82913b4d1345c2d387ca"}}