{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HTWKVXMJ7W32WGANTL4YG7PW6O","short_pith_number":"pith:HTWKVXMJ","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"},"canonical_sha256":"3cecaadd89fdb7ab180d9af9837df6f3a6a3bc967791f44b2efa435f54c835c3","source":{"kind":"arxiv","id":"1711.04965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04965","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04965v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04965","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"HTWKVXMJ7W32","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTWKVXMJ7W32WGAN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTWKVXMJ","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HTWKVXMJ7W32WGANTL4YG7PW6O","target":"record","payload":{"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"},"canonical_sha256":"3cecaadd89fdb7ab180d9af9837df6f3a6a3bc967791f44b2efa435f54c835c3","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"},"source_kind":"arxiv","source_id":"1711.04965","source_version":1,"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-05-18T00:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deJ1rLU0n1f3kQ5sa4GVl3WbYOkIOHbKevhS7wHAPTjeS4LC6ZZ03ORwoiClo+2fV8cUJ8BwAQT66iDy2ivpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:26:02.358531Z"},"content_sha256":"e5bd4efdce0878bd4fa9a09126b47cf92ea46ece7ab6f2cfac70fc9e2c8f1095","schema_version":"1.0","event_id":"sha256:e5bd4efdce0878bd4fa9a09126b47cf92ea46ece7ab6f2cfac70fc9e2c8f1095"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HTWKVXMJ7W32WGANTL4YG7PW6O","target":"graph","payload":{"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"},"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-05-18T00:30:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQ+C3G2yr8Z3J6s5JJCtvjBugk62z3qtajU9+L4GVM0WuWeUQDaL8xGZViUJz/MDtY3dIKYOyyFzIoXFtYvzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:26:02.359178Z"},"content_sha256":"20349aba9e7ce0aa5085dfa627179ac6bf8c37af798a6457e9ebacbc92a92d5a","schema_version":"1.0","event_id":"sha256:20349aba9e7ce0aa5085dfa627179ac6bf8c37af798a6457e9ebacbc92a92d5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/bundle.json","state_url":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/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-05-30T20:26:02Z","links":{"resolver":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O","bundle":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/bundle.json","state":"https://pith.science/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTWKVXMJ7W32WGANTL4YG7PW6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HTWKVXMJ7W32WGANTL4YG7PW6O","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":"58b97abaa27b74b88104aa4091e6254bf1b52edbd9c7a3a2d2f4980af4986702","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T06:20:05Z","title_canon_sha256":"d369d4194fa16bf78342b485ff14b86261320928dc93ff2fab7f7db05eb1db95"},"schema_version":"1.0","source":{"id":"1711.04965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04965","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04965v1","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04965","created_at":"2026-05-18T00:30:35Z"},{"alias_kind":"pith_short_12","alias_value":"HTWKVXMJ7W32","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HTWKVXMJ7W32WGAN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HTWKVXMJ","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:20349aba9e7ce0aa5085dfa627179ac6bf8c37af798a6457e9ebacbc92a92d5a","target":"graph","created_at":"2026-05-18T00:30:35Z","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"},"paper":{"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","authors_text":"Navid Ghadermarzy, \\\"Ozg\\\"ur Y{\\i}lmaz, Yaniv Plan","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T06:20:05Z","title":"Near-optimal sample complexity for convex tensor completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04965","kind":"arxiv","version":1},"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:e5bd4efdce0878bd4fa9a09126b47cf92ea46ece7ab6f2cfac70fc9e2c8f1095","target":"record","created_at":"2026-05-18T00:30:35Z","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":"58b97abaa27b74b88104aa4091e6254bf1b52edbd9c7a3a2d2f4980af4986702","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-14T06:20:05Z","title_canon_sha256":"d369d4194fa16bf78342b485ff14b86261320928dc93ff2fab7f7db05eb1db95"},"schema_version":"1.0","source":{"id":"1711.04965","kind":"arxiv","version":1}},"canonical_sha256":"3cecaadd89fdb7ab180d9af9837df6f3a6a3bc967791f44b2efa435f54c835c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cecaadd89fdb7ab180d9af9837df6f3a6a3bc967791f44b2efa435f54c835c3","first_computed_at":"2026-05-18T00:30:35.304696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:35.304696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5CYWnhb8lkLo2pjQ3mYaeD4GRbYRQzQVM8J0fC5hJuJSKRCdZ1/RtG3Zm7CkGUvqKx8kVKc/nZEfGyoipIuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:35.305563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5bd4efdce0878bd4fa9a09126b47cf92ea46ece7ab6f2cfac70fc9e2c8f1095","sha256:20349aba9e7ce0aa5085dfa627179ac6bf8c37af798a6457e9ebacbc92a92d5a"],"state_sha256":"3b0336944a0ee8776f70db896bdd0375eee6d0a3c72bbcb1b86798b7aed1f91b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBVpguqePqgyTGjf4EJdWyb/HN2/iMQEKDN+tpjoAf7LbXnBSF1na63Jv+TSTWkoo1wIUk0PTeiLpCELyPRCBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:26:02.362860Z","bundle_sha256":"a0cc3197643e1bc36e8b1587440703deffcaf0e1d737764bdead2eb5c3596197"}}