{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PBMR4HNKOCQVPP7KJ2WLUPFIME","short_pith_number":"pith:PBMR4HNK","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"},"canonical_sha256":"78591e1daa70a157bfea4eacba3ca8611e5c383edaaa7fcdb037aada3355c2db","source":{"kind":"arxiv","id":"1906.05346","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05346","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05346v3","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05346","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"PBMR4HNKOCQV","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"pith_short_16","alias_value":"PBMR4HNKOCQVPP7K","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"pith_short_8","alias_value":"PBMR4HNK","created_at":"2026-07-05T00:18:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PBMR4HNKOCQVPP7KJ2WLUPFIME","target":"record","payload":{"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"},"canonical_sha256":"78591e1daa70a157bfea4eacba3ca8611e5c383edaaa7fcdb037aada3355c2db","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"},"source_kind":"arxiv","source_id":"1906.05346","source_version":3,"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-05T00:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMaYsnQ9oUJKCuPPPJn4rReDbUZFu0A9G9ijYV/Ecp3UKmrxnrgfTOGMcn/kBNuExHomVpNJbn8IIZQtI2PMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:49:15.909425Z"},"content_sha256":"3362dfee9e0137e5e8d2d1a8b58b11c76bb97f684a582af5ffb087225798c580","schema_version":"1.0","event_id":"sha256:3362dfee9e0137e5e8d2d1a8b58b11c76bb97f684a582af5ffb087225798c580"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PBMR4HNKOCQVPP7KJ2WLUPFIME","target":"graph","payload":{"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"},"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-05T00:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDVAjkAIhb45WhIrAPfxVKd7ZQESBXaTmfyVM8z0WfH5S5VGBnBdb8LsSAL4bQ5O9cCdrgkpv8gSjhsnID21Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:49:15.909902Z"},"content_sha256":"2d2100f278c207da3e85bbb1463999da41c32287bc5ddd7a056d1e7b8230cbd5","schema_version":"1.0","event_id":"sha256:2d2100f278c207da3e85bbb1463999da41c32287bc5ddd7a056d1e7b8230cbd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/bundle.json","state_url":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/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-05T03:49:15Z","links":{"resolver":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME","bundle":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/bundle.json","state":"https://pith.science/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBMR4HNKOCQVPP7KJ2WLUPFIME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PBMR4HNKOCQVPP7KJ2WLUPFIME","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":"a325bd3dd31c70e3cf96833d58a2bfa77fa1fcbe3f56e4f367c885a4cb076104","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T19:37:40Z","title_canon_sha256":"9fff718be8fcbdb9c4ededd7e44f64b9d6a3df6318c49312679cc993bc6733c9"},"schema_version":"1.0","source":{"id":"1906.05346","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05346","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05346v3","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05346","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"PBMR4HNKOCQV","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"pith_short_16","alias_value":"PBMR4HNKOCQVPP7K","created_at":"2026-07-05T00:18:37Z"},{"alias_kind":"pith_short_8","alias_value":"PBMR4HNK","created_at":"2026-07-05T00:18:37Z"}],"graph_snapshots":[{"event_id":"sha256:2d2100f278c207da3e85bbb1463999da41c32287bc5ddd7a056d1e7b8230cbd5","target":"graph","created_at":"2026-07-05T00:18:37Z","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/1906.05346/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jian-Feng Cai, Lizhang Miao, Yang Wang, Yin Xian","cross_cats":["cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T19:37:40Z","title":"Optimal low rank tensor recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05346","kind":"arxiv","version":3},"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:3362dfee9e0137e5e8d2d1a8b58b11c76bb97f684a582af5ffb087225798c580","target":"record","created_at":"2026-07-05T00:18:37Z","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":"a325bd3dd31c70e3cf96833d58a2bfa77fa1fcbe3f56e4f367c885a4cb076104","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T19:37:40Z","title_canon_sha256":"9fff718be8fcbdb9c4ededd7e44f64b9d6a3df6318c49312679cc993bc6733c9"},"schema_version":"1.0","source":{"id":"1906.05346","kind":"arxiv","version":3}},"canonical_sha256":"78591e1daa70a157bfea4eacba3ca8611e5c383edaaa7fcdb037aada3355c2db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78591e1daa70a157bfea4eacba3ca8611e5c383edaaa7fcdb037aada3355c2db","first_computed_at":"2026-07-05T00:18:37.045826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:18:37.045826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RqJEBBcsUiIEK2K2VkI15FgRdjAnXZN/PmEsSRtQGwk+f/RLY/0M7gXLaoKQg+1TtzBzfoYpEROEFrydoG35BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:18:37.046304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05346","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3362dfee9e0137e5e8d2d1a8b58b11c76bb97f684a582af5ffb087225798c580","sha256:2d2100f278c207da3e85bbb1463999da41c32287bc5ddd7a056d1e7b8230cbd5"],"state_sha256":"e78a421adc53f1e964fcc0415fb1c57d9264d301573cf0601cfb65621205ce9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXJ12wG9cVA/83GdIosgtCy1UL11YhA7GMjUcd1nSss//91iRSqhNiR2sIctY7Jpto+wzdMsDY17ul5pzbmBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:49:15.913166Z","bundle_sha256":"22266703dedcea89569a6152405247754cb260ca48a1f3e1015024122ef10542"}}