{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TOJZIMUIY7G7X4W42CR43MV7XA","short_pith_number":"pith:TOJZIMUI","canonical_record":{"source":{"id":"1311.6182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-24T22:41:20Z","cross_cats_sorted":[],"title_canon_sha256":"8220d859943ea42c8d96850671a7b48706aa15ca72833315b0219ecbd9a9acdc","abstract_canon_sha256":"e6ed9ce57f1bda9d1306a059e9e1dbe27cd594e8578fced43b6bcb5a749f91a9"},"schema_version":"1.0"},"canonical_sha256":"9b93943288c7cdfbf2dcd0a3cdb2bfb81b0f50fbcebfcfc098ffb45057d3d365","source":{"kind":"arxiv","id":"1311.6182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6182","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6182v1","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6182","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"TOJZIMUIY7G7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TOJZIMUIY7G7X4W4","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TOJZIMUI","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TOJZIMUIY7G7X4W42CR43MV7XA","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-24T22:41:20Z","cross_cats_sorted":[],"title_canon_sha256":"8220d859943ea42c8d96850671a7b48706aa15ca72833315b0219ecbd9a9acdc","abstract_canon_sha256":"e6ed9ce57f1bda9d1306a059e9e1dbe27cd594e8578fced43b6bcb5a749f91a9"},"schema_version":"1.0"},"canonical_sha256":"9b93943288c7cdfbf2dcd0a3cdb2bfb81b0f50fbcebfcfc098ffb45057d3d365","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.676306Z","signature_b64":"zJfvxCEjISeZRYG5JqEeyk1oMYnlBoGhJ5bOEstuIo42kNrv3swFMRPZm4k0MrzY7N9AbfC+O1tnK79KHHbABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b93943288c7cdfbf2dcd0a3cdb2bfb81b0f50fbcebfcfc098ffb45057d3d365","last_reissued_at":"2026-05-18T02:44:31.675750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.675750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6182","source_version":1,"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-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voc4i/8rBoYupeqyq357CJIMzlLuLhQVm+SOjP1I0U0Vha25dw8YqOjjgwwI6Isn0NLw+vmVuvXRuEKS5WCmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:13:37.729261Z"},"content_sha256":"a0bcbeca726546f8ce0cdf90355556a9748ba9b03919a3efd53b9176f1fe7e93","schema_version":"1.0","event_id":"sha256:a0bcbeca726546f8ce0cdf90355556a9748ba9b03919a3efd53b9176f1fe7e93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TOJZIMUIY7G7X4W42CR43MV7XA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Low-rank Tensor Recovery: Models and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Donald Goldfarb, Zhiwei Qin","submitted_at":"2013-11-24T22:41:20Z","abstract_excerpt":"Robust tensor recovery plays an instrumental role in robustifying tensor decompositions for multilinear data analysis against outliers, gross corruptions and missing values and has a diverse array of applications. In this paper, we study the problem of robust low-rank tensor recovery in a convex optimization framework, drawing upon recent advances in robust Principal Component Analysis and tensor completion. We propose tailored optimization algorithms with global convergence guarantees for solving both the constrained and the Lagrangian formulations of the problem. These algorithms are based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6182","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"},"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-18T02:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47mE5Jx4kym5hEbr22TjPc8oqxwSwdKcdbbrDIq7RicZgZoggYSXw7i4yL8Jfa0dB95MUw5sPKXNBVFJJ0+gBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:13:37.729986Z"},"content_sha256":"22361aba1775dd6e617fa64ff3357494e296475ebcf68d8e36d69cd7df87a710","schema_version":"1.0","event_id":"sha256:22361aba1775dd6e617fa64ff3357494e296475ebcf68d8e36d69cd7df87a710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOJZIMUIY7G7X4W42CR43MV7XA/bundle.json","state_url":"https://pith.science/pith/TOJZIMUIY7G7X4W42CR43MV7XA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOJZIMUIY7G7X4W42CR43MV7XA/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-06-12T00:13:37Z","links":{"resolver":"https://pith.science/pith/TOJZIMUIY7G7X4W42CR43MV7XA","bundle":"https://pith.science/pith/TOJZIMUIY7G7X4W42CR43MV7XA/bundle.json","state":"https://pith.science/pith/TOJZIMUIY7G7X4W42CR43MV7XA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOJZIMUIY7G7X4W42CR43MV7XA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TOJZIMUIY7G7X4W42CR43MV7XA","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":"e6ed9ce57f1bda9d1306a059e9e1dbe27cd594e8578fced43b6bcb5a749f91a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-24T22:41:20Z","title_canon_sha256":"8220d859943ea42c8d96850671a7b48706aa15ca72833315b0219ecbd9a9acdc"},"schema_version":"1.0","source":{"id":"1311.6182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6182","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6182v1","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6182","created_at":"2026-05-18T02:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"TOJZIMUIY7G7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TOJZIMUIY7G7X4W4","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TOJZIMUI","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:22361aba1775dd6e617fa64ff3357494e296475ebcf68d8e36d69cd7df87a710","target":"graph","created_at":"2026-05-18T02:44:31Z","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":"Robust tensor recovery plays an instrumental role in robustifying tensor decompositions for multilinear data analysis against outliers, gross corruptions and missing values and has a diverse array of applications. In this paper, we study the problem of robust low-rank tensor recovery in a convex optimization framework, drawing upon recent advances in robust Principal Component Analysis and tensor completion. We propose tailored optimization algorithms with global convergence guarantees for solving both the constrained and the Lagrangian formulations of the problem. These algorithms are based o","authors_text":"Donald Goldfarb, Zhiwei Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-24T22:41:20Z","title":"Robust Low-rank Tensor Recovery: Models and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6182","kind":"arxiv","version":1},"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:a0bcbeca726546f8ce0cdf90355556a9748ba9b03919a3efd53b9176f1fe7e93","target":"record","created_at":"2026-05-18T02:44:31Z","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":"e6ed9ce57f1bda9d1306a059e9e1dbe27cd594e8578fced43b6bcb5a749f91a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-24T22:41:20Z","title_canon_sha256":"8220d859943ea42c8d96850671a7b48706aa15ca72833315b0219ecbd9a9acdc"},"schema_version":"1.0","source":{"id":"1311.6182","kind":"arxiv","version":1}},"canonical_sha256":"9b93943288c7cdfbf2dcd0a3cdb2bfb81b0f50fbcebfcfc098ffb45057d3d365","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b93943288c7cdfbf2dcd0a3cdb2bfb81b0f50fbcebfcfc098ffb45057d3d365","first_computed_at":"2026-05-18T02:44:31.675750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:31.675750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zJfvxCEjISeZRYG5JqEeyk1oMYnlBoGhJ5bOEstuIo42kNrv3swFMRPZm4k0MrzY7N9AbfC+O1tnK79KHHbABA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:31.676306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0bcbeca726546f8ce0cdf90355556a9748ba9b03919a3efd53b9176f1fe7e93","sha256:22361aba1775dd6e617fa64ff3357494e296475ebcf68d8e36d69cd7df87a710"],"state_sha256":"ca8a4fb040697b7de406647c32b39d4fbec89fd3760756d213bc25723ee2f54e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjuHkD8SLxZY1heShErJuqa/OAu/95xN/1nhuJxmWohgHSoSuAZQtoUeGn0TVgRKv6TVvT8D1AdtIUS+ht4ZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:13:37.734052Z","bundle_sha256":"df766941a397601c4f09b8fa2db96dbe6e9879c86297ea21d08dbeacbe8c14cd"}}