{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OOO2I2326QHNGWL6YYUCZRUTUK","short_pith_number":"pith:OOO2I232","schema_version":"1.0","canonical_sha256":"739da46b7af40ed3597ec6282cc693a28372ee61c498cb2809db409ee5f228c3","source":{"kind":"arxiv","id":"2606.09021","version":1},"attestation_state":"computed","paper":{"title":"Sparse Convexification for High-Dimensional Constrained Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Matey Neykov","submitted_at":"2026-06-08T04:39:29Z","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"},"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":"2606.09021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-06-08T04:39:29Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"d8ccc860034c3c2e1a64b9e5191dff78d0ee7f9497ef785386916506141698a0","abstract_canon_sha256":"59642bf3813185966ecf3130845b7d1c796cd75bcf4b53dbd33b048d59a6259f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:07:53.924789Z","signature_b64":"ZHDAjupLN2ZjdoXJ6P2RtRHrhfx9stGPZG+cPJ9alK/nfFi21Gql9aJrgqjc2DYYRNLagK1jpYxN89pK56jBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739da46b7af40ed3597ec6282cc693a28372ee61c498cb2809db409ee5f228c3","last_reissued_at":"2026-06-09T02:07:53.923890Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:07:53.923890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Convexification for High-Dimensional Constrained Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Matey Neykov","submitted_at":"2026-06-08T04:39:29Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.09021/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":"2606.09021","created_at":"2026-06-09T02:07:53.924043+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.09021v1","created_at":"2026-06-09T02:07:53.924043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09021","created_at":"2026-06-09T02:07:53.924043+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOO2I2326QHN","created_at":"2026-06-09T02:07:53.924043+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOO2I2326QHNGWL6","created_at":"2026-06-09T02:07:53.924043+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOO2I232","created_at":"2026-06-09T02:07:53.924043+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/OOO2I2326QHNGWL6YYUCZRUTUK","json":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK.json","graph_json":"https://pith.science/api/pith-number/OOO2I2326QHNGWL6YYUCZRUTUK/graph.json","events_json":"https://pith.science/api/pith-number/OOO2I2326QHNGWL6YYUCZRUTUK/events.json","paper":"https://pith.science/paper/OOO2I232"},"agent_actions":{"view_html":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK","download_json":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK.json","view_paper":"https://pith.science/paper/OOO2I232","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.09021&json=true","fetch_graph":"https://pith.science/api/pith-number/OOO2I2326QHNGWL6YYUCZRUTUK/graph.json","fetch_events":"https://pith.science/api/pith-number/OOO2I2326QHNGWL6YYUCZRUTUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK/action/storage_attestation","attest_author":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK/action/author_attestation","sign_citation":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK/action/citation_signature","submit_replication":"https://pith.science/pith/OOO2I2326QHNGWL6YYUCZRUTUK/action/replication_record"}},"created_at":"2026-06-09T02:07:53.924043+00:00","updated_at":"2026-06-09T02:07:53.924043+00:00"}