{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2KPEAG2XRD3DKNBO6WL2CP6ZI2","short_pith_number":"pith:2KPEAG2X","canonical_record":{"source":{"id":"1505.04780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-18T19:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"d98e1801600ef763c4b2c02cac22e6d98f4539cb94439d561ed4969bb400eac9","abstract_canon_sha256":"40dccbf251657c9aa09e33a97d540983fc123acb5fbac49d6fa50341249cc103"},"schema_version":"1.0"},"canonical_sha256":"d29e401b5788f635342ef597a13fd946bfb3559dd61ba38b0e62e4affa855e2a","source":{"kind":"arxiv","id":"1505.04780","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04780","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04780v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04780","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"2KPEAG2XRD3D","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KPEAG2XRD3DKNBO","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KPEAG2X","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2KPEAG2XRD3DKNBO6WL2CP6ZI2","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-18T19:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"d98e1801600ef763c4b2c02cac22e6d98f4539cb94439d561ed4969bb400eac9","abstract_canon_sha256":"40dccbf251657c9aa09e33a97d540983fc123acb5fbac49d6fa50341249cc103"},"schema_version":"1.0"},"canonical_sha256":"d29e401b5788f635342ef597a13fd946bfb3559dd61ba38b0e62e4affa855e2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:18.687811Z","signature_b64":"FwQ7eCZpcJEDA30IdSOvnkCN0ICi/Re34xO9y+VgdRLGQr1lxAs37GZdPTploh6+Hws4bu4ujckFp2umzsHgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d29e401b5788f635342ef597a13fd946bfb3559dd61ba38b0e62e4affa855e2a","last_reissued_at":"2026-05-18T01:37:18.687058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:18.687058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04780","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-18T01:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dm3x6qsjV90Wy/iNjxv/WoMKzoU7cE3vepNYk16WrEKXR6evgMSsjWpUS/QVsPJ5IUpdfogXZb0vuYDTrRaEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:52:41.051993Z"},"content_sha256":"534d4d358a2d1a31e06e6f28b8b65e89d72aa1dc5dd5a41058ac6dc6cb2a18f2","schema_version":"1.0","event_id":"sha256:534d4d358a2d1a31e06e6f28b8b65e89d72aa1dc5dd5a41058ac6dc6cb2a18f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2KPEAG2XRD3DKNBO6WL2CP6ZI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Huan Gui, Quanquan Gu","submitted_at":"2015-05-18T19:56:25Z","abstract_excerpt":"We present a unified framework for low-rank matrix estimation with nonconvex penalties. We first prove that the proposed estimator attains a faster statistical rate than the traditional low-rank matrix estimator with nuclear norm penalty. Moreover, we rigorously show that under a certain condition on the magnitude of the nonzero singular values, the proposed estimator enjoys oracle property (i.e., exactly recovers the true rank of the matrix), besides attaining a faster rate. As far as we know, this is the first work that establishes the theory of low-rank matrix estimation with nonconvex pena"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04780","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-18T01:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Pp0lQs77LSFwg3HjYKeL+bcNpbZt5O38pEP7JwT16z7NPj5C1l6LNdtNxJRCrkNHvMdTZtBrgXJ4KCIMRIkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:52:41.052635Z"},"content_sha256":"3d65953ec889f3cefe18ea368adf400dea14f76f3037ec38ad3db1fa22ac82f0","schema_version":"1.0","event_id":"sha256:3d65953ec889f3cefe18ea368adf400dea14f76f3037ec38ad3db1fa22ac82f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KPEAG2XRD3DKNBO6WL2CP6ZI2/bundle.json","state_url":"https://pith.science/pith/2KPEAG2XRD3DKNBO6WL2CP6ZI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KPEAG2XRD3DKNBO6WL2CP6ZI2/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-11T16:52:41Z","links":{"resolver":"https://pith.science/pith/2KPEAG2XRD3DKNBO6WL2CP6ZI2","bundle":"https://pith.science/pith/2KPEAG2XRD3DKNBO6WL2CP6ZI2/bundle.json","state":"https://pith.science/pith/2KPEAG2XRD3DKNBO6WL2CP6ZI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KPEAG2XRD3DKNBO6WL2CP6ZI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2KPEAG2XRD3DKNBO6WL2CP6ZI2","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":"40dccbf251657c9aa09e33a97d540983fc123acb5fbac49d6fa50341249cc103","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-18T19:56:25Z","title_canon_sha256":"d98e1801600ef763c4b2c02cac22e6d98f4539cb94439d561ed4969bb400eac9"},"schema_version":"1.0","source":{"id":"1505.04780","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04780","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04780v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04780","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"2KPEAG2XRD3D","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2KPEAG2XRD3DKNBO","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2KPEAG2X","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:3d65953ec889f3cefe18ea368adf400dea14f76f3037ec38ad3db1fa22ac82f0","target":"graph","created_at":"2026-05-18T01:37:18Z","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 present a unified framework for low-rank matrix estimation with nonconvex penalties. We first prove that the proposed estimator attains a faster statistical rate than the traditional low-rank matrix estimator with nuclear norm penalty. Moreover, we rigorously show that under a certain condition on the magnitude of the nonzero singular values, the proposed estimator enjoys oracle property (i.e., exactly recovers the true rank of the matrix), besides attaining a faster rate. As far as we know, this is the first work that establishes the theory of low-rank matrix estimation with nonconvex pena","authors_text":"Huan Gui, Quanquan Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-18T19:56:25Z","title":"Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04780","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:534d4d358a2d1a31e06e6f28b8b65e89d72aa1dc5dd5a41058ac6dc6cb2a18f2","target":"record","created_at":"2026-05-18T01:37:18Z","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":"40dccbf251657c9aa09e33a97d540983fc123acb5fbac49d6fa50341249cc103","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-18T19:56:25Z","title_canon_sha256":"d98e1801600ef763c4b2c02cac22e6d98f4539cb94439d561ed4969bb400eac9"},"schema_version":"1.0","source":{"id":"1505.04780","kind":"arxiv","version":2}},"canonical_sha256":"d29e401b5788f635342ef597a13fd946bfb3559dd61ba38b0e62e4affa855e2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d29e401b5788f635342ef597a13fd946bfb3559dd61ba38b0e62e4affa855e2a","first_computed_at":"2026-05-18T01:37:18.687058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:18.687058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FwQ7eCZpcJEDA30IdSOvnkCN0ICi/Re34xO9y+VgdRLGQr1lxAs37GZdPTploh6+Hws4bu4ujckFp2umzsHgCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:18.687811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04780","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:534d4d358a2d1a31e06e6f28b8b65e89d72aa1dc5dd5a41058ac6dc6cb2a18f2","sha256:3d65953ec889f3cefe18ea368adf400dea14f76f3037ec38ad3db1fa22ac82f0"],"state_sha256":"df5d9771df720bc222ec192f54918c011d98daa9841d7e38af83c0c5be5b3d00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmr6d60g5EfPR5clcvdNFJOepXOVVKBZy9V4NbnnFidGpV0leP2HU1paUNRpKvYmdsX+Tc0YiQ0yCH8IsitnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:52:41.056103Z","bundle_sha256":"0de1a2388c33e3489498fab21abf27b3858557d2332f2c2ba165be4620687dac"}}