{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:QEBTIT5FMVGKJXXIWDY2MZSONR","short_pith_number":"pith:QEBTIT5F","schema_version":"1.0","canonical_sha256":"8103344fa5654ca4dee8b0f1a6664e6c4197d4bec12b0d4ec48d796ea2d08bfd","source":{"kind":"arxiv","id":"0912.5338","version":5},"attestation_state":"computed","paper":{"title":"Estimation of high-dimensional low-rank matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre B. Tsybakov, Angelika Rohde","submitted_at":"2009-12-29T17:11:08Z","abstract_excerpt":"Suppose that we observe entries or, more generally, linear combinations of entries of an unknown $m\\times T$-matrix $A$ corrupted by noise. We are particularly interested in the high-dimensional setting where the number $mT$ of unknown entries can be much larger than the sample size $N$. Motivated by several applications, we consider estimation of matrix $A$ under the assumption that it has small rank. This can be viewed as dimension reduction or sparsity assumption. In order to shrink toward a low-rank representation, we investigate penalized least squares estimators with a Schatten-$p$ quasi"},"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":"0912.5338","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2009-12-29T17:11:08Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2f94e2b5116b90f943f968b56dfba58354ede8fca9e0f4229a3b1bd70cb335be","abstract_canon_sha256":"e4e55999725aa67bcce6c29e1177530437a3ab2807f9d1b940c9cf0cfe3f80d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:10.322018Z","signature_b64":"QeI2ntMGhEz059TD622hQVZxs8fcZeMY1KvL3xQsnrPzVhia49Ruc+hK/CdscRtd1oEtZy5JX9G9BGhKih67Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8103344fa5654ca4dee8b0f1a6664e6c4197d4bec12b0d4ec48d796ea2d08bfd","last_reissued_at":"2026-05-18T04:22:10.321516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:10.321516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimation of high-dimensional low-rank matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre B. Tsybakov, Angelika Rohde","submitted_at":"2009-12-29T17:11:08Z","abstract_excerpt":"Suppose that we observe entries or, more generally, linear combinations of entries of an unknown $m\\times T$-matrix $A$ corrupted by noise. We are particularly interested in the high-dimensional setting where the number $mT$ of unknown entries can be much larger than the sample size $N$. Motivated by several applications, we consider estimation of matrix $A$ under the assumption that it has small rank. This can be viewed as dimension reduction or sparsity assumption. In order to shrink toward a low-rank representation, we investigate penalized least squares estimators with a Schatten-$p$ quasi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.5338","kind":"arxiv","version":5},"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":"0912.5338","created_at":"2026-05-18T04:22:10.321608+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.5338v5","created_at":"2026-05-18T04:22:10.321608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.5338","created_at":"2026-05-18T04:22:10.321608+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEBTIT5FMVGK","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEBTIT5FMVGKJXXI","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEBTIT5F","created_at":"2026-05-18T12:26:01.383474+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/QEBTIT5FMVGKJXXIWDY2MZSONR","json":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR.json","graph_json":"https://pith.science/api/pith-number/QEBTIT5FMVGKJXXIWDY2MZSONR/graph.json","events_json":"https://pith.science/api/pith-number/QEBTIT5FMVGKJXXIWDY2MZSONR/events.json","paper":"https://pith.science/paper/QEBTIT5F"},"agent_actions":{"view_html":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR","download_json":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR.json","view_paper":"https://pith.science/paper/QEBTIT5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.5338&json=true","fetch_graph":"https://pith.science/api/pith-number/QEBTIT5FMVGKJXXIWDY2MZSONR/graph.json","fetch_events":"https://pith.science/api/pith-number/QEBTIT5FMVGKJXXIWDY2MZSONR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR/action/storage_attestation","attest_author":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR/action/author_attestation","sign_citation":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR/action/citation_signature","submit_replication":"https://pith.science/pith/QEBTIT5FMVGKJXXIWDY2MZSONR/action/replication_record"}},"created_at":"2026-05-18T04:22:10.321608+00:00","updated_at":"2026-05-18T04:22:10.321608+00:00"}