{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5XD4QFI5LHWNAUEXG4M7RVE323","short_pith_number":"pith:5XD4QFI5","schema_version":"1.0","canonical_sha256":"edc7c8151d59ecd050973719f8d49bd6cd5dd6bc009ebd4b5283ce777cfd75ca","source":{"kind":"arxiv","id":"1102.4807","version":3},"attestation_state":"computed","paper":{"title":"Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alekh Agarwal, Martin J. Wainwright, Sahand N. Negahban","submitted_at":"2011-02-23T18:02:53Z","abstract_excerpt":"We analyze a class of estimators based on convex relaxation for solving high-dimensional matrix decomposition problems. The observations are noisy realizations of a linear transformation $\\mathfrak{X}$ of the sum of an approximately) low rank matrix $\\Theta^\\star$ with a second matrix $\\Gamma^\\star$ endowed with a complementary form of low-dimensional structure; this set-up includes many statistical models of interest, including factor analysis, multi-task regression, and robust covariance estimation. We derive a general theorem that bounds the Frobenius norm error for an estimate of the pair "},"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":"1102.4807","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-23T18:02:53Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"097d08fd7d2f451be1e87195a68e0bb3c96712df5bd08219da513d125a6ac1db","abstract_canon_sha256":"83a8d0a39da831a88832615a1f8e8e2b571614275ea2a410554d8d2e781fa639"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:12.074128Z","signature_b64":"w88bcswOFdAGrTR5Pb8VLhZBm7rKXDFYMMkkk6VNXKTi87zML2y1Oo1QUf4/Qo78ps64S1r/kWsVjrvNZ+FGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edc7c8151d59ecd050973719f8d49bd6cd5dd6bc009ebd4b5283ce777cfd75ca","last_reissued_at":"2026-05-18T03:49:12.073432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:12.073432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Alekh Agarwal, Martin J. Wainwright, Sahand N. Negahban","submitted_at":"2011-02-23T18:02:53Z","abstract_excerpt":"We analyze a class of estimators based on convex relaxation for solving high-dimensional matrix decomposition problems. The observations are noisy realizations of a linear transformation $\\mathfrak{X}$ of the sum of an approximately) low rank matrix $\\Theta^\\star$ with a second matrix $\\Gamma^\\star$ endowed with a complementary form of low-dimensional structure; this set-up includes many statistical models of interest, including factor analysis, multi-task regression, and robust covariance estimation. We derive a general theorem that bounds the Frobenius norm error for an estimate of the pair "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4807","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":"1102.4807","created_at":"2026-05-18T03:49:12.073548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4807v3","created_at":"2026-05-18T03:49:12.073548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4807","created_at":"2026-05-18T03:49:12.073548+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XD4QFI5LHWN","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XD4QFI5LHWNAUEX","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XD4QFI5","created_at":"2026-05-18T12:26:22.705136+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/5XD4QFI5LHWNAUEXG4M7RVE323","json":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323.json","graph_json":"https://pith.science/api/pith-number/5XD4QFI5LHWNAUEXG4M7RVE323/graph.json","events_json":"https://pith.science/api/pith-number/5XD4QFI5LHWNAUEXG4M7RVE323/events.json","paper":"https://pith.science/paper/5XD4QFI5"},"agent_actions":{"view_html":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323","download_json":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323.json","view_paper":"https://pith.science/paper/5XD4QFI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4807&json=true","fetch_graph":"https://pith.science/api/pith-number/5XD4QFI5LHWNAUEXG4M7RVE323/graph.json","fetch_events":"https://pith.science/api/pith-number/5XD4QFI5LHWNAUEXG4M7RVE323/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/action/storage_attestation","attest_author":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/action/author_attestation","sign_citation":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/action/citation_signature","submit_replication":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/action/replication_record"}},"created_at":"2026-05-18T03:49:12.073548+00:00","updated_at":"2026-05-18T03:49:12.073548+00:00"}