{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OOO2I2326QHNGWL6YYUCZRUTUK","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":"59642bf3813185966ecf3130845b7d1c796cd75bcf4b53dbd33b048d59a6259f","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-06-08T04:39:29Z","title_canon_sha256":"d8ccc860034c3c2e1a64b9e5191dff78d0ee7f9497ef785386916506141698a0"},"schema_version":"1.0","source":{"id":"2606.09021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09021","created_at":"2026-06-09T02:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09021v1","created_at":"2026-06-09T02:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09021","created_at":"2026-06-09T02:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"OOO2I2326QHN","created_at":"2026-06-09T02:07:53Z"},{"alias_kind":"pith_short_16","alias_value":"OOO2I2326QHNGWL6","created_at":"2026-06-09T02:07:53Z"},{"alias_kind":"pith_short_8","alias_value":"OOO2I232","created_at":"2026-06-09T02:07:53Z"}],"graph_snapshots":[{"event_id":"sha256:bbea7ec94152c9467c551458671e9ff48aeba46aa756196fb6c3853adefc397d","target":"graph","created_at":"2026-06-09T02:07:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.09021/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study high-dimensional linear regression under a general symmetric convex constraint. Rather than imposing a specific sparsity-inducing penalty, we start from an arbitrary sign-symmetric and permutation-invariant convex body $K\\subseteq \\mathbb R^p$ and construct the sparse convexification hierarchy \\[ K^{(s)} = \\operatorname{conv}\\{v\\in K:\\|v\\|_0\\le s\\}. \\] We propose a penalized least-squares estimator that searches over this hierarchy and adapts to the best sparse convex approximation of the target. Under standard sub-Gaussian assumptions on the random design and noise, we prove an oracl","authors_text":"Matey Neykov","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-06-08T04:39:29Z","title":"Sparse Convexification for High-Dimensional Constrained Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09021","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:3742fd74ba8f7f6d47e2687449e95891968de86bdbbd0405341585775df78113","target":"record","created_at":"2026-06-09T02:07:53Z","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":"59642bf3813185966ecf3130845b7d1c796cd75bcf4b53dbd33b048d59a6259f","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-06-08T04:39:29Z","title_canon_sha256":"d8ccc860034c3c2e1a64b9e5191dff78d0ee7f9497ef785386916506141698a0"},"schema_version":"1.0","source":{"id":"2606.09021","kind":"arxiv","version":1}},"canonical_sha256":"739da46b7af40ed3597ec6282cc693a28372ee61c498cb2809db409ee5f228c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"739da46b7af40ed3597ec6282cc693a28372ee61c498cb2809db409ee5f228c3","first_computed_at":"2026-06-09T02:07:53.923890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:07:53.923890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZHDAjupLN2ZjdoXJ6P2RtRHrhfx9stGPZG+cPJ9alK/nfFi21Gql9aJrgqjc2DYYRNLagK1jpYxN89pK56jBAA==","signature_status":"signed_v1","signed_at":"2026-06-09T02:07:53.924789Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3742fd74ba8f7f6d47e2687449e95891968de86bdbbd0405341585775df78113","sha256:bbea7ec94152c9467c551458671e9ff48aeba46aa756196fb6c3853adefc397d"],"state_sha256":"ce43973e9c4b7325bd4531b297df3d098d3ebbef7fab51839756c41c9b3660c9"}