{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R74PKD26TSER7X6O4MDRP3QIEC","short_pith_number":"pith:R74PKD26","schema_version":"1.0","canonical_sha256":"8ff8f50f5e9c891fdfcee30717ee082097348fbaaa7aa528172df31bab6f6dd1","source":{"kind":"arxiv","id":"1708.00601","version":1},"attestation_state":"computed","paper":{"title":"Exact Tensor Completion from Sparsely Corrupted Observations via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jonathan Q. Jiang, Michael K. Ng","submitted_at":"2017-08-02T04:45:42Z","abstract_excerpt":"This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that is similar to the SVD for matrices, and define a new notion of tensor rank referred to as the tubal rank. We prove that by simply solving a convex program, which minimizes a weighted combination of tubal nuclear norm, a convex surrogate for the tubal rank, and the $\\ell_1$-norm, "},"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":"1708.00601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-02T04:45:42Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"b2e9aee5ba24a758917fc3de4c007085faea1c4a8994d0944165bedb7d8ec93e","abstract_canon_sha256":"cd51de87e771da6d96658dac823899eb1661b25fcdf5c4542ee5c1d65018079a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:45.285017Z","signature_b64":"gw4lccyg2tuo3pUuAPE6MXPcEbdEn6f1BQDImOUVGZWFj9qmftRFLdaOrtj9YfRXtSPInSbsYxOhisUGa/I+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff8f50f5e9c891fdfcee30717ee082097348fbaaa7aa528172df31bab6f6dd1","last_reissued_at":"2026-05-18T00:38:45.284508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:45.284508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Tensor Completion from Sparsely Corrupted Observations via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jonathan Q. Jiang, Michael K. Ng","submitted_at":"2017-08-02T04:45:42Z","abstract_excerpt":"This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic framework in which we can obtain tensor singular value decomposition (t-SVD) that is similar to the SVD for matrices, and define a new notion of tensor rank referred to as the tubal rank. We prove that by simply solving a convex program, which minimizes a weighted combination of tubal nuclear norm, a convex surrogate for the tubal rank, and the $\\ell_1$-norm, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00601","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":"1708.00601","created_at":"2026-05-18T00:38:45.284581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00601v1","created_at":"2026-05-18T00:38:45.284581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00601","created_at":"2026-05-18T00:38:45.284581+00:00"},{"alias_kind":"pith_short_12","alias_value":"R74PKD26TSER","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R74PKD26TSER7X6O","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R74PKD26","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01113","citing_title":"Robust Tensor Completion Using Transformed Tensor SVD","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC","json":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC.json","graph_json":"https://pith.science/api/pith-number/R74PKD26TSER7X6O4MDRP3QIEC/graph.json","events_json":"https://pith.science/api/pith-number/R74PKD26TSER7X6O4MDRP3QIEC/events.json","paper":"https://pith.science/paper/R74PKD26"},"agent_actions":{"view_html":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC","download_json":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC.json","view_paper":"https://pith.science/paper/R74PKD26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00601&json=true","fetch_graph":"https://pith.science/api/pith-number/R74PKD26TSER7X6O4MDRP3QIEC/graph.json","fetch_events":"https://pith.science/api/pith-number/R74PKD26TSER7X6O4MDRP3QIEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC/action/storage_attestation","attest_author":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC/action/author_attestation","sign_citation":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC/action/citation_signature","submit_replication":"https://pith.science/pith/R74PKD26TSER7X6O4MDRP3QIEC/action/replication_record"}},"created_at":"2026-05-18T00:38:45.284581+00:00","updated_at":"2026-05-18T00:38:45.284581+00:00"}