{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:A647EPAYYR4KWFMJBC5NOSULVJ","short_pith_number":"pith:A647EPAY","canonical_record":{"source":{"id":"1502.04654","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T18:17:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"3bb268b302adad4d7f125c3e71420559d76e079bc0337196c00382b21dc4228c","abstract_canon_sha256":"8d714fc093f1ab933030976eac2071099e096961e45686b68db439eac0fc124c"},"schema_version":"1.0"},"canonical_sha256":"07b9f23c18c478ab158908bad74a8baa439a92f7a6a9ac00cff85cba0371b318","source":{"kind":"arxiv","id":"1502.04654","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04654","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04654v3","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04654","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"A647EPAYYR4K","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A647EPAYYR4KWFMJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A647EPAY","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:A647EPAYYR4KWFMJBC5NOSULVJ","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04654","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T18:17:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"3bb268b302adad4d7f125c3e71420559d76e079bc0337196c00382b21dc4228c","abstract_canon_sha256":"8d714fc093f1ab933030976eac2071099e096961e45686b68db439eac0fc124c"},"schema_version":"1.0"},"canonical_sha256":"07b9f23c18c478ab158908bad74a8baa439a92f7a6a9ac00cff85cba0371b318","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:48.603586Z","signature_b64":"FkKQJwAc45BsU9Dt2UhYukRyAqBzwMPfO2RNU1s8zchpxG4nzoWS3Q/dAvsETc/kC3LyXI2p1N96HSkFwl4+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07b9f23c18c478ab158908bad74a8baa439a92f7a6a9ac00cff85cba0371b318","last_reissued_at":"2026-05-18T01:19:48.603057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:48.603057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04654","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-18T01:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nbQeUxuM6u4h/ayYH0pL+AogghHVPnvl7pCtFCRSA5alypeduKj5imTy7twGphgHNIEeRmmk/c4COQIjl0zBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:32:02.110414Z"},"content_sha256":"cd4895a0b269b0f836f0ed603f67aafbbc1cc3785e5ad08a4aa1c89a625f3c50","schema_version":"1.0","event_id":"sha256:cd4895a0b269b0f836f0ed603f67aafbbc1cc3785e5ad08a4aa1c89a625f3c50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:A647EPAYYR4KWFMJBC5NOSULVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An iterative hard thresholding estimator for low rank matrix recovery with explicit limiting distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandra Carpentier, Arlene K. H. Kim","submitted_at":"2015-02-16T18:17:43Z","abstract_excerpt":"We consider the problem of low rank matrix recovery in a stochastically noisy high dimensional setting. We propose a new estimator for the low rank matrix, based on the iterative hard thresholding method, and that is computationally efficient and simple. We prove that our estimator is efficient both in terms of the Frobenius risk, and in terms of the entry-wise risk uniformly over any change of orthonormal basis. This result allows us, in the case where the design is Gaussian, to provide the limiting distribution of the estimator, which is of great interest for constructing tests and confidenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04654","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-18T01:19:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kQ0YPD8iR0WVOOay8fs80qaoBMvLT11TIcjbiLtppQH7DFqV8tBG3Kwvw3eqnzSlz6V1DWU5xF0vZIix9UkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:32:02.110827Z"},"content_sha256":"503c845793551cabbc62bc630a492483f4e8967a08dd9239cde31b7ef916833c","schema_version":"1.0","event_id":"sha256:503c845793551cabbc62bc630a492483f4e8967a08dd9239cde31b7ef916833c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A647EPAYYR4KWFMJBC5NOSULVJ/bundle.json","state_url":"https://pith.science/pith/A647EPAYYR4KWFMJBC5NOSULVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A647EPAYYR4KWFMJBC5NOSULVJ/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-27T05:32:02Z","links":{"resolver":"https://pith.science/pith/A647EPAYYR4KWFMJBC5NOSULVJ","bundle":"https://pith.science/pith/A647EPAYYR4KWFMJBC5NOSULVJ/bundle.json","state":"https://pith.science/pith/A647EPAYYR4KWFMJBC5NOSULVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A647EPAYYR4KWFMJBC5NOSULVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:A647EPAYYR4KWFMJBC5NOSULVJ","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":"8d714fc093f1ab933030976eac2071099e096961e45686b68db439eac0fc124c","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T18:17:43Z","title_canon_sha256":"3bb268b302adad4d7f125c3e71420559d76e079bc0337196c00382b21dc4228c"},"schema_version":"1.0","source":{"id":"1502.04654","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04654","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04654v3","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04654","created_at":"2026-05-18T01:19:48Z"},{"alias_kind":"pith_short_12","alias_value":"A647EPAYYR4K","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"A647EPAYYR4KWFMJ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"A647EPAY","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:503c845793551cabbc62bc630a492483f4e8967a08dd9239cde31b7ef916833c","target":"graph","created_at":"2026-05-18T01:19:48Z","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 consider the problem of low rank matrix recovery in a stochastically noisy high dimensional setting. We propose a new estimator for the low rank matrix, based on the iterative hard thresholding method, and that is computationally efficient and simple. We prove that our estimator is efficient both in terms of the Frobenius risk, and in terms of the entry-wise risk uniformly over any change of orthonormal basis. This result allows us, in the case where the design is Gaussian, to provide the limiting distribution of the estimator, which is of great interest for constructing tests and confidenc","authors_text":"Alexandra Carpentier, Arlene K. H. Kim","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T18:17:43Z","title":"An iterative hard thresholding estimator for low rank matrix recovery with explicit limiting distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04654","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:cd4895a0b269b0f836f0ed603f67aafbbc1cc3785e5ad08a4aa1c89a625f3c50","target":"record","created_at":"2026-05-18T01:19:48Z","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":"8d714fc093f1ab933030976eac2071099e096961e45686b68db439eac0fc124c","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-16T18:17:43Z","title_canon_sha256":"3bb268b302adad4d7f125c3e71420559d76e079bc0337196c00382b21dc4228c"},"schema_version":"1.0","source":{"id":"1502.04654","kind":"arxiv","version":3}},"canonical_sha256":"07b9f23c18c478ab158908bad74a8baa439a92f7a6a9ac00cff85cba0371b318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07b9f23c18c478ab158908bad74a8baa439a92f7a6a9ac00cff85cba0371b318","first_computed_at":"2026-05-18T01:19:48.603057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:48.603057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FkKQJwAc45BsU9Dt2UhYukRyAqBzwMPfO2RNU1s8zchpxG4nzoWS3Q/dAvsETc/kC3LyXI2p1N96HSkFwl4+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:48.603586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04654","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd4895a0b269b0f836f0ed603f67aafbbc1cc3785e5ad08a4aa1c89a625f3c50","sha256:503c845793551cabbc62bc630a492483f4e8967a08dd9239cde31b7ef916833c"],"state_sha256":"fda639dd85196f48f4ed9658c5310d556be556f70164b4f7a56ae7f070a58156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QtVJb3JPGYvlm7JY1BS/0X+u/BjU+GVMKs2koetuueeQWpylXtWa9NZfIWr5kihLPqZ+VVN1G9Dpqgf5w52SCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:32:02.114061Z","bundle_sha256":"1669e0a6f7663ed0a2043da2d0b7014207926092ef355bfe48ea02d79c4d678c"}}