{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JX6INKTPUZUJCOH5ZJAXZS2QF5","short_pith_number":"pith:JX6INKTP","schema_version":"1.0","canonical_sha256":"4dfc86aa6fa6689138fdca417ccb502f7deb11c273d7b2192beca339ff5f8b36","source":{"kind":"arxiv","id":"2111.06302","version":1},"attestation_state":"computed","paper":{"title":"On Recovering the Best Rank-r Approximation from Few Entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Ming Yuan, Shun Xu","submitted_at":"2021-11-11T16:40:18Z","abstract_excerpt":"In this note, we investigate how well we can reconstruct the best rank-$r$ approximation of a large matrix from a small number of its entries. We show that even if a data matrix is of full rank and cannot be approximated well by a low-rank matrix, its best low-rank approximations may still be reliably computed or estimated from a small number of its entries. This is especially relevant from a statistical viewpoint: the best low-rank approximations to a data matrix are often of more interest than itself because they capture the more stable and oftentimes more reproducible properties of an other"},"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":"2111.06302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2021-11-11T16:40:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"595e3ff690da66444b28d50d5a12f7d01f77469adcf171f79e2811dd482d3a8b","abstract_canon_sha256":"25dd0e595d79549dd0a41d11338074bb33bbd01d3824e44115a056c0c92b449b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:00.174321Z","signature_b64":"d52znXyLlL2afv+WE/1kpxbNMjSarKhi0V6LBxFR5SlkWOQ2r5o2vcoUFr+uxFnNwVwTr0iVNvqhQWX++NNlAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dfc86aa6fa6689138fdca417ccb502f7deb11c273d7b2192beca339ff5f8b36","last_reissued_at":"2026-07-05T03:31:00.173974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:00.173974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Recovering the Best Rank-r Approximation from Few Entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Ming Yuan, Shun Xu","submitted_at":"2021-11-11T16:40:18Z","abstract_excerpt":"In this note, we investigate how well we can reconstruct the best rank-$r$ approximation of a large matrix from a small number of its entries. We show that even if a data matrix is of full rank and cannot be approximated well by a low-rank matrix, its best low-rank approximations may still be reliably computed or estimated from a small number of its entries. This is especially relevant from a statistical viewpoint: the best low-rank approximations to a data matrix are often of more interest than itself because they capture the more stable and oftentimes more reproducible properties of an other"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06302","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.06302/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.06302","created_at":"2026-07-05T03:31:00.174029+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06302v1","created_at":"2026-07-05T03:31:00.174029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06302","created_at":"2026-07-05T03:31:00.174029+00:00"},{"alias_kind":"pith_short_12","alias_value":"JX6INKTPUZUJ","created_at":"2026-07-05T03:31:00.174029+00:00"},{"alias_kind":"pith_short_16","alias_value":"JX6INKTPUZUJCOH5","created_at":"2026-07-05T03:31:00.174029+00:00"},{"alias_kind":"pith_short_8","alias_value":"JX6INKTP","created_at":"2026-07-05T03:31:00.174029+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/JX6INKTPUZUJCOH5ZJAXZS2QF5","json":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5.json","graph_json":"https://pith.science/api/pith-number/JX6INKTPUZUJCOH5ZJAXZS2QF5/graph.json","events_json":"https://pith.science/api/pith-number/JX6INKTPUZUJCOH5ZJAXZS2QF5/events.json","paper":"https://pith.science/paper/JX6INKTP"},"agent_actions":{"view_html":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5","download_json":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5.json","view_paper":"https://pith.science/paper/JX6INKTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06302&json=true","fetch_graph":"https://pith.science/api/pith-number/JX6INKTPUZUJCOH5ZJAXZS2QF5/graph.json","fetch_events":"https://pith.science/api/pith-number/JX6INKTPUZUJCOH5ZJAXZS2QF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5/action/storage_attestation","attest_author":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5/action/author_attestation","sign_citation":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5/action/citation_signature","submit_replication":"https://pith.science/pith/JX6INKTPUZUJCOH5ZJAXZS2QF5/action/replication_record"}},"created_at":"2026-07-05T03:31:00.174029+00:00","updated_at":"2026-07-05T03:31:00.174029+00:00"}