{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:M4Y3RJ2PKPXDLY57BKGIOYKHSO","short_pith_number":"pith:M4Y3RJ2P","schema_version":"1.0","canonical_sha256":"6731b8a74f53ee35e3bf0a8c876147938dc369969753b6dd1d13bb45677e8100","source":{"kind":"arxiv","id":"1303.5647","version":1},"attestation_state":"computed","paper":{"title":"Sharp Variable Selection of a Sparse Submatrix in a High-Dimensional Noisy Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Cristina Butucea, Irina Suslina, Yuri I. Ingster","submitted_at":"2013-03-22T15:36:21Z","abstract_excerpt":"We observe a $N\\times M$ matrix of independent, identically distributed Gaussian random variables which are centered except for elements of some submatrix of size $n\\times m$ where the mean is larger than some $a>0$. The submatrix is sparse in the sense that $n/N$ and $m/M$ tend to 0, whereas $n,\\, m, \\, N$ and $M$ tend to infinity.\n  We consider the problem of selecting the random variables with significantly large mean values. We give sufficient conditions on $a$ as a function of $n,\\, m,\\,N$ and $M$ and construct a uniformly consistent procedure in order to do sharp variable selection. We a"},"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":"1303.5647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-03-22T15:36:21Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8c06d3b545654011e08638fb6cabb4033338aeaece224ecd8d15c1c7ceee503d","abstract_canon_sha256":"a21268b311f0e09a8ea6da09af0c20c0ce13305c244de3f25d32b36f66f5c991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:03.609181Z","signature_b64":"PXfIDj6Firky6fmfQTaFpKFX6q8Z/RoyxAMTNBDq4x43cxS9cHf+g7OF5fV1ryEwrKrQIMkM92B8Ldj4g2qlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6731b8a74f53ee35e3bf0a8c876147938dc369969753b6dd1d13bb45677e8100","last_reissued_at":"2026-05-18T03:30:03.608628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:03.608628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Variable Selection of a Sparse Submatrix in a High-Dimensional Noisy Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Cristina Butucea, Irina Suslina, Yuri I. Ingster","submitted_at":"2013-03-22T15:36:21Z","abstract_excerpt":"We observe a $N\\times M$ matrix of independent, identically distributed Gaussian random variables which are centered except for elements of some submatrix of size $n\\times m$ where the mean is larger than some $a>0$. The submatrix is sparse in the sense that $n/N$ and $m/M$ tend to 0, whereas $n,\\, m, \\, N$ and $M$ tend to infinity.\n  We consider the problem of selecting the random variables with significantly large mean values. We give sufficient conditions on $a$ as a function of $n,\\, m,\\,N$ and $M$ and construct a uniformly consistent procedure in order to do sharp variable selection. We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5647","kind":"arxiv","version":1},"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":"1303.5647","created_at":"2026-05-18T03:30:03.608732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5647v1","created_at":"2026-05-18T03:30:03.608732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5647","created_at":"2026-05-18T03:30:03.608732+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4Y3RJ2PKPXD","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4Y3RJ2PKPXDLY57","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4Y3RJ2P","created_at":"2026-05-18T12:27:51.066281+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/M4Y3RJ2PKPXDLY57BKGIOYKHSO","json":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO.json","graph_json":"https://pith.science/api/pith-number/M4Y3RJ2PKPXDLY57BKGIOYKHSO/graph.json","events_json":"https://pith.science/api/pith-number/M4Y3RJ2PKPXDLY57BKGIOYKHSO/events.json","paper":"https://pith.science/paper/M4Y3RJ2P"},"agent_actions":{"view_html":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO","download_json":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO.json","view_paper":"https://pith.science/paper/M4Y3RJ2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5647&json=true","fetch_graph":"https://pith.science/api/pith-number/M4Y3RJ2PKPXDLY57BKGIOYKHSO/graph.json","fetch_events":"https://pith.science/api/pith-number/M4Y3RJ2PKPXDLY57BKGIOYKHSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO/action/storage_attestation","attest_author":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO/action/author_attestation","sign_citation":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO/action/citation_signature","submit_replication":"https://pith.science/pith/M4Y3RJ2PKPXDLY57BKGIOYKHSO/action/replication_record"}},"created_at":"2026-05-18T03:30:03.608732+00:00","updated_at":"2026-05-18T03:30:03.608732+00:00"}