{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W3HKPQJXOPMQ2DIPWKI34HCWBN","short_pith_number":"pith:W3HKPQJX","canonical_record":{"source":{"id":"1801.00105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-30T09:12:21Z","cross_cats_sorted":[],"title_canon_sha256":"1afecca49f5dbfb6dedd20bd763ff750357dea7510c9419053d7e703d4b4f49b","abstract_canon_sha256":"9286679bd4c96d6535d0f34e570d12806b7a2e8da6c8d8c717d5783456b53ad8"},"schema_version":"1.0"},"canonical_sha256":"b6cea7c13773d90d0d0fb291be1c560b4c9ae51d2f31ab6921e4a7a65f555ef4","source":{"kind":"arxiv","id":"1801.00105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00105","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00105v2","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00105","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"pith_short_12","alias_value":"W3HKPQJXOPMQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3HKPQJXOPMQ2DIP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3HKPQJX","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W3HKPQJXOPMQ2DIPWKI34HCWBN","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-30T09:12:21Z","cross_cats_sorted":[],"title_canon_sha256":"1afecca49f5dbfb6dedd20bd763ff750357dea7510c9419053d7e703d4b4f49b","abstract_canon_sha256":"9286679bd4c96d6535d0f34e570d12806b7a2e8da6c8d8c717d5783456b53ad8"},"schema_version":"1.0"},"canonical_sha256":"b6cea7c13773d90d0d0fb291be1c560b4c9ae51d2f31ab6921e4a7a65f555ef4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:16.771371Z","signature_b64":"hi/Q82ZDvSIRNwl0g7etj1igLBhH+DTnjZOldNFIE4NHlLPRJRYqksVOk9HyCId9uJPQ2Y3bkWegdC4VdXjyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6cea7c13773d90d0d0fb291be1c560b4c9ae51d2f31ab6921e4a7a65f555ef4","last_reissued_at":"2026-05-17T23:54:16.770773Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:16.770773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00105","source_version":2,"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-17T23:54:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ksRY6/GcJk2d41UJNNH4/+krrh7NpFWLIXBhPw+K/SzG4A8PeTSNGXOKSyue2MiZDs751IF/xnkPdNYGnzOTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:48:04.652837Z"},"content_sha256":"b0276c0ba55308c55b95c319055a0a47a4f3786c3bc32dedc76bc5649c286435","schema_version":"1.0","event_id":"sha256:b0276c0ba55308c55b95c319055a0a47a4f3786c3bc32dedc76bc5649c286435"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W3HKPQJXOPMQ2DIPWKI34HCWBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Partitioning and Distribution-based Thresholding for Iterative Variable Screening in High Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Su-Yun Huang, Tzee-Ming Huang, Yu-Hsiang Cheng","submitted_at":"2017-12-30T09:12:21Z","abstract_excerpt":"In big data analysis, a simple task such as linear regression can become very challenging as the variable dimension $p$ grows. As a result, variable screening is inevitable in many scientific studies. In recent years, randomized algorithms have become a new trend and are playing an increasingly important role for large scale data analysis. In this article, we combine the ideas of variable screening and random partitioning to propose a new iterative variable screening method. For moderate sized $p$ of order $O(n^{2-\\delta})$, we propose a basic algorithm that adopts a distribution-based thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00105","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":""},"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-17T23:54:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kjm8sBTxt0ksFI+YBKFAy7wx4MHzGWtXNE4oTBaNJaWwnmZsHVZBKTIJbU65yqGsDil7wgDJbOCHjTCOrdJXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:48:04.653176Z"},"content_sha256":"8d67ed8df6abf4ca43d74f7570b76fe6392309bf7389171b0cf37bbc71a4e6d6","schema_version":"1.0","event_id":"sha256:8d67ed8df6abf4ca43d74f7570b76fe6392309bf7389171b0cf37bbc71a4e6d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3HKPQJXOPMQ2DIPWKI34HCWBN/bundle.json","state_url":"https://pith.science/pith/W3HKPQJXOPMQ2DIPWKI34HCWBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3HKPQJXOPMQ2DIPWKI34HCWBN/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-08T01:48:04Z","links":{"resolver":"https://pith.science/pith/W3HKPQJXOPMQ2DIPWKI34HCWBN","bundle":"https://pith.science/pith/W3HKPQJXOPMQ2DIPWKI34HCWBN/bundle.json","state":"https://pith.science/pith/W3HKPQJXOPMQ2DIPWKI34HCWBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3HKPQJXOPMQ2DIPWKI34HCWBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W3HKPQJXOPMQ2DIPWKI34HCWBN","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":"9286679bd4c96d6535d0f34e570d12806b7a2e8da6c8d8c717d5783456b53ad8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-30T09:12:21Z","title_canon_sha256":"1afecca49f5dbfb6dedd20bd763ff750357dea7510c9419053d7e703d4b4f49b"},"schema_version":"1.0","source":{"id":"1801.00105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00105","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00105v2","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00105","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"pith_short_12","alias_value":"W3HKPQJXOPMQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3HKPQJXOPMQ2DIP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3HKPQJX","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:8d67ed8df6abf4ca43d74f7570b76fe6392309bf7389171b0cf37bbc71a4e6d6","target":"graph","created_at":"2026-05-17T23:54:16Z","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":"In big data analysis, a simple task such as linear regression can become very challenging as the variable dimension $p$ grows. As a result, variable screening is inevitable in many scientific studies. In recent years, randomized algorithms have become a new trend and are playing an increasingly important role for large scale data analysis. In this article, we combine the ideas of variable screening and random partitioning to propose a new iterative variable screening method. For moderate sized $p$ of order $O(n^{2-\\delta})$, we propose a basic algorithm that adopts a distribution-based thresho","authors_text":"Su-Yun Huang, Tzee-Ming Huang, Yu-Hsiang Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-30T09:12:21Z","title":"Random Partitioning and Distribution-based Thresholding for Iterative Variable Screening in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00105","kind":"arxiv","version":2},"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:b0276c0ba55308c55b95c319055a0a47a4f3786c3bc32dedc76bc5649c286435","target":"record","created_at":"2026-05-17T23:54:16Z","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":"9286679bd4c96d6535d0f34e570d12806b7a2e8da6c8d8c717d5783456b53ad8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-12-30T09:12:21Z","title_canon_sha256":"1afecca49f5dbfb6dedd20bd763ff750357dea7510c9419053d7e703d4b4f49b"},"schema_version":"1.0","source":{"id":"1801.00105","kind":"arxiv","version":2}},"canonical_sha256":"b6cea7c13773d90d0d0fb291be1c560b4c9ae51d2f31ab6921e4a7a65f555ef4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6cea7c13773d90d0d0fb291be1c560b4c9ae51d2f31ab6921e4a7a65f555ef4","first_computed_at":"2026-05-17T23:54:16.770773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:16.770773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hi/Q82ZDvSIRNwl0g7etj1igLBhH+DTnjZOldNFIE4NHlLPRJRYqksVOk9HyCId9uJPQ2Y3bkWegdC4VdXjyBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:16.771371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0276c0ba55308c55b95c319055a0a47a4f3786c3bc32dedc76bc5649c286435","sha256:8d67ed8df6abf4ca43d74f7570b76fe6392309bf7389171b0cf37bbc71a4e6d6"],"state_sha256":"31320b2a574883ec22db498b0283c58827104dfaf47a340c54b7f811b167dc9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aeo5+3mdOBLh0Pi3u4/+X/y/kf2zgwJLMlneSE7J8iui/8tdgREdkAkvVLbpUfLgW/OXLvHoC9Q9PT01ElfXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:48:04.655655Z","bundle_sha256":"e91e46744e682a38877deaac2b78ba5ab74a69d36dc557250bd1631bdf1b98c1"}}