{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AS7QIPZQFJVROS2JWEVLE72HAC","short_pith_number":"pith:AS7QIPZQ","canonical_record":{"source":{"id":"1801.00518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-01T21:53:55Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"6595beb2050a0ed1fceef1907e985e330f4722ec0704a2cc6a5ce07296cf0f9e","abstract_canon_sha256":"88da263a1cafadb10bd8476e600e1e4f0b2442234f1f1c6e4199627ac0866d5e"},"schema_version":"1.0"},"canonical_sha256":"04bf043f302a6b174b49b12ab27f4700ba7651078a9654ac43fa504249af9ec5","source":{"kind":"arxiv","id":"1801.00518","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00518","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00518v1","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00518","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"AS7QIPZQFJVR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AS7QIPZQFJVROS2J","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AS7QIPZQ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AS7QIPZQFJVROS2JWEVLE72HAC","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-01T21:53:55Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"6595beb2050a0ed1fceef1907e985e330f4722ec0704a2cc6a5ce07296cf0f9e","abstract_canon_sha256":"88da263a1cafadb10bd8476e600e1e4f0b2442234f1f1c6e4199627ac0866d5e"},"schema_version":"1.0"},"canonical_sha256":"04bf043f302a6b174b49b12ab27f4700ba7651078a9654ac43fa504249af9ec5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:53.164382Z","signature_b64":"w1m4PKnoz92reou3wAkY5uSele2oKhKqOMWB6t1Xf8AmCQm4gWG70SdRSXYYlnT1hj8sPrXIDNLPEQnPdkjqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04bf043f302a6b174b49b12ab27f4700ba7651078a9654ac43fa504249af9ec5","last_reissued_at":"2026-05-18T00:26:53.163723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:53.163723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00518","source_version":1,"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-18T00:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9OcuTrcvRYkp+iMNYli5qvt1+7nkD66qJDOa0NBH5jhZXU2SwGuWIIkON9ZW8Z5YcDsmkBcM769N7hFAWztDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:13:23.652660Z"},"content_sha256":"61a7899e240a0297eb7f8b499b08bc78031c4ce8e122f635167dad3bdf0cc403","schema_version":"1.0","event_id":"sha256:61a7899e240a0297eb7f8b499b08bc78031c4ce8e122f635167dad3bdf0cc403"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AS7QIPZQFJVROS2JWEVLE72HAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical and Computational Limits for Sparse Matrix Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"T. Tony Cai, Yihong Wu","submitted_at":"2018-01-01T21:53:55Z","abstract_excerpt":"This paper investigates the fundamental limits for detecting a high-dimensional sparse matrix contaminated by white Gaussian noise from both the statistical and computational perspectives. We consider $p\\times p$ matrices whose rows and columns are individually $k$-sparse. We provide a tight characterization of the statistical and computational limits for sparse matrix detection, which precisely describe when achieving optimal detection is easy, hard, or impossible, respectively. Although the sparse matrices considered in this paper have no apparent submatrix structure and the corresponding es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00518","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hd8TbJDExs/r0gCY0H1aTQ5+9YWk6wVXrw4xfKKEyOYfX/nesOTG+pIGMPhlqM6ieV4Gi5lfwCnthsKC/cwMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:13:23.653014Z"},"content_sha256":"a223735fd40ee2fde9dbc4ecc98ef706a37749e89f4d60a475e6fd27cfeddd09","schema_version":"1.0","event_id":"sha256:a223735fd40ee2fde9dbc4ecc98ef706a37749e89f4d60a475e6fd27cfeddd09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AS7QIPZQFJVROS2JWEVLE72HAC/bundle.json","state_url":"https://pith.science/pith/AS7QIPZQFJVROS2JWEVLE72HAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AS7QIPZQFJVROS2JWEVLE72HAC/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-06-02T16:13:23Z","links":{"resolver":"https://pith.science/pith/AS7QIPZQFJVROS2JWEVLE72HAC","bundle":"https://pith.science/pith/AS7QIPZQFJVROS2JWEVLE72HAC/bundle.json","state":"https://pith.science/pith/AS7QIPZQFJVROS2JWEVLE72HAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AS7QIPZQFJVROS2JWEVLE72HAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AS7QIPZQFJVROS2JWEVLE72HAC","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":"88da263a1cafadb10bd8476e600e1e4f0b2442234f1f1c6e4199627ac0866d5e","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-01T21:53:55Z","title_canon_sha256":"6595beb2050a0ed1fceef1907e985e330f4722ec0704a2cc6a5ce07296cf0f9e"},"schema_version":"1.0","source":{"id":"1801.00518","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00518","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00518v1","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00518","created_at":"2026-05-18T00:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"AS7QIPZQFJVR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AS7QIPZQFJVROS2J","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AS7QIPZQ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a223735fd40ee2fde9dbc4ecc98ef706a37749e89f4d60a475e6fd27cfeddd09","target":"graph","created_at":"2026-05-18T00:26:53Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper investigates the fundamental limits for detecting a high-dimensional sparse matrix contaminated by white Gaussian noise from both the statistical and computational perspectives. We consider $p\\times p$ matrices whose rows and columns are individually $k$-sparse. We provide a tight characterization of the statistical and computational limits for sparse matrix detection, which precisely describe when achieving optimal detection is easy, hard, or impossible, respectively. Although the sparse matrices considered in this paper have no apparent submatrix structure and the corresponding es","authors_text":"T. Tony Cai, Yihong Wu","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-01T21:53:55Z","title":"Statistical and Computational Limits for Sparse Matrix Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00518","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:61a7899e240a0297eb7f8b499b08bc78031c4ce8e122f635167dad3bdf0cc403","target":"record","created_at":"2026-05-18T00:26:53Z","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":"88da263a1cafadb10bd8476e600e1e4f0b2442234f1f1c6e4199627ac0866d5e","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-01T21:53:55Z","title_canon_sha256":"6595beb2050a0ed1fceef1907e985e330f4722ec0704a2cc6a5ce07296cf0f9e"},"schema_version":"1.0","source":{"id":"1801.00518","kind":"arxiv","version":1}},"canonical_sha256":"04bf043f302a6b174b49b12ab27f4700ba7651078a9654ac43fa504249af9ec5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04bf043f302a6b174b49b12ab27f4700ba7651078a9654ac43fa504249af9ec5","first_computed_at":"2026-05-18T00:26:53.163723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:53.163723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w1m4PKnoz92reou3wAkY5uSele2oKhKqOMWB6t1Xf8AmCQm4gWG70SdRSXYYlnT1hj8sPrXIDNLPEQnPdkjqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:53.164382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00518","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61a7899e240a0297eb7f8b499b08bc78031c4ce8e122f635167dad3bdf0cc403","sha256:a223735fd40ee2fde9dbc4ecc98ef706a37749e89f4d60a475e6fd27cfeddd09"],"state_sha256":"615aeffd284f9fe3a77f3cc1f566662b9a23de7bc0a66726e69370e2c055bd13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8rs/i/Dwr0BQ13TMMLRL+xguoS5QIZw9NaXbdC4ay9EnHJwrlv9P5ucyvPbS2IjFUbd4Kn8wSEhA4LwSRSEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:13:23.654976Z","bundle_sha256":"2487ad8affe8a8f5e6668dfc7f476c74a074ce973cb91dadde4ddc99a780f9b0"}}