{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FVLBPFKDSMPZLNGDF6D75EUIO2","short_pith_number":"pith:FVLBPFKD","canonical_record":{"source":{"id":"1206.6536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-27T22:54:47Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"54e99205142072e6e55f6d12d6b9c8121aee4510dd31b1d42a9fc85d403e3bb6","abstract_canon_sha256":"21bb5afbcc7f308c7b9fa9e1c6b0265298f96add67b073d0a84da1056f9e6f10"},"schema_version":"1.0"},"canonical_sha256":"2d56179543931f95b4c32f87fe92887696121d0440b2a7685c3316e3c0b291d7","source":{"kind":"arxiv","id":"1206.6536","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6536","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6536v3","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6536","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"FVLBPFKDSMPZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FVLBPFKDSMPZLNGD","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FVLBPFKD","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FVLBPFKDSMPZLNGDF6D75EUIO2","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-27T22:54:47Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"54e99205142072e6e55f6d12d6b9c8121aee4510dd31b1d42a9fc85d403e3bb6","abstract_canon_sha256":"21bb5afbcc7f308c7b9fa9e1c6b0265298f96add67b073d0a84da1056f9e6f10"},"schema_version":"1.0"},"canonical_sha256":"2d56179543931f95b4c32f87fe92887696121d0440b2a7685c3316e3c0b291d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:42.531138Z","signature_b64":"uaposZL4o1vP+LlhOgfMVlVcZMRy/PMkhp3BCuasGeeKt2G0g6qcdqKpqO9HecK/E7FAHiC//dbXzuoa/JPHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d56179543931f95b4c32f87fe92887696121d0440b2a7685c3316e3c0b291d7","last_reissued_at":"2026-05-18T03:07:42.530419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:42.530419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6536","source_version":3,"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-18T03:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuydWUr5n0xyB83MxAFjLO2wi/uIZLjqB5rp88z8OGx9XttgA7Ts2Pgxq5FusPsk/dTRMRBuC+70GlKQpXBDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:22:30.919583Z"},"content_sha256":"1cfc4d4b250a74a704489c70722894eb75018f8abfa105160ffc5d1eb44c76a2","schema_version":"1.0","event_id":"sha256:1cfc4d4b250a74a704489c70722894eb75018f8abfa105160ffc5d1eb44c76a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FVLBPFKDSMPZLNGDF6D75EUIO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly optimal minimax estimator for high-dimensional sparse linear regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Li Zhang","submitted_at":"2012-06-27T22:54:47Z","abstract_excerpt":"We present estimators for a well studied statistical estimation problem: the estimation for the linear regression model with soft sparsity constraints ($\\ell_q$ constraint with $0<q\\leq1$) in the high-dimensional setting. We first present a family of estimators, called the projected nearest neighbor estimator and show, by using results from Convex Geometry, that such estimator is within a logarithmic factor of the optimal for any design matrix. Then by utilizing a semi-definite programming relaxation technique developed in [SIAM J. Comput. 36 (2007) 1764-1776], we obtain an approximation algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6536","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":""},"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-18T03:07:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13tNdPCXnvTrUbGSGVqwHr7GDTq8QEoRU5pSt7AN9+vq73TT1ji5X5Hi2I2ZQ/u0J1rKNaD9MmREa1oZlG8iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:22:30.920121Z"},"content_sha256":"44a652909f2fdd48088cb3836294536a235495cf4ec223e4f4f94df625589bbf","schema_version":"1.0","event_id":"sha256:44a652909f2fdd48088cb3836294536a235495cf4ec223e4f4f94df625589bbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVLBPFKDSMPZLNGDF6D75EUIO2/bundle.json","state_url":"https://pith.science/pith/FVLBPFKDSMPZLNGDF6D75EUIO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVLBPFKDSMPZLNGDF6D75EUIO2/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-02T20:22:30Z","links":{"resolver":"https://pith.science/pith/FVLBPFKDSMPZLNGDF6D75EUIO2","bundle":"https://pith.science/pith/FVLBPFKDSMPZLNGDF6D75EUIO2/bundle.json","state":"https://pith.science/pith/FVLBPFKDSMPZLNGDF6D75EUIO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVLBPFKDSMPZLNGDF6D75EUIO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FVLBPFKDSMPZLNGDF6D75EUIO2","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":"21bb5afbcc7f308c7b9fa9e1c6b0265298f96add67b073d0a84da1056f9e6f10","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-27T22:54:47Z","title_canon_sha256":"54e99205142072e6e55f6d12d6b9c8121aee4510dd31b1d42a9fc85d403e3bb6"},"schema_version":"1.0","source":{"id":"1206.6536","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6536","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6536v3","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6536","created_at":"2026-05-18T03:07:42Z"},{"alias_kind":"pith_short_12","alias_value":"FVLBPFKDSMPZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FVLBPFKDSMPZLNGD","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FVLBPFKD","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:44a652909f2fdd48088cb3836294536a235495cf4ec223e4f4f94df625589bbf","target":"graph","created_at":"2026-05-18T03:07:42Z","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":"We present estimators for a well studied statistical estimation problem: the estimation for the linear regression model with soft sparsity constraints ($\\ell_q$ constraint with $0<q\\leq1$) in the high-dimensional setting. We first present a family of estimators, called the projected nearest neighbor estimator and show, by using results from Convex Geometry, that such estimator is within a logarithmic factor of the optimal for any design matrix. Then by utilizing a semi-definite programming relaxation technique developed in [SIAM J. Comput. 36 (2007) 1764-1776], we obtain an approximation algor","authors_text":"Li Zhang","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-27T22:54:47Z","title":"Nearly optimal minimax estimator for high-dimensional sparse linear regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6536","kind":"arxiv","version":3},"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:1cfc4d4b250a74a704489c70722894eb75018f8abfa105160ffc5d1eb44c76a2","target":"record","created_at":"2026-05-18T03:07:42Z","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":"21bb5afbcc7f308c7b9fa9e1c6b0265298f96add67b073d0a84da1056f9e6f10","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-06-27T22:54:47Z","title_canon_sha256":"54e99205142072e6e55f6d12d6b9c8121aee4510dd31b1d42a9fc85d403e3bb6"},"schema_version":"1.0","source":{"id":"1206.6536","kind":"arxiv","version":3}},"canonical_sha256":"2d56179543931f95b4c32f87fe92887696121d0440b2a7685c3316e3c0b291d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d56179543931f95b4c32f87fe92887696121d0440b2a7685c3316e3c0b291d7","first_computed_at":"2026-05-18T03:07:42.530419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:42.530419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uaposZL4o1vP+LlhOgfMVlVcZMRy/PMkhp3BCuasGeeKt2G0g6qcdqKpqO9HecK/E7FAHiC//dbXzuoa/JPHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:42.531138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6536","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cfc4d4b250a74a704489c70722894eb75018f8abfa105160ffc5d1eb44c76a2","sha256:44a652909f2fdd48088cb3836294536a235495cf4ec223e4f4f94df625589bbf"],"state_sha256":"62711b73dfbd106de5b16879e501abc445164259fa0fb5089a692089b62d1cd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYahnjbR0nDYh1VN0cxeGOEtEidWBJVsfA+Gey8oEOn6zlDRbB16F+to8EbnhAXkyrTAdh8muaX84OjS0UCYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:22:30.922890Z","bundle_sha256":"c305d90eb471cf609285518456aad2354d3af2dec99ead5240385ae18fb27e27"}}