{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BZ2XZW2UDRGONK4FSPMZZ2HCBU","short_pith_number":"pith:BZ2XZW2U","schema_version":"1.0","canonical_sha256":"0e757cdb541c4ce6ab8593d99ce8e20d2126564c0ee724ea92af74bb73c5c4de","source":{"kind":"arxiv","id":"1502.01988","version":2},"attestation_state":"computed","paper":{"title":"Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander Rakhlin, Tengyuan Liang, T. Tony Cai","submitted_at":"2015-02-06T18:58:28Z","abstract_excerpt":"The interplay between computational efficiency and statistical accuracy in high-dimensional inference has drawn increasing attention in the literature. In this paper, we study computational and statistical boundaries for submatrix localization. Given one observation of (one or multiple non-overlapping) signal submatrix (of magnitude $\\lambda$ and size $k_m \\times k_n$) contaminated with a noise matrix (of size $m \\times n$), we establish two transition thresholds for the signal to noise $\\lambda/\\sigma$ ratio in terms of $m$, $n$, $k_m$, and $k_n$. The first threshold, $\\sf SNR_c$, corresponds"},"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":"1502.01988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-02-06T18:58:28Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"ac58d23e39ea1c1bcdc998b87f2d9f93b23a53b616daf8e4a2f61058fc7f77dd","abstract_canon_sha256":"514e76ce2d22a218beadd700268f67364edeff051734119dff1a382309f5a9a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:44.180482Z","signature_b64":"gbRnvAWv7b0wXrFYYhCtPbwNsZ49FqBP/N9yx126gMmE5F9VF6VCGvydQYzXI0PTaQ//MoYlKK67eCIIZlSKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e757cdb541c4ce6ab8593d99ce8e20d2126564c0ee724ea92af74bb73c5c4de","last_reissued_at":"2026-07-05T01:21:44.180038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:44.180038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander Rakhlin, Tengyuan Liang, T. Tony Cai","submitted_at":"2015-02-06T18:58:28Z","abstract_excerpt":"The interplay between computational efficiency and statistical accuracy in high-dimensional inference has drawn increasing attention in the literature. In this paper, we study computational and statistical boundaries for submatrix localization. Given one observation of (one or multiple non-overlapping) signal submatrix (of magnitude $\\lambda$ and size $k_m \\times k_n$) contaminated with a noise matrix (of size $m \\times n$), we establish two transition thresholds for the signal to noise $\\lambda/\\sigma$ ratio in terms of $m$, $n$, $k_m$, and $k_n$. The first threshold, $\\sf SNR_c$, corresponds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01988","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/1502.01988/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":"1502.01988","created_at":"2026-07-05T01:21:44.180097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01988v2","created_at":"2026-07-05T01:21:44.180097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01988","created_at":"2026-07-05T01:21:44.180097+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZ2XZW2UDRGO","created_at":"2026-07-05T01:21:44.180097+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZ2XZW2UDRGONK4F","created_at":"2026-07-05T01:21:44.180097+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZ2XZW2U","created_at":"2026-07-05T01:21:44.180097+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/BZ2XZW2UDRGONK4FSPMZZ2HCBU","json":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU.json","graph_json":"https://pith.science/api/pith-number/BZ2XZW2UDRGONK4FSPMZZ2HCBU/graph.json","events_json":"https://pith.science/api/pith-number/BZ2XZW2UDRGONK4FSPMZZ2HCBU/events.json","paper":"https://pith.science/paper/BZ2XZW2U"},"agent_actions":{"view_html":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU","download_json":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU.json","view_paper":"https://pith.science/paper/BZ2XZW2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01988&json=true","fetch_graph":"https://pith.science/api/pith-number/BZ2XZW2UDRGONK4FSPMZZ2HCBU/graph.json","fetch_events":"https://pith.science/api/pith-number/BZ2XZW2UDRGONK4FSPMZZ2HCBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU/action/storage_attestation","attest_author":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU/action/author_attestation","sign_citation":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU/action/citation_signature","submit_replication":"https://pith.science/pith/BZ2XZW2UDRGONK4FSPMZZ2HCBU/action/replication_record"}},"created_at":"2026-07-05T01:21:44.180097+00:00","updated_at":"2026-07-05T01:21:44.180097+00:00"}