{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KWVP5LK4KHMW6GVM4CLSX5JZI6","short_pith_number":"pith:KWVP5LK4","schema_version":"1.0","canonical_sha256":"55aafead5c51d96f1aace0972bf539478857233f744dd9db9b70f236573695a5","source":{"kind":"arxiv","id":"1410.2839","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.2839","created_at":"2026-05-18T02:40:37.047064+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2839v1","created_at":"2026-05-18T02:40:37.047064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2839","created_at":"2026-05-18T02:40:37.047064+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWVP5LK4KHMW","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWVP5LK4KHMW6GVM","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWVP5LK4","created_at":"2026-05-18T12:28:35.611951+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/KWVP5LK4KHMW6GVM4CLSX5JZI6","json":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6.json","graph_json":"https://pith.science/api/pith-number/KWVP5LK4KHMW6GVM4CLSX5JZI6/graph.json","events_json":"https://pith.science/api/pith-number/KWVP5LK4KHMW6GVM4CLSX5JZI6/events.json","paper":"https://pith.science/paper/KWVP5LK4"},"agent_actions":{"view_html":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6","download_json":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6.json","view_paper":"https://pith.science/paper/KWVP5LK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2839&json=true","fetch_graph":"https://pith.science/api/pith-number/KWVP5LK4KHMW6GVM4CLSX5JZI6/graph.json","fetch_events":"https://pith.science/api/pith-number/KWVP5LK4KHMW6GVM4CLSX5JZI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/action/storage_attestation","attest_author":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/action/author_attestation","sign_citation":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/action/citation_signature","submit_replication":"https://pith.science/pith/KWVP5LK4KHMW6GVM4CLSX5JZI6/action/replication_record"}},"created_at":"2026-05-18T02:40:37.047064+00:00","updated_at":"2026-05-18T02:40:37.047064+00:00"}