{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F7QMCDEBWACHZKOYMBHDT3UK3Y","short_pith_number":"pith:F7QMCDEB","schema_version":"1.0","canonical_sha256":"2fe0c10c81b0047ca9d8604e39ee8ade34640b7f3cbb46c2985e9135ec9055f7","source":{"kind":"arxiv","id":"1406.2784","version":1},"attestation_state":"computed","paper":{"title":"Provable Tensor Factorization with Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Prateek Jain, Sewoong Oh","submitted_at":"2014-06-11T05:51:54Z","abstract_excerpt":"We study the problem of low-rank tensor factorization in the presence of missing data. We ask the following question: how many sampled entries do we need, to efficiently and exactly reconstruct a tensor with a low-rank orthogonal decomposition? We propose a novel alternating minimization based method which iteratively refines estimates of the singular vectors. We show that under certain standard assumptions, our method can recover a three-mode $n\\times n\\times n$ dimensional rank-$r$ tensor exactly from $O(n^{3/2} r^5 \\log^4 n)$ randomly sampled entries. In the process of proving this result, "},"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":"1406.2784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-11T05:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"9a78cfea6a823681a3192c5b9c19564b63ef4f0fcc65cceb0889cdd2e882ae78","abstract_canon_sha256":"65df24cd7ffc49c4f8afc9fb8c15ba87f9e9c7bfc54e566a50e7d84adc21f9bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:55.131904Z","signature_b64":"b52GMdJxdSklwBgVsJ3n9o51TRyueqJFZJ8eQRYbPrMvQRSaM/0Qt7CYd9IDyzHzpzQtFkRx9R+MxkFgqUiXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe0c10c81b0047ca9d8604e39ee8ade34640b7f3cbb46c2985e9135ec9055f7","last_reissued_at":"2026-05-18T02:49:55.131138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:55.131138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Tensor Factorization with Missing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Prateek Jain, Sewoong Oh","submitted_at":"2014-06-11T05:51:54Z","abstract_excerpt":"We study the problem of low-rank tensor factorization in the presence of missing data. We ask the following question: how many sampled entries do we need, to efficiently and exactly reconstruct a tensor with a low-rank orthogonal decomposition? We propose a novel alternating minimization based method which iteratively refines estimates of the singular vectors. We show that under certain standard assumptions, our method can recover a three-mode $n\\times n\\times n$ dimensional rank-$r$ tensor exactly from $O(n^{3/2} r^5 \\log^4 n)$ randomly sampled entries. In the process of proving this result, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2784","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":"1406.2784","created_at":"2026-05-18T02:49:55.131270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2784v1","created_at":"2026-05-18T02:49:55.131270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2784","created_at":"2026-05-18T02:49:55.131270+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7QMCDEBWACH","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7QMCDEBWACHZKOY","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7QMCDEB","created_at":"2026-05-18T12:28:28.263976+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/F7QMCDEBWACHZKOYMBHDT3UK3Y","json":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y.json","graph_json":"https://pith.science/api/pith-number/F7QMCDEBWACHZKOYMBHDT3UK3Y/graph.json","events_json":"https://pith.science/api/pith-number/F7QMCDEBWACHZKOYMBHDT3UK3Y/events.json","paper":"https://pith.science/paper/F7QMCDEB"},"agent_actions":{"view_html":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y","download_json":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y.json","view_paper":"https://pith.science/paper/F7QMCDEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2784&json=true","fetch_graph":"https://pith.science/api/pith-number/F7QMCDEBWACHZKOYMBHDT3UK3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/F7QMCDEBWACHZKOYMBHDT3UK3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y/action/storage_attestation","attest_author":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y/action/author_attestation","sign_citation":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y/action/citation_signature","submit_replication":"https://pith.science/pith/F7QMCDEBWACHZKOYMBHDT3UK3Y/action/replication_record"}},"created_at":"2026-05-18T02:49:55.131270+00:00","updated_at":"2026-05-18T02:49:55.131270+00:00"}