{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5XD4QFI5LHWNAUEXG4M7RVE323","short_pith_number":"pith:5XD4QFI5","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"},"canonical_sha256":"edc7c8151d59ecd050973719f8d49bd6cd5dd6bc009ebd4b5283ce777cfd75ca","source":{"kind":"arxiv","id":"1102.4807","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4807","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4807v3","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4807","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"pith_short_12","alias_value":"5XD4QFI5LHWN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5XD4QFI5LHWNAUEX","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5XD4QFI5","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5XD4QFI5LHWNAUEXG4M7RVE323","target":"record","payload":{"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"},"canonical_sha256":"edc7c8151d59ecd050973719f8d49bd6cd5dd6bc009ebd4b5283ce777cfd75ca","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"},"source_kind":"arxiv","source_id":"1102.4807","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fk6jPNwGMEuaqq6HEoZ1nb2OFktzyyTTagnfjuGGYCi2XInbfax/S+Z5+cao5H4h87bD4Wu7wSCcHassplSbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:29:48.832218Z"},"content_sha256":"74f9e6ed3856ba67bb2ac42bbd45f35edea07e49916301f770b1c4e6e9df9743","schema_version":"1.0","event_id":"sha256:74f9e6ed3856ba67bb2ac42bbd45f35edea07e49916301f770b1c4e6e9df9743"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5XD4QFI5LHWNAUEXG4M7RVE323","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/jyGtcCCyaOdnCNbmLoroxvKVIb0L/jhaguEuZ1TH2+pTpkAFl6h0wk0n/h7OGSuIYuH/e23/i55hSIC7MWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:29:48.832581Z"},"content_sha256":"c8a6d7fa5982665a22c8d7fd423d748171e38bf560df2d6742ed0f6f0bf488da","schema_version":"1.0","event_id":"sha256:c8a6d7fa5982665a22c8d7fd423d748171e38bf560df2d6742ed0f6f0bf488da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/bundle.json","state_url":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XD4QFI5LHWNAUEXG4M7RVE323/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T21:29:48Z","links":{"resolver":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323","bundle":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/bundle.json","state":"https://pith.science/pith/5XD4QFI5LHWNAUEXG4M7RVE323/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XD4QFI5LHWNAUEXG4M7RVE323/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5XD4QFI5LHWNAUEXG4M7RVE323","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"83a8d0a39da831a88832615a1f8e8e2b571614275ea2a410554d8d2e781fa639","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-23T18:02:53Z","title_canon_sha256":"097d08fd7d2f451be1e87195a68e0bb3c96712df5bd08219da513d125a6ac1db"},"schema_version":"1.0","source":{"id":"1102.4807","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4807","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4807v3","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4807","created_at":"2026-05-18T03:49:12Z"},{"alias_kind":"pith_short_12","alias_value":"5XD4QFI5LHWN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5XD4QFI5LHWNAUEX","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5XD4QFI5","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:c8a6d7fa5982665a22c8d7fd423d748171e38bf560df2d6742ed0f6f0bf488da","target":"graph","created_at":"2026-05-18T03:49:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alekh Agarwal, Martin J. Wainwright, Sahand N. Negahban","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-23T18:02:53Z","title":"Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4807","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:74f9e6ed3856ba67bb2ac42bbd45f35edea07e49916301f770b1c4e6e9df9743","target":"record","created_at":"2026-05-18T03:49:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"83a8d0a39da831a88832615a1f8e8e2b571614275ea2a410554d8d2e781fa639","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-02-23T18:02:53Z","title_canon_sha256":"097d08fd7d2f451be1e87195a68e0bb3c96712df5bd08219da513d125a6ac1db"},"schema_version":"1.0","source":{"id":"1102.4807","kind":"arxiv","version":3}},"canonical_sha256":"edc7c8151d59ecd050973719f8d49bd6cd5dd6bc009ebd4b5283ce777cfd75ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edc7c8151d59ecd050973719f8d49bd6cd5dd6bc009ebd4b5283ce777cfd75ca","first_computed_at":"2026-05-18T03:49:12.073432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:12.073432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w88bcswOFdAGrTR5Pb8VLhZBm7rKXDFYMMkkk6VNXKTi87zML2y1Oo1QUf4/Qo78ps64S1r/kWsVjrvNZ+FGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:12.074128Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4807","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74f9e6ed3856ba67bb2ac42bbd45f35edea07e49916301f770b1c4e6e9df9743","sha256:c8a6d7fa5982665a22c8d7fd423d748171e38bf560df2d6742ed0f6f0bf488da"],"state_sha256":"ee244052fa8d9226ce1f25d6d04edd8eb310708991f5f7657fe2b943cd22a245"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibz7ZHa6D7U0Ir/DUTIQSkZWo4MBrdH+Mx+Tb/Iv8FuddybZ3B2fY00tvBx2N55y2qO8d0iKwRhY8YMIiYljAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:29:48.834521Z","bundle_sha256":"a77c36afc6003e410290b8e61709a682216e2da7d46f19c6e3e51fb6ea63f3a9"}}