{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KH6MOMD2FMKUFO5GHKMWPSVMET","short_pith_number":"pith:KH6MOMD2","schema_version":"1.0","canonical_sha256":"51fcc7307a2b1542bba63a9967caac24ddb756c5f5285da5157bf23cbd398b54","source":{"kind":"arxiv","id":"1211.2284","version":2},"attestation_state":"computed","paper":{"title":"Energy Landscape for large average submatrix detection problems in Gaussian random matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Andrew B. Nobel, Partha S. Dey, Shankar Bhamidi","submitted_at":"2012-11-10T03:06:18Z","abstract_excerpt":"The problem of finding large average submatrices of a real-valued matrix arises in the exploratory analysis of data from a variety of disciplines, ranging from genomics to social sciences. In this paper we provide a detailed asymptotic analysis of large average submatrices of an $n \\times n$ Gaussian random matrix. The first part of the paper addresses global maxima. For fixed $k$ we identify the average and the joint distribution of the $k \\times k$ submatrix having largest average value. As a dual result, we establish that the size of the largest square sub-matrix with average bigger than 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":"1211.2284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-10T03:06:18Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"2d625fa2b4adb4b16b39312b6c9f4d57594e82ba8af02b121cc5f229a2917683","abstract_canon_sha256":"78d10d31376941882ce1733af657500678661ed4176d5da0bdcc2d927dc55e75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:58.632491Z","signature_b64":"ELatYnAy7R8jx9yu29aWZFmMSg27UFBlGcyQJBVIMrsc1FC7ZACAp6pOZ1B79OD2bvt5GM08CijF8ilu1mxNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51fcc7307a2b1542bba63a9967caac24ddb756c5f5285da5157bf23cbd398b54","last_reissued_at":"2026-05-18T03:20:58.631742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:58.631742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy Landscape for large average submatrix detection problems in Gaussian random matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Andrew B. Nobel, Partha S. Dey, Shankar Bhamidi","submitted_at":"2012-11-10T03:06:18Z","abstract_excerpt":"The problem of finding large average submatrices of a real-valued matrix arises in the exploratory analysis of data from a variety of disciplines, ranging from genomics to social sciences. In this paper we provide a detailed asymptotic analysis of large average submatrices of an $n \\times n$ Gaussian random matrix. The first part of the paper addresses global maxima. For fixed $k$ we identify the average and the joint distribution of the $k \\times k$ submatrix having largest average value. As a dual result, we establish that the size of the largest square sub-matrix with average bigger than a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2284","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.2284","created_at":"2026-05-18T03:20:58.631882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2284v2","created_at":"2026-05-18T03:20:58.631882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2284","created_at":"2026-05-18T03:20:58.631882+00:00"},{"alias_kind":"pith_short_12","alias_value":"KH6MOMD2FMKU","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KH6MOMD2FMKUFO5G","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KH6MOMD2","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08538","citing_title":"High-Dimensional Procrustes Matching via Tree Counts","ref_index":142,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET","json":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET.json","graph_json":"https://pith.science/api/pith-number/KH6MOMD2FMKUFO5GHKMWPSVMET/graph.json","events_json":"https://pith.science/api/pith-number/KH6MOMD2FMKUFO5GHKMWPSVMET/events.json","paper":"https://pith.science/paper/KH6MOMD2"},"agent_actions":{"view_html":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET","download_json":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET.json","view_paper":"https://pith.science/paper/KH6MOMD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2284&json=true","fetch_graph":"https://pith.science/api/pith-number/KH6MOMD2FMKUFO5GHKMWPSVMET/graph.json","fetch_events":"https://pith.science/api/pith-number/KH6MOMD2FMKUFO5GHKMWPSVMET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET/action/storage_attestation","attest_author":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET/action/author_attestation","sign_citation":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET/action/citation_signature","submit_replication":"https://pith.science/pith/KH6MOMD2FMKUFO5GHKMWPSVMET/action/replication_record"}},"created_at":"2026-05-18T03:20:58.631882+00:00","updated_at":"2026-05-18T03:20:58.631882+00:00"}