{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3BRP2MVSGF7R5ELDEHEB25LUWL","short_pith_number":"pith:3BRP2MVS","schema_version":"1.0","canonical_sha256":"d862fd32b2317f1e916321c81d7574b2dce3505736a46bfe7155ecbf02617678","source":{"kind":"arxiv","id":"1611.01129","version":2},"attestation_state":"computed","paper":{"title":"Cross: Efficient Low-rank Tensor Completion","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Anru Zhang","submitted_at":"2016-11-03T19:02:02Z","abstract_excerpt":"The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries, and the required number of measurements to achieve recovery is not guaranteed to be optimal. In addition, the implementation of some previous methods is NP-hard. In this article, we propose a framework for low-rank tensor completion via a novel tensor measurement scheme we name Cross. The proposed procedure is efficient and easy to implement. In particular, we show that a thir"},"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":"1611.01129","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2016-11-03T19:02:02Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"f44309a15a8e015e06cc6adc00848bda65067ec9b8224626bd7c56cbe26bf8fe","abstract_canon_sha256":"a5599f602c2d6ecfc18fe18e56194341b0e00e9a9dc81629f7bc1f5fd8f74057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:54.013802Z","signature_b64":"yxRdRt5imM5T3EpjJTs8jF9ONRNAtDA6A3s/jYSUPQCc8A0KoLUtfTIhlxg7jL8Mkpi7nfxOmJPcPNhQ1ZtdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d862fd32b2317f1e916321c81d7574b2dce3505736a46bfe7155ecbf02617678","last_reissued_at":"2026-05-17T23:59:54.013273Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:54.013273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross: Efficient Low-rank Tensor Completion","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Anru Zhang","submitted_at":"2016-11-03T19:02:02Z","abstract_excerpt":"The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries, and the required number of measurements to achieve recovery is not guaranteed to be optimal. In addition, the implementation of some previous methods is NP-hard. In this article, we propose a framework for low-rank tensor completion via a novel tensor measurement scheme we name Cross. The proposed procedure is efficient and easy to implement. In particular, we show that a thir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01129","kind":"arxiv","version":2},"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":"1611.01129","created_at":"2026-05-17T23:59:54.013368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01129v2","created_at":"2026-05-17T23:59:54.013368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01129","created_at":"2026-05-17T23:59:54.013368+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BRP2MVSGF7R","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BRP2MVSGF7R5ELD","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BRP2MVS","created_at":"2026-05-18T12:29:55.572404+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/3BRP2MVSGF7R5ELDEHEB25LUWL","json":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL.json","graph_json":"https://pith.science/api/pith-number/3BRP2MVSGF7R5ELDEHEB25LUWL/graph.json","events_json":"https://pith.science/api/pith-number/3BRP2MVSGF7R5ELDEHEB25LUWL/events.json","paper":"https://pith.science/paper/3BRP2MVS"},"agent_actions":{"view_html":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL","download_json":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL.json","view_paper":"https://pith.science/paper/3BRP2MVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01129&json=true","fetch_graph":"https://pith.science/api/pith-number/3BRP2MVSGF7R5ELDEHEB25LUWL/graph.json","fetch_events":"https://pith.science/api/pith-number/3BRP2MVSGF7R5ELDEHEB25LUWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/action/storage_attestation","attest_author":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/action/author_attestation","sign_citation":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/action/citation_signature","submit_replication":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/action/replication_record"}},"created_at":"2026-05-17T23:59:54.013368+00:00","updated_at":"2026-05-17T23:59:54.013368+00:00"}