{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2HXF447FXJPQTWWFTKJRHTLPSZ","short_pith_number":"pith:2HXF447F","canonical_record":{"source":{"id":"1104.1244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-07T05:37:07Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6db61c759f6ff18a8077b3c42fd1d166c0ab07578963e9cb1e510e594c023a02","abstract_canon_sha256":"13ebd3bf158f13a4c5c043bfe727b943ce838847639b5de6d8d67d261226c465"},"schema_version":"1.0"},"canonical_sha256":"d1ee5e73e5ba5f09dac59a9313cd6f966987faec636183615770edc2f2e604e1","source":{"kind":"arxiv","id":"1104.1244","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1244","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1244v2","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1244","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"2HXF447FXJPQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2HXF447FXJPQTWWF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2HXF447F","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2HXF447FXJPQTWWFTKJRHTLPSZ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-07T05:37:07Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"6db61c759f6ff18a8077b3c42fd1d166c0ab07578963e9cb1e510e594c023a02","abstract_canon_sha256":"13ebd3bf158f13a4c5c043bfe727b943ce838847639b5de6d8d67d261226c465"},"schema_version":"1.0"},"canonical_sha256":"d1ee5e73e5ba5f09dac59a9313cd6f966987faec636183615770edc2f2e604e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:15.876497Z","signature_b64":"A70jSdJzVxQAOa+G6yZ8nCFfWsmyr9/kVBUSfZ2ylItiQfCwjHoEx8F2GALsKY3CHhItmOc7/qzyBB4xyblaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1ee5e73e5ba5f09dac59a9313cd6f966987faec636183615770edc2f2e604e1","last_reissued_at":"2026-05-18T04:13:15.876000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:15.876000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1244","source_version":2,"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-18T04:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1T9sufj9AtYK8Xwe+qKxyNDR82amf3QyQZSJVjnRz4Ghmc2svqkFDMEF9Aj4BPpNhZUmkhbNhyJp7t+jHgd2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:55:49.921778Z"},"content_sha256":"b9dac598ccba24833a1cea10d1c3087389bb38b766a546394e40bc9de5a5c836","schema_version":"1.0","event_id":"sha256:b9dac598ccba24833a1cea10d1c3087389bb38b766a546394e40bc9de5a5c836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2HXF447FXJPQTWWFTKJRHTLPSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank penalized estimators for high-dimensional matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"CEREMADE), Olga Klopp (CREST","submitted_at":"2011-04-07T05:37:07Z","abstract_excerpt":"In this paper we consider the trace regression model. Assume that we observe a small set of entries or linear combinations of entries of an unknown matrix $A_0$ corrupted by noise. We propose a new rank penalized estimator of $A_0$. For this estimator we establish general oracle inequality for the prediction error both in probability and in expectation. We also prove upper bounds for the rank of our estimator. Then, we apply our general results to the problems of matrix completion and matrix regression. In these cases our estimator has a particularly simple form: it is obtained by hard thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1244","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"},"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-18T04:13:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLbfW7e4LlcVOJkjxTJTl1aixOHn4tGp/6s73pi211XmnyQXrIO0VBxeDVurosCRUki/73K9pWNbQalXY5wBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:55:49.923143Z"},"content_sha256":"52a9b79be3da60aa0ea362459ce51d164b9a7f647082f7780a5b6df9646843ee","schema_version":"1.0","event_id":"sha256:52a9b79be3da60aa0ea362459ce51d164b9a7f647082f7780a5b6df9646843ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HXF447FXJPQTWWFTKJRHTLPSZ/bundle.json","state_url":"https://pith.science/pith/2HXF447FXJPQTWWFTKJRHTLPSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HXF447FXJPQTWWFTKJRHTLPSZ/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-05-25T17:55:49Z","links":{"resolver":"https://pith.science/pith/2HXF447FXJPQTWWFTKJRHTLPSZ","bundle":"https://pith.science/pith/2HXF447FXJPQTWWFTKJRHTLPSZ/bundle.json","state":"https://pith.science/pith/2HXF447FXJPQTWWFTKJRHTLPSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HXF447FXJPQTWWFTKJRHTLPSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2HXF447FXJPQTWWFTKJRHTLPSZ","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":"13ebd3bf158f13a4c5c043bfe727b943ce838847639b5de6d8d67d261226c465","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-07T05:37:07Z","title_canon_sha256":"6db61c759f6ff18a8077b3c42fd1d166c0ab07578963e9cb1e510e594c023a02"},"schema_version":"1.0","source":{"id":"1104.1244","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1244","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1244v2","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1244","created_at":"2026-05-18T04:13:15Z"},{"alias_kind":"pith_short_12","alias_value":"2HXF447FXJPQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2HXF447FXJPQTWWF","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2HXF447F","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:52a9b79be3da60aa0ea362459ce51d164b9a7f647082f7780a5b6df9646843ee","target":"graph","created_at":"2026-05-18T04:13:15Z","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":"In this paper we consider the trace regression model. Assume that we observe a small set of entries or linear combinations of entries of an unknown matrix $A_0$ corrupted by noise. We propose a new rank penalized estimator of $A_0$. For this estimator we establish general oracle inequality for the prediction error both in probability and in expectation. We also prove upper bounds for the rank of our estimator. Then, we apply our general results to the problems of matrix completion and matrix regression. In these cases our estimator has a particularly simple form: it is obtained by hard thresho","authors_text":"CEREMADE), Olga Klopp (CREST","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-07T05:37:07Z","title":"Rank penalized estimators for high-dimensional matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1244","kind":"arxiv","version":2},"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:b9dac598ccba24833a1cea10d1c3087389bb38b766a546394e40bc9de5a5c836","target":"record","created_at":"2026-05-18T04:13:15Z","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":"13ebd3bf158f13a4c5c043bfe727b943ce838847639b5de6d8d67d261226c465","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-04-07T05:37:07Z","title_canon_sha256":"6db61c759f6ff18a8077b3c42fd1d166c0ab07578963e9cb1e510e594c023a02"},"schema_version":"1.0","source":{"id":"1104.1244","kind":"arxiv","version":2}},"canonical_sha256":"d1ee5e73e5ba5f09dac59a9313cd6f966987faec636183615770edc2f2e604e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1ee5e73e5ba5f09dac59a9313cd6f966987faec636183615770edc2f2e604e1","first_computed_at":"2026-05-18T04:13:15.876000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:15.876000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A70jSdJzVxQAOa+G6yZ8nCFfWsmyr9/kVBUSfZ2ylItiQfCwjHoEx8F2GALsKY3CHhItmOc7/qzyBB4xyblaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:15.876497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1244","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9dac598ccba24833a1cea10d1c3087389bb38b766a546394e40bc9de5a5c836","sha256:52a9b79be3da60aa0ea362459ce51d164b9a7f647082f7780a5b6df9646843ee"],"state_sha256":"e03f2be0594894a309d403d9e437f39a3388bb99a94e715c41443b62089e1ea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZO98SvCb8fLxLwk6Q6S2Fxn+LZWpgl9Y6PtB2bIRW4O3KIBuL/ZfAsHLHFHSGUrOlSVPCiGScZEDC4nRsrmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:55:49.927384Z","bundle_sha256":"661272f0abbe0011e93381ade35a761d550c345aea27c0dfc58b46d35ec0ada8"}}