{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PBMR4HNKOCQVPP7KJ2WLUPFIME","short_pith_number":"pith:PBMR4HNK","schema_version":"1.0","canonical_sha256":"78591e1daa70a157bfea4eacba3ca8611e5c383edaaa7fcdb037aada3355c2db","source":{"kind":"arxiv","id":"1906.05346","version":3},"attestation_state":"computed","paper":{"title":"Optimal low rank tensor recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Jian-Feng Cai, Lizhang Miao, Yang Wang, Yin Xian","submitted_at":"2019-06-12T19:37:40Z","abstract_excerpt":"We investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. In the Tucker decomposition framework, we show that the Riemannian optimization algorithm with initial value obtained from a spectral method can reconstruct a tensor of size $n\\times n \\times\\cdots \\times n$ tensor of ranks $(r,\\cdots,r)$ with high probability from as few as $O((r^d+dnr)\\log(d))$ entries. In the case of order 3 tensor, the entries can be asymptotically as few as $O(nr)$ for a low rank large tensor. We show the theoretical guarantee condition for the re"},"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":"1906.05346","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T19:37:40Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"9fff718be8fcbdb9c4ededd7e44f64b9d6a3df6318c49312679cc993bc6733c9","abstract_canon_sha256":"a325bd3dd31c70e3cf96833d58a2bfa77fa1fcbe3f56e4f367c885a4cb076104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:37.046304Z","signature_b64":"RqJEBBcsUiIEK2K2VkI15FgRdjAnXZN/PmEsSRtQGwk+f/RLY/0M7gXLaoKQg+1TtzBzfoYpEROEFrydoG35BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78591e1daa70a157bfea4eacba3ca8611e5c383edaaa7fcdb037aada3355c2db","last_reissued_at":"2026-07-05T00:18:37.045826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:37.045826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal low rank tensor recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Jian-Feng Cai, Lizhang Miao, Yang Wang, Yin Xian","submitted_at":"2019-06-12T19:37:40Z","abstract_excerpt":"We investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. In the Tucker decomposition framework, we show that the Riemannian optimization algorithm with initial value obtained from a spectral method can reconstruct a tensor of size $n\\times n \\times\\cdots \\times n$ tensor of ranks $(r,\\cdots,r)$ with high probability from as few as $O((r^d+dnr)\\log(d))$ entries. In the case of order 3 tensor, the entries can be asymptotically as few as $O(nr)$ for a low rank large tensor. We show the theoretical guarantee condition for the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05346","kind":"arxiv","version":3},"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/1906.05346/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":"1906.05346","created_at":"2026-07-05T00:18:37.045885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05346v3","created_at":"2026-07-05T00:18:37.045885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05346","created_at":"2026-07-05T00:18:37.045885+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBMR4HNKOCQV","created_at":"2026-07-05T00:18:37.045885+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBMR4HNKOCQVPP7K","created_at":"2026-07-05T00:18:37.045885+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBMR4HNK","created_at":"2026-07-05T00:18:37.045885+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/PBMR4HNKOCQVPP7KJ2WLUPFIME","json":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME.json","graph_json":"https://pith.science/api/pith-number/PBMR4HNKOCQVPP7KJ2WLUPFIME/graph.json","events_json":"https://pith.science/api/pith-number/PBMR4HNKOCQVPP7KJ2WLUPFIME/events.json","paper":"https://pith.science/paper/PBMR4HNK"},"agent_actions":{"view_html":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME","download_json":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME.json","view_paper":"https://pith.science/paper/PBMR4HNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05346&json=true","fetch_graph":"https://pith.science/api/pith-number/PBMR4HNKOCQVPP7KJ2WLUPFIME/graph.json","fetch_events":"https://pith.science/api/pith-number/PBMR4HNKOCQVPP7KJ2WLUPFIME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/action/storage_attestation","attest_author":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/action/author_attestation","sign_citation":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/action/citation_signature","submit_replication":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/action/replication_record"}},"created_at":"2026-07-05T00:18:37.045885+00:00","updated_at":"2026-07-05T00:18:37.045885+00:00"}