{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:P5VZUGPYDJ7FN2IHAIKDSG764P","short_pith_number":"pith:P5VZUGPY","schema_version":"1.0","canonical_sha256":"7f6b9a19f81a7e56e9070214391bfee3c6da2f9f0bc1d72efe304023930e59b1","source":{"kind":"arxiv","id":"1008.3654","version":2},"attestation_state":"computed","paper":{"title":"Minimax-optimal rates for sparse additive models over kernel classes via convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Bin Yu, Garvesh Raskutti, Martin J. Wainwright","submitted_at":"2010-08-21T18:40:10Z","abstract_excerpt":"Sparse additive models are families of $d$-variate functions that have the additive decomposition $f^* = \\sum_{j \\in S} f^*_j$, where $S$ is an unknown subset of cardinality $s \\ll d$. In this paper, we consider the case where each univariate component function $f^*_j$ lies in a reproducing kernel Hilbert space (RKHS), and analyze a method for estimating the unknown function $f^*$ based on kernels combined with $\\ell_1$-type convex regularization. Working within a high-dimensional framework that allows both the dimension $d$ and sparsity $s$ to increase with $n$, we derive convergence rates (u"},"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":"1008.3654","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:40:10Z","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"title_canon_sha256":"de7344c1977ebc6702b2b420126923a3bbe63a4c1fa8a44dc075970b46ca0eaf","abstract_canon_sha256":"7abc330bb8467cfb1762aceb5c8a9966220d5d6ee1e8eb644536d46bc2d252af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:08.118014Z","signature_b64":"c63DUke9UKwwWcwiV3XemsaCSePYhGgmsF/np2PU0PJC7K16G9eKMr/46+rKEyk2uw1Ln8is64OiGVSLt5YsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f6b9a19f81a7e56e9070214391bfee3c6da2f9f0bc1d72efe304023930e59b1","last_reissued_at":"2026-05-18T04:06:08.117576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:08.117576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimax-optimal rates for sparse additive models over kernel classes via convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.TH"],"primary_cat":"math.ST","authors_text":"Bin Yu, Garvesh Raskutti, Martin J. Wainwright","submitted_at":"2010-08-21T18:40:10Z","abstract_excerpt":"Sparse additive models are families of $d$-variate functions that have the additive decomposition $f^* = \\sum_{j \\in S} f^*_j$, where $S$ is an unknown subset of cardinality $s \\ll d$. In this paper, we consider the case where each univariate component function $f^*_j$ lies in a reproducing kernel Hilbert space (RKHS), and analyze a method for estimating the unknown function $f^*$ based on kernels combined with $\\ell_1$-type convex regularization. Working within a high-dimensional framework that allows both the dimension $d$ and sparsity $s$ to increase with $n$, we derive convergence rates (u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3654","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.3654","created_at":"2026-05-18T04:06:08.117637+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3654v2","created_at":"2026-05-18T04:06:08.117637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3654","created_at":"2026-05-18T04:06:08.117637+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5VZUGPYDJ7F","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5VZUGPYDJ7FN2IH","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5VZUGPY","created_at":"2026-05-18T12:26:12.377268+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/P5VZUGPYDJ7FN2IHAIKDSG764P","json":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P.json","graph_json":"https://pith.science/api/pith-number/P5VZUGPYDJ7FN2IHAIKDSG764P/graph.json","events_json":"https://pith.science/api/pith-number/P5VZUGPYDJ7FN2IHAIKDSG764P/events.json","paper":"https://pith.science/paper/P5VZUGPY"},"agent_actions":{"view_html":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P","download_json":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P.json","view_paper":"https://pith.science/paper/P5VZUGPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3654&json=true","fetch_graph":"https://pith.science/api/pith-number/P5VZUGPYDJ7FN2IHAIKDSG764P/graph.json","fetch_events":"https://pith.science/api/pith-number/P5VZUGPYDJ7FN2IHAIKDSG764P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/action/storage_attestation","attest_author":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/action/author_attestation","sign_citation":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/action/citation_signature","submit_replication":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/action/replication_record"}},"created_at":"2026-05-18T04:06:08.117637+00:00","updated_at":"2026-05-18T04:06:08.117637+00:00"}