{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:T6A3PP4EFY6CV5YA7BVQOGSMDM","short_pith_number":"pith:T6A3PP4E","schema_version":"1.0","canonical_sha256":"9f81b7bf842e3c2af700f86b071a4c1b06aa99864d3ee2965f4a39f5f80beae5","source":{"kind":"arxiv","id":"2306.06643","version":2},"attestation_state":"computed","paper":{"title":"Detection and Recovery of Hidden Submatrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Marom Dadon, Tamir Bendory, Wasim Huleihel","submitted_at":"2023-06-11T10:34:39Z","abstract_excerpt":"In this paper, we study the problems of detection and recovery of hidden submatrices with elevated means inside a large Gaussian random matrix. We consider two different structures for the planted submatrices. In the first model, the planted matrices are disjoint, and their row and column indices can be arbitrary. Inspired by scientific applications, the second model restricts the row and column indices to be consecutive. In the detection problem, under the null hypothesis, the observed matrix is a realization of independent and identically distributed standard normal entries. Under the altern"},"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":"2306.06643","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-06-11T10:34:39Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"a0c5eacad172bfc70f460b3c430e5092bf967a4ac240594f960b7b7351653581","abstract_canon_sha256":"897702b2acded43f47f5df48551acab6448de29421d0d0ad1e9ceee4e577f9a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:50.863741Z","signature_b64":"z1Nc8jFuwPH2gZUCCEFmOFijMpubg+7fxACiRlxNc2ie7CrDXt+JI2SV8PO/Zf1dooh2JNfKtvXqKBWktkDYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f81b7bf842e3c2af700f86b071a4c1b06aa99864d3ee2965f4a39f5f80beae5","last_reissued_at":"2026-07-05T06:27:50.863219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:50.863219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detection and Recovery of Hidden Submatrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Marom Dadon, Tamir Bendory, Wasim Huleihel","submitted_at":"2023-06-11T10:34:39Z","abstract_excerpt":"In this paper, we study the problems of detection and recovery of hidden submatrices with elevated means inside a large Gaussian random matrix. We consider two different structures for the planted submatrices. In the first model, the planted matrices are disjoint, and their row and column indices can be arbitrary. Inspired by scientific applications, the second model restricts the row and column indices to be consecutive. In the detection problem, under the null hypothesis, the observed matrix is a realization of independent and identically distributed standard normal entries. Under the altern"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06643","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.06643/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.06643","created_at":"2026-07-05T06:27:50.863291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06643v2","created_at":"2026-07-05T06:27:50.863291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06643","created_at":"2026-07-05T06:27:50.863291+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6A3PP4EFY6C","created_at":"2026-07-05T06:27:50.863291+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6A3PP4EFY6CV5YA","created_at":"2026-07-05T06:27:50.863291+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6A3PP4E","created_at":"2026-07-05T06:27:50.863291+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17360","citing_title":"The Quasi-Polynomial Low-Degree Conjecture is False","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM","json":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM.json","graph_json":"https://pith.science/api/pith-number/T6A3PP4EFY6CV5YA7BVQOGSMDM/graph.json","events_json":"https://pith.science/api/pith-number/T6A3PP4EFY6CV5YA7BVQOGSMDM/events.json","paper":"https://pith.science/paper/T6A3PP4E"},"agent_actions":{"view_html":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM","download_json":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM.json","view_paper":"https://pith.science/paper/T6A3PP4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06643&json=true","fetch_graph":"https://pith.science/api/pith-number/T6A3PP4EFY6CV5YA7BVQOGSMDM/graph.json","fetch_events":"https://pith.science/api/pith-number/T6A3PP4EFY6CV5YA7BVQOGSMDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM/action/storage_attestation","attest_author":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM/action/author_attestation","sign_citation":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM/action/citation_signature","submit_replication":"https://pith.science/pith/T6A3PP4EFY6CV5YA7BVQOGSMDM/action/replication_record"}},"created_at":"2026-07-05T06:27:50.863291+00:00","updated_at":"2026-07-05T06:27:50.863291+00:00"}