{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KXKBF3OE4NFWTVPQ2DPNTZTQUQ","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":"be6ce80b3f88d5665c9592d174a8ef953c3d7bd5d6bd5106ef46fc5add55136d","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-07-17T11:21:59Z","title_canon_sha256":"3fdc458a4cb83f6d650448c86cd5ff69dbd414aeea3314c626a754a907228442"},"schema_version":"1.0","source":{"id":"2007.08904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.08904","created_at":"2026-07-05T02:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"2007.08904v2","created_at":"2026-07-05T02:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08904","created_at":"2026-07-05T02:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"KXKBF3OE4NFW","created_at":"2026-07-05T02:06:31Z"},{"alias_kind":"pith_short_16","alias_value":"KXKBF3OE4NFWTVPQ","created_at":"2026-07-05T02:06:31Z"},{"alias_kind":"pith_short_8","alias_value":"KXKBF3OE","created_at":"2026-07-05T02:06:31Z"}],"graph_snapshots":[{"event_id":"sha256:656c769428deb530a4d62e0946aa9d9ab1bb668b06b85704333c0e255f1726e6","target":"graph","created_at":"2026-07-05T02:06: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.08904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of recovering a low-multilinear-rank tensor from a small amount of linear measurements. We show that the Riemannian gradient algorithm initialized by one step of iterative hard thresholding can reconstruct an order-$d$ tensor of size $n\\times\\ldots\\times n$ and multilinear rank $(r,\\ldots,r)$ with high probability from only $O(nr^2 + r^{d+1})$ measurements, assuming $d$ is a constant. This sampling complexity is optimal in $n$, compared to existing results whose sampling complexities are all unnecessarily large in $n$. The analysis relies on the tensor restricted isomet","authors_text":"Jian-Feng Cai, Lizhang Miao, Yang Wang, Yin Xian","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-07-17T11:21:59Z","title":"Provable Near-Optimal Low-Multilinear-Rank Tensor Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08904","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:4f5f78c40fa22c81b5e3965260599685d546134c26a8f38a4f3a38181e58ca77","target":"record","created_at":"2026-07-05T02:06: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":"be6ce80b3f88d5665c9592d174a8ef953c3d7bd5d6bd5106ef46fc5add55136d","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-07-17T11:21:59Z","title_canon_sha256":"3fdc458a4cb83f6d650448c86cd5ff69dbd414aeea3314c626a754a907228442"},"schema_version":"1.0","source":{"id":"2007.08904","kind":"arxiv","version":2}},"canonical_sha256":"55d412edc4e34b69d5f0d0ded9e670a4203b2feb3dd7b21867bf613ed11493ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55d412edc4e34b69d5f0d0ded9e670a4203b2feb3dd7b21867bf613ed11493ee","first_computed_at":"2026-07-05T02:06:31.895561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:06:31.895561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YgQ83Qu5icT8UEzQ964MZ9NOECWwZgagZDHttpgSNfjzNG6PxqvDBBCcJyMY3XcIXlcCjJJNVKFZtXg0s/PoCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:06:31.896049Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.08904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f5f78c40fa22c81b5e3965260599685d546134c26a8f38a4f3a38181e58ca77","sha256:656c769428deb530a4d62e0946aa9d9ab1bb668b06b85704333c0e255f1726e6"],"state_sha256":"35d33e8c7b5c11d69843a62b0ff97d6c98793637401adc6cda65737d26f6982f"}