{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AEJOHS35EFGXGLVK3AFNQYZM7D","short_pith_number":"pith:AEJOHS35","schema_version":"1.0","canonical_sha256":"0112e3cb7d214d732eaad80ad8632cf8e41e6508fcd29512eeb254a31706b40b","source":{"kind":"arxiv","id":"1702.06237","version":3},"attestation_state":"computed","paper":{"title":"Exact tensor completion with sum-of-squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Potechin, David Steurer","submitted_at":"2017-02-21T02:14:31Z","abstract_excerpt":"We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in $\\mathbb R^n$ from $r\\cdot \\tilde O(n^{1.5})$ randomly observed entries of the tensor. This bound improves over the previous best one of $r\\cdot \\tilde O(n^{2})$ by reduction to exact matrix completion. Our bound also matches the best known results for the easier problem of approximate tensor completion (Barak & Moitra, 2015).\n  Our algorithm and analysis extends"},"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":"1702.06237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-21T02:14:31Z","cross_cats_sorted":["cs.CC","cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"cbb3a2e024ca66e0cce2f1fe4579f0ee07f09937523097a81238fe140bddc96e","abstract_canon_sha256":"abeb42fe30ffb80ce6d2efa56c860300278323fb580066f8c221546f5d79d94b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:47.757415Z","signature_b64":"187xnUFdWuKzFr4LjrSuaWAqoMR51YeuzyhkEVv86P3FZs4Jvt88SmCWJoMOsopmL8mqBwfcsf8Lg9ytl6cYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0112e3cb7d214d732eaad80ad8632cf8e41e6508fcd29512eeb254a31706b40b","last_reissued_at":"2026-05-18T00:41:47.756818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:47.756818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact tensor completion with sum-of-squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Potechin, David Steurer","submitted_at":"2017-02-21T02:14:31Z","abstract_excerpt":"We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in $\\mathbb R^n$ from $r\\cdot \\tilde O(n^{1.5})$ randomly observed entries of the tensor. This bound improves over the previous best one of $r\\cdot \\tilde O(n^{2})$ by reduction to exact matrix completion. Our bound also matches the best known results for the easier problem of approximate tensor completion (Barak & Moitra, 2015).\n  Our algorithm and analysis extends"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06237","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":"1702.06237","created_at":"2026-05-18T00:41:47.756898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06237v3","created_at":"2026-05-18T00:41:47.756898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06237","created_at":"2026-05-18T00:41:47.756898+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEJOHS35EFGX","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEJOHS35EFGXGLVK","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEJOHS35","created_at":"2026-05-18T12:31:05.417338+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/AEJOHS35EFGXGLVK3AFNQYZM7D","json":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D.json","graph_json":"https://pith.science/api/pith-number/AEJOHS35EFGXGLVK3AFNQYZM7D/graph.json","events_json":"https://pith.science/api/pith-number/AEJOHS35EFGXGLVK3AFNQYZM7D/events.json","paper":"https://pith.science/paper/AEJOHS35"},"agent_actions":{"view_html":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D","download_json":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D.json","view_paper":"https://pith.science/paper/AEJOHS35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06237&json=true","fetch_graph":"https://pith.science/api/pith-number/AEJOHS35EFGXGLVK3AFNQYZM7D/graph.json","fetch_events":"https://pith.science/api/pith-number/AEJOHS35EFGXGLVK3AFNQYZM7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D/action/storage_attestation","attest_author":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D/action/author_attestation","sign_citation":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D/action/citation_signature","submit_replication":"https://pith.science/pith/AEJOHS35EFGXGLVK3AFNQYZM7D/action/replication_record"}},"created_at":"2026-05-18T00:41:47.756898+00:00","updated_at":"2026-05-18T00:41:47.756898+00:00"}