{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HTWKVXMJ7W32WGANTL4YG7PW6O","short_pith_number":"pith:HTWKVXMJ","schema_version":"1.0","canonical_sha256":"3cecaadd89fdb7ab180d9af9837df6f3a6a3bc967791f44b2efa435f54c835c3","source":{"kind":"arxiv","id":"1711.04965","version":1},"attestation_state":"computed","paper":{"title":"Near-optimal sample complexity for convex tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Navid Ghadermarzy, \\\"Ozg\\\"ur Y{\\i}lmaz, Yaniv Plan","submitted_at":"2017-11-14T06:20:05Z","abstract_excerpt":"We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-$r$, order-$d$, $N \\times N \\times \\cdots \\times N$ tensor where $r=O(1)$, the best sampling complexity that was achieved is $O(N^{\\frac{d}{2}})$, which is obtained by solving a tensor nuclear-norm minimization problem. However, this bound is significantly larger than the number of free variables in a low rank tensor which is $O(dN)$. In this paper, we show that by using an atomic-norm whose atoms are rank-$1$ sign tensors, one can obtain a sample complexity of $O(dN)$. Moreover, we g"},"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":"1711.04965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T06:20:05Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"d369d4194fa16bf78342b485ff14b86261320928dc93ff2fab7f7db05eb1db95","abstract_canon_sha256":"58b97abaa27b74b88104aa4091e6254bf1b52edbd9c7a3a2d2f4980af4986702"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:35.305563Z","signature_b64":"X5CYWnhb8lkLo2pjQ3mYaeD4GRbYRQzQVM8J0fC5hJuJSKRCdZ1/RtG3Zm7CkGUvqKx8kVKc/nZEfGyoipIuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cecaadd89fdb7ab180d9af9837df6f3a6a3bc967791f44b2efa435f54c835c3","last_reissued_at":"2026-05-18T00:30:35.304696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:35.304696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal sample complexity for convex tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Navid Ghadermarzy, \\\"Ozg\\\"ur Y{\\i}lmaz, Yaniv Plan","submitted_at":"2017-11-14T06:20:05Z","abstract_excerpt":"We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-$r$, order-$d$, $N \\times N \\times \\cdots \\times N$ tensor where $r=O(1)$, the best sampling complexity that was achieved is $O(N^{\\frac{d}{2}})$, which is obtained by solving a tensor nuclear-norm minimization problem. However, this bound is significantly larger than the number of free variables in a low rank tensor which is $O(dN)$. In this paper, we show that by using an atomic-norm whose atoms are rank-$1$ sign tensors, one can obtain a sample complexity of $O(dN)$. Moreover, we g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04965","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":"1711.04965","created_at":"2026-05-18T00:30:35.304797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04965v1","created_at":"2026-05-18T00:30:35.304797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04965","created_at":"2026-05-18T00:30:35.304797+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTWKVXMJ7W32","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTWKVXMJ7W32WGAN","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTWKVXMJ","created_at":"2026-05-18T12:31:18.294218+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/HTWKVXMJ7W32WGANTL4YG7PW6O","json":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O.json","graph_json":"https://pith.science/api/pith-number/HTWKVXMJ7W32WGANTL4YG7PW6O/graph.json","events_json":"https://pith.science/api/pith-number/HTWKVXMJ7W32WGANTL4YG7PW6O/events.json","paper":"https://pith.science/paper/HTWKVXMJ"},"agent_actions":{"view_html":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O","download_json":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O.json","view_paper":"https://pith.science/paper/HTWKVXMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04965&json=true","fetch_graph":"https://pith.science/api/pith-number/HTWKVXMJ7W32WGANTL4YG7PW6O/graph.json","fetch_events":"https://pith.science/api/pith-number/HTWKVXMJ7W32WGANTL4YG7PW6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/action/storage_attestation","attest_author":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/action/author_attestation","sign_citation":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/action/citation_signature","submit_replication":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/action/replication_record"}},"created_at":"2026-05-18T00:30:35.304797+00:00","updated_at":"2026-05-18T00:30:35.304797+00:00"}