{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KWVP5LK4KHMW6GVM4CLSX5JZI6","short_pith_number":"pith:KWVP5LK4","canonical_record":{"source":{"id":"1410.2839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-10T16:49:04Z","cross_cats_sorted":[],"title_canon_sha256":"cb6385ae123eb939270c6f422d2a95ec81962946c4d1a9d7be025acfb30e2615","abstract_canon_sha256":"f457442207dbfc87867fcb015f49ea583e70f0eec9f3d61274075428ce47dd5e"},"schema_version":"1.0"},"canonical_sha256":"55aafead5c51d96f1aace0972bf539478857233f744dd9db9b70f236573695a5","source":{"kind":"arxiv","id":"1410.2839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2839","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2839v1","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2839","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"KWVP5LK4KHMW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KWVP5LK4KHMW6GVM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KWVP5LK4","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KWVP5LK4KHMW6GVM4CLSX5JZI6","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-10T16:49:04Z","cross_cats_sorted":[],"title_canon_sha256":"cb6385ae123eb939270c6f422d2a95ec81962946c4d1a9d7be025acfb30e2615","abstract_canon_sha256":"f457442207dbfc87867fcb015f49ea583e70f0eec9f3d61274075428ce47dd5e"},"schema_version":"1.0"},"canonical_sha256":"55aafead5c51d96f1aace0972bf539478857233f744dd9db9b70f236573695a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:37.047683Z","signature_b64":"NMx5kFcnM5zw2VPrKyTDdvmdBDZehPRlCV0Dc9/u62pcYV5o/FW4AURu41No2d3ylgPz9UuFLWfTCyIvliXUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55aafead5c51d96f1aace0972bf539478857233f744dd9db9b70f236573695a5","last_reissued_at":"2026-05-18T02:40:37.046942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:37.046942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2839","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-18T02:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmtb3pgz6buIj/qiTEQhq8MjGsVHaxIhaDVPkKFZ4WtZ+TYJS92p8OFzshWQ4ZR9LLnsM1MvLoQGVvFbcGFPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:35:59.015520Z"},"content_sha256":"003696d454cc40857afc4c9592cabe741c53b265224a292401cd9cd6005ecf5e","schema_version":"1.0","event_id":"sha256:003696d454cc40857afc4c9592cabe741c53b265224a292401cd9cd6005ecf5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KWVP5LK4KHMW6GVM4CLSX5JZI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A rate optimal procedure for sparse signal recovery under dependence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Jun Li, Ping-Shou Zhong","submitted_at":"2014-10-10T16:49:04Z","abstract_excerpt":"The paper considers the problem of identifying the sparse different components between two high dimensional means of column-wise dependent random vectors. We show that the dependence can be utilized to lower the identification boundary for signal recovery. Moreover, an optimal convergence rate for the marginal false non-discovery rate (mFNR) is established under the dependence. The convergence rate is faster than the optimal rate without dependence. To recover the sparse signal bearing dimensions, we propose a Dependence-Assisted Thresholding and Excising (DATE) procedure, which is shown to be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2839","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-18T02:40:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZGJWvGGEfu1udUi1LfI0IpUuczMGoIumlxTYAfNbDF9YNLv/F9slDcDgStFRIqDv1hw0TqNgk9ilU8Rbo9LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:35:59.015865Z"},"content_sha256":"94f3b4b9cae31c416e6bb7538f0d9f93138b50fd0726e46181c190febfa15fc2","schema_version":"1.0","event_id":"sha256:94f3b4b9cae31c416e6bb7538f0d9f93138b50fd0726e46181c190febfa15fc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/bundle.json","state_url":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/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-07-03T04:35:59Z","links":{"resolver":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6","bundle":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/bundle.json","state":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KWVP5LK4KHMW6GVM4CLSX5JZI6","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":"f457442207dbfc87867fcb015f49ea583e70f0eec9f3d61274075428ce47dd5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-10T16:49:04Z","title_canon_sha256":"cb6385ae123eb939270c6f422d2a95ec81962946c4d1a9d7be025acfb30e2615"},"schema_version":"1.0","source":{"id":"1410.2839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2839","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2839v1","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2839","created_at":"2026-05-18T02:40:37Z"},{"alias_kind":"pith_short_12","alias_value":"KWVP5LK4KHMW","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KWVP5LK4KHMW6GVM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KWVP5LK4","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:94f3b4b9cae31c416e6bb7538f0d9f93138b50fd0726e46181c190febfa15fc2","target":"graph","created_at":"2026-05-18T02:40:37Z","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":"The paper considers the problem of identifying the sparse different components between two high dimensional means of column-wise dependent random vectors. We show that the dependence can be utilized to lower the identification boundary for signal recovery. Moreover, an optimal convergence rate for the marginal false non-discovery rate (mFNR) is established under the dependence. The convergence rate is faster than the optimal rate without dependence. To recover the sparse signal bearing dimensions, we propose a Dependence-Assisted Thresholding and Excising (DATE) procedure, which is shown to be","authors_text":"Jun Li, Ping-Shou Zhong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-10T16:49:04Z","title":"A rate optimal procedure for sparse signal recovery under dependence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2839","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:003696d454cc40857afc4c9592cabe741c53b265224a292401cd9cd6005ecf5e","target":"record","created_at":"2026-05-18T02:40:37Z","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":"f457442207dbfc87867fcb015f49ea583e70f0eec9f3d61274075428ce47dd5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-10-10T16:49:04Z","title_canon_sha256":"cb6385ae123eb939270c6f422d2a95ec81962946c4d1a9d7be025acfb30e2615"},"schema_version":"1.0","source":{"id":"1410.2839","kind":"arxiv","version":1}},"canonical_sha256":"55aafead5c51d96f1aace0972bf539478857233f744dd9db9b70f236573695a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55aafead5c51d96f1aace0972bf539478857233f744dd9db9b70f236573695a5","first_computed_at":"2026-05-18T02:40:37.046942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:37.046942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NMx5kFcnM5zw2VPrKyTDdvmdBDZehPRlCV0Dc9/u62pcYV5o/FW4AURu41No2d3ylgPz9UuFLWfTCyIvliXUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:37.047683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:003696d454cc40857afc4c9592cabe741c53b265224a292401cd9cd6005ecf5e","sha256:94f3b4b9cae31c416e6bb7538f0d9f93138b50fd0726e46181c190febfa15fc2"],"state_sha256":"44a86f09417bcea09bd6b6410bdfe21810ad760ab80853074c1706213ecdcdae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BC3S4VAifNtmoteafJ58w4uOwxF+DemauXM4mbBO7Pw0t5crQwm4zH8P3UwsQkMDRIE/OZamPcM3m9skNjYFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T04:35:59.018032Z","bundle_sha256":"372b811ae16b11d6cb5f3daa95d69e410a2b4f13c41d69083bc74c4b314d4a85"}}