{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LUJXS67E2NAI7R2UPY625JEKLL","short_pith_number":"pith:LUJXS67E","schema_version":"1.0","canonical_sha256":"5d13797be4d3408fc7547e3daea48a5af6bac776a2051cb567355d7e4861cc75","source":{"kind":"arxiv","id":"2508.14400","version":3},"attestation_state":"computed","paper":{"title":"Gaussian Multiplier Bootstrap Procedure for the $k$th Largest Coordinate of High-Dimensional Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Liuquan Sun, Luobin Zhang, Qizhai Li, Yixi Ding, Yuke Shi","submitted_at":"2025-08-20T03:53:20Z","abstract_excerpt":"We consider the problem of Gaussian multiplier bootstrap procedures for the $k$th largest statistics and functions of the top $k$ order statistics, which are commonly encountered in high-dimensional statistical inference. Such a problem has been studied previously for $k=1$ (i.e., maxima). However, in many applications, a general $k$ ($k\\geq 1$) is of great interest. We provide the upper bounds for the errors between Gaussian approximations and Gaussian multiplier approximations. The dimension $p$ is allowed to be larger than the sample size $n$. The effectiveness of the proposed methods is de"},"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":"2508.14400","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-08-20T03:53:20Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"092b917102a34837626a6eeff12f572b58cdf9b75d5fd2caef6c3d6b0b952154","abstract_canon_sha256":"46dc3d4b4a1cc2502212d87682a8b10407c205c3772b756b8d937a1c4beb8d02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:22:26.865269Z","signature_b64":"Px9pEoZB8bUGfI/LUERx5ijtAc+U/8Ks3eBI6di5Wu4/IZ+TZ3M25e3Z37zByfZflxOVfTdxoRLG4FMApIyGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d13797be4d3408fc7547e3daea48a5af6bac776a2051cb567355d7e4861cc75","last_reissued_at":"2026-07-16T01:22:26.864366Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:22:26.864366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Multiplier Bootstrap Procedure for the $k$th Largest Coordinate of High-Dimensional Statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Liuquan Sun, Luobin Zhang, Qizhai Li, Yixi Ding, Yuke Shi","submitted_at":"2025-08-20T03:53:20Z","abstract_excerpt":"We consider the problem of Gaussian multiplier bootstrap procedures for the $k$th largest statistics and functions of the top $k$ order statistics, which are commonly encountered in high-dimensional statistical inference. Such a problem has been studied previously for $k=1$ (i.e., maxima). However, in many applications, a general $k$ ($k\\geq 1$) is of great interest. We provide the upper bounds for the errors between Gaussian approximations and Gaussian multiplier approximations. The dimension $p$ is allowed to be larger than the sample size $n$. The effectiveness of the proposed methods is de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.14400","kind":"arxiv","version":3},"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/2508.14400/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":"2508.14400","created_at":"2026-07-16T01:22:26.864803+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.14400v3","created_at":"2026-07-16T01:22:26.864803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.14400","created_at":"2026-07-16T01:22:26.864803+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUJXS67E2NAI","created_at":"2026-07-16T01:22:26.864803+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUJXS67E2NAI7R2U","created_at":"2026-07-16T01:22:26.864803+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUJXS67E","created_at":"2026-07-16T01:22:26.864803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2511.01680","citing_title":"Making Interpretable Discoveries from Unstructured Data: A High-Dimensional Multiple Hypothesis Testing Approach","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04785","citing_title":"High Dimensional Bootstrap and Asymptotic Expansion for the $k$-th Largest Coordinate","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL","json":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL.json","graph_json":"https://pith.science/api/pith-number/LUJXS67E2NAI7R2UPY625JEKLL/graph.json","events_json":"https://pith.science/api/pith-number/LUJXS67E2NAI7R2UPY625JEKLL/events.json","paper":"https://pith.science/paper/LUJXS67E"},"agent_actions":{"view_html":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL","download_json":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL.json","view_paper":"https://pith.science/paper/LUJXS67E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.14400&json=true","fetch_graph":"https://pith.science/api/pith-number/LUJXS67E2NAI7R2UPY625JEKLL/graph.json","fetch_events":"https://pith.science/api/pith-number/LUJXS67E2NAI7R2UPY625JEKLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL/action/storage_attestation","attest_author":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL/action/author_attestation","sign_citation":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL/action/citation_signature","submit_replication":"https://pith.science/pith/LUJXS67E2NAI7R2UPY625JEKLL/action/replication_record"}},"created_at":"2026-07-16T01:22:26.864803+00:00","updated_at":"2026-07-16T01:22:26.864803+00:00"}