{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MUH4KHETTBTGBAJQKKFYJSZABB","short_pith_number":"pith:MUH4KHET","schema_version":"1.0","canonical_sha256":"650fc51c939866608130528b84cb2008532061774d87ea1ee59667b662087498","source":{"kind":"arxiv","id":"1501.06521","version":3},"attestation_state":"computed","paper":{"title":"Noisy Tensor Completion via the Sum-of-Squares Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankur Moitra, Boaz Barak","submitted_at":"2015-01-26T18:48:55Z","abstract_excerpt":"In the noisy tensor completion problem we observe $m$ entries (whose location is chosen uniformly at random) from an unknown $n_1 \\times n_2 \\times n_3$ tensor $T$. We assume that $T$ is entry-wise close to being rank $r$. Our goal is to fill in its missing entries using as few observations as possible. Let $n = \\max(n_1, n_2, n_3)$. We show that if $m = n^{3/2} r$ then there is a polynomial time algorithm based on the sixth level of the sum-of-squares hierarchy for completing it. Our estimate agrees with almost all of $T$'s entries almost exactly and works even when our observations are corru"},"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":"1501.06521","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-26T18:48:55Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"b540734776d99a1008142fdc1719f2e7fb83227ab0ebe9fd6dcd8edb2990402d","abstract_canon_sha256":"f384cbafd943327b1d0ecb25b8c6ff5ace31813241886d6ba8f127552e05a611"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:26.304838Z","signature_b64":"zmyiQgyeBE3BODL7r4XJZYiEsrkohvHxDgq4lBC++xpeStJPcAqsvLTncBNFTMdahQTqsvm92l8NnX8Tieo6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650fc51c939866608130528b84cb2008532061774d87ea1ee59667b662087498","last_reissued_at":"2026-05-18T01:20:26.304231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:26.304231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Tensor Completion via the Sum-of-Squares Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankur Moitra, Boaz Barak","submitted_at":"2015-01-26T18:48:55Z","abstract_excerpt":"In the noisy tensor completion problem we observe $m$ entries (whose location is chosen uniformly at random) from an unknown $n_1 \\times n_2 \\times n_3$ tensor $T$. We assume that $T$ is entry-wise close to being rank $r$. Our goal is to fill in its missing entries using as few observations as possible. Let $n = \\max(n_1, n_2, n_3)$. We show that if $m = n^{3/2} r$ then there is a polynomial time algorithm based on the sixth level of the sum-of-squares hierarchy for completing it. Our estimate agrees with almost all of $T$'s entries almost exactly and works even when our observations are corru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06521","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":""},"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":"1501.06521","created_at":"2026-05-18T01:20:26.304310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06521v3","created_at":"2026-05-18T01:20:26.304310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06521","created_at":"2026-05-18T01:20:26.304310+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUH4KHETTBTG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUH4KHETTBTGBAJQ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUH4KHET","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03346","citing_title":"Provable Accuracy Collapse in Embedding-Based Representations under Dimensionality Mismatch","ref_index":174,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17461","citing_title":"Optimal Phylogenetic Reconstruction from Sampled Quartets","ref_index":174,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB","json":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB.json","graph_json":"https://pith.science/api/pith-number/MUH4KHETTBTGBAJQKKFYJSZABB/graph.json","events_json":"https://pith.science/api/pith-number/MUH4KHETTBTGBAJQKKFYJSZABB/events.json","paper":"https://pith.science/paper/MUH4KHET"},"agent_actions":{"view_html":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB","download_json":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB.json","view_paper":"https://pith.science/paper/MUH4KHET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06521&json=true","fetch_graph":"https://pith.science/api/pith-number/MUH4KHETTBTGBAJQKKFYJSZABB/graph.json","fetch_events":"https://pith.science/api/pith-number/MUH4KHETTBTGBAJQKKFYJSZABB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB/action/storage_attestation","attest_author":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB/action/author_attestation","sign_citation":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB/action/citation_signature","submit_replication":"https://pith.science/pith/MUH4KHETTBTGBAJQKKFYJSZABB/action/replication_record"}},"created_at":"2026-05-18T01:20:26.304310+00:00","updated_at":"2026-05-18T01:20:26.304310+00:00"}