{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3QNPPWEBMJVXOZM7ZPYRQQ76QL","short_pith_number":"pith:3QNPPWEB","canonical_record":{"source":{"id":"2605.09569","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-10T14:30:16Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"839f1e727bba7c907093c5eb87d084f14a2646fc712f58be3c197ea9ed377b21","abstract_canon_sha256":"bc667bb6be18089ff92aa68fa8e419ee3536c5100c19d3992032ce80c86329a2"},"schema_version":"1.0"},"canonical_sha256":"dc1af7d881626b77659fcbf11843fe82fe77a8c1cebdd92be882368d462c4c7d","source":{"kind":"arxiv","id":"2605.09569","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09569","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09569v2","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09569","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"3QNPPWEBMJVX","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"pith_short_16","alias_value":"3QNPPWEBMJVXOZM7","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"pith_short_8","alias_value":"3QNPPWEB","created_at":"2026-05-20T01:05:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3QNPPWEBMJVXOZM7ZPYRQQ76QL","target":"record","payload":{"canonical_record":{"source":{"id":"2605.09569","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-10T14:30:16Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"839f1e727bba7c907093c5eb87d084f14a2646fc712f58be3c197ea9ed377b21","abstract_canon_sha256":"bc667bb6be18089ff92aa68fa8e419ee3536c5100c19d3992032ce80c86329a2"},"schema_version":"1.0"},"canonical_sha256":"dc1af7d881626b77659fcbf11843fe82fe77a8c1cebdd92be882368d462c4c7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:16.227565Z","signature_b64":"Wsrs9LO3GE3Tk9lQ5t10ry9u0YGGW40jziVXYDK01xPH/LR+PuY1XQhI56Pu2/JOgXBvopTz+0sVvyMqAmsiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc1af7d881626b77659fcbf11843fe82fe77a8c1cebdd92be882368d462c4c7d","last_reissued_at":"2026-05-20T01:05:16.226897Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:16.226897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.09569","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-20T01:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vt+rjVeaCfjF1PCwkCx9/J2CRXiDSmNCHT2FKBcbs1QbNhkBcZZqfurxR75PtpHaqefnYtwvJnuXS2Asj+8DCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:41:58.667971Z"},"content_sha256":"10e5659add44b919d5592487e326b6375f77f7018293b9f768c460ec191ab0f7","schema_version":"1.0","event_id":"sha256:10e5659add44b919d5592487e326b6375f77f7018293b9f768c460ec191ab0f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3QNPPWEBMJVXOZM7ZPYRQQ76QL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax optimal submatrix detection: Sharp non-asymptotic rates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Matching non-asymptotic bounds establish the exact minimal signal strength needed to detect a hidden submatrix in any Gaussian matrix.","cross_cats":["cs.IT","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Julien Chhor, Parker Knight","submitted_at":"2026-05-10T14:30:16Z","abstract_excerpt":"Given an observation $\\mathbf Y \\in \\mathbb{R}^{d_1\\times d_2}$ from the model $\\mathbf Y = \\mathbf X + \\mathbf E$ where $\\mathbf X$ is constant and $\\mathbf E$ has i.i.d. $N(0,1)$ entries, we consider the problem of detecting a planted submatrix in the mean matrix $\\mathbf X$. Specifically, we aim to distinguish the null hypothesis $\\mathbf X = 0$ from the alternative hypothesis in which $\\mathbf X$ is non-zero only on a submatrix of size $s_1 \\times s_2$ with elevated entries bounded below by $\\mu>0$. We establish a minimax lower bound characterizing how large $\\mu$ must be to ensure that th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We provide non-asymptotic upper and lower bounds on the smallest signal strength μ* that is both necessary and sufficient to ensure the existence of a test with small enough Type I and Type II errors. Our non-asymptotic upper and lower bounds match for any configuration of these parameters.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The observed matrix has i.i.d. N(0,1) entries under the null and a contiguous s1 × s2 submatrix with i.i.d. N(μ,1) entries under the alternative, with all other entries N(0,1).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Sharp non-asymptotic minimax rates are derived for submatrix detection in Gaussian matrices, with matching upper and lower bounds on the critical signal strength μ* for all parameter configurations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Matching non-asymptotic bounds establish the exact minimal signal strength needed to detect a hidden submatrix in any Gaussian matrix.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5a8c89e165a9be4171f2e0a7ac6407aa6d0a94725f63e9d22a8688797aa79f51"},"source":{"id":"2605.09569","kind":"arxiv","version":2},"verdict":{"id":"60d9b1b5-9abe-462a-aab6-20dac0939131","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T02:20:52.876293Z","strongest_claim":"We provide non-asymptotic upper and lower bounds on the smallest signal strength μ* that is both necessary and sufficient to ensure the existence of a test with small enough Type I and Type II errors. Our non-asymptotic upper and lower bounds match for any configuration of these parameters.","one_line_summary":"Sharp non-asymptotic minimax rates are derived for submatrix detection in Gaussian matrices, with matching upper and lower bounds on the critical signal strength μ* for all parameter configurations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The observed matrix has i.i.d. N(0,1) entries under the null and a contiguous s1 × s2 submatrix with i.i.d. N(μ,1) entries under the alternative, with all other entries N(0,1).","pith_extraction_headline":"Matching non-asymptotic bounds establish the exact minimal signal strength needed to detect a hidden submatrix in any Gaussian matrix."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.09569/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T16:39:41.298049Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T13:01:17.492952Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T10:08:51.228050Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9e80a39175834381773e60aec3aa52d17f4d42d2c4d03beb56f22a821a8997eb"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b5aeb00fabb61b9120191cfa90fe1f5ce05b7bf264e0dac833f14d6c93afdfb5"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"60d9b1b5-9abe-462a-aab6-20dac0939131"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"depyOOyFcqWpjFnVt9ZZeJkYgATl5du4JHKcsiAuYoFiVVy6/3D1x7LYfbMflv/65b5EowzYF2438CCDX9iBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:41:58.669001Z"},"content_sha256":"097ef4fb7cdff600d44871c9e585ca54c4c4653a148dd6c5a5e57d4f49ec154a","schema_version":"1.0","event_id":"sha256:097ef4fb7cdff600d44871c9e585ca54c4c4653a148dd6c5a5e57d4f49ec154a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QNPPWEBMJVXOZM7ZPYRQQ76QL/bundle.json","state_url":"https://pith.science/pith/3QNPPWEBMJVXOZM7ZPYRQQ76QL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QNPPWEBMJVXOZM7ZPYRQQ76QL/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-30T10:41:58Z","links":{"resolver":"https://pith.science/pith/3QNPPWEBMJVXOZM7ZPYRQQ76QL","bundle":"https://pith.science/pith/3QNPPWEBMJVXOZM7ZPYRQQ76QL/bundle.json","state":"https://pith.science/pith/3QNPPWEBMJVXOZM7ZPYRQQ76QL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QNPPWEBMJVXOZM7ZPYRQQ76QL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3QNPPWEBMJVXOZM7ZPYRQQ76QL","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":"bc667bb6be18089ff92aa68fa8e419ee3536c5100c19d3992032ce80c86329a2","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-10T14:30:16Z","title_canon_sha256":"839f1e727bba7c907093c5eb87d084f14a2646fc712f58be3c197ea9ed377b21"},"schema_version":"1.0","source":{"id":"2605.09569","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.09569","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.09569v2","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.09569","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"3QNPPWEBMJVX","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"pith_short_16","alias_value":"3QNPPWEBMJVXOZM7","created_at":"2026-05-20T01:05:16Z"},{"alias_kind":"pith_short_8","alias_value":"3QNPPWEB","created_at":"2026-05-20T01:05:16Z"}],"graph_snapshots":[{"event_id":"sha256:097ef4fb7cdff600d44871c9e585ca54c4c4653a148dd6c5a5e57d4f49ec154a","target":"graph","created_at":"2026-05-20T01:05:16Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We provide non-asymptotic upper and lower bounds on the smallest signal strength μ* that is both necessary and sufficient to ensure the existence of a test with small enough Type I and Type II errors. Our non-asymptotic upper and lower bounds match for any configuration of these parameters."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The observed matrix has i.i.d. N(0,1) entries under the null and a contiguous s1 × s2 submatrix with i.i.d. N(μ,1) entries under the alternative, with all other entries N(0,1)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Sharp non-asymptotic minimax rates are derived for submatrix detection in Gaussian matrices, with matching upper and lower bounds on the critical signal strength μ* for all parameter configurations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Matching non-asymptotic bounds establish the exact minimal signal strength needed to detect a hidden submatrix in any Gaussian matrix."}],"snapshot_sha256":"5a8c89e165a9be4171f2e0a7ac6407aa6d0a94725f63e9d22a8688797aa79f51"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b5aeb00fabb61b9120191cfa90fe1f5ce05b7bf264e0dac833f14d6c93afdfb5"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T16:39:41.298049Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T13:01:17.492952Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T10:08:51.228050Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.09569/integrity.json","findings":[],"snapshot_sha256":"9e80a39175834381773e60aec3aa52d17f4d42d2c4d03beb56f22a821a8997eb","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given an observation $\\mathbf Y \\in \\mathbb{R}^{d_1\\times d_2}$ from the model $\\mathbf Y = \\mathbf X + \\mathbf E$ where $\\mathbf X$ is constant and $\\mathbf E$ has i.i.d. $N(0,1)$ entries, we consider the problem of detecting a planted submatrix in the mean matrix $\\mathbf X$. Specifically, we aim to distinguish the null hypothesis $\\mathbf X = 0$ from the alternative hypothesis in which $\\mathbf X$ is non-zero only on a submatrix of size $s_1 \\times s_2$ with elevated entries bounded below by $\\mu>0$. We establish a minimax lower bound characterizing how large $\\mu$ must be to ensure that th","authors_text":"Julien Chhor, Parker Knight","cross_cats":["cs.IT","math.IT","stat.ML","stat.TH"],"headline":"Matching non-asymptotic bounds establish the exact minimal signal strength needed to detect a hidden submatrix in any Gaussian matrix.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-10T14:30:16Z","title":"Minimax optimal submatrix detection: Sharp non-asymptotic rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.09569","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T02:20:52.876293Z","id":"60d9b1b5-9abe-462a-aab6-20dac0939131","model_set":{"reader":"grok-4.3"},"one_line_summary":"Sharp non-asymptotic minimax rates are derived for submatrix detection in Gaussian matrices, with matching upper and lower bounds on the critical signal strength μ* for all parameter configurations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Matching non-asymptotic bounds establish the exact minimal signal strength needed to detect a hidden submatrix in any Gaussian matrix.","strongest_claim":"We provide non-asymptotic upper and lower bounds on the smallest signal strength μ* that is both necessary and sufficient to ensure the existence of a test with small enough Type I and Type II errors. Our non-asymptotic upper and lower bounds match for any configuration of these parameters.","weakest_assumption":"The observed matrix has i.i.d. N(0,1) entries under the null and a contiguous s1 × s2 submatrix with i.i.d. N(μ,1) entries under the alternative, with all other entries N(0,1)."}},"verdict_id":"60d9b1b5-9abe-462a-aab6-20dac0939131"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:10e5659add44b919d5592487e326b6375f77f7018293b9f768c460ec191ab0f7","target":"record","created_at":"2026-05-20T01:05:16Z","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":"bc667bb6be18089ff92aa68fa8e419ee3536c5100c19d3992032ce80c86329a2","cross_cats_sorted":["cs.IT","math.IT","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-10T14:30:16Z","title_canon_sha256":"839f1e727bba7c907093c5eb87d084f14a2646fc712f58be3c197ea9ed377b21"},"schema_version":"1.0","source":{"id":"2605.09569","kind":"arxiv","version":2}},"canonical_sha256":"dc1af7d881626b77659fcbf11843fe82fe77a8c1cebdd92be882368d462c4c7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc1af7d881626b77659fcbf11843fe82fe77a8c1cebdd92be882368d462c4c7d","first_computed_at":"2026-05-20T01:05:16.226897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:16.226897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wsrs9LO3GE3Tk9lQ5t10ry9u0YGGW40jziVXYDK01xPH/LR+PuY1XQhI56Pu2/JOgXBvopTz+0sVvyMqAmsiCA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:16.227565Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.09569","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10e5659add44b919d5592487e326b6375f77f7018293b9f768c460ec191ab0f7","sha256:097ef4fb7cdff600d44871c9e585ca54c4c4653a148dd6c5a5e57d4f49ec154a"],"state_sha256":"461561cdcf1a5ff99bfc4bd014651e8b748a80bc6f7c248671edc90df52530ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IESAMdnvQsi479ZJZVXeJRKEFW/WAx5jRW1U3+cftUoERsak//djt80+QDO/A2PGNNFaUoynGpny38KYmMo2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:41:58.676654Z","bundle_sha256":"65b2e1c2cbb6a192cb605faedb34c908491852f8ed8bdda564c144704bff8a6b"}}