{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:P5VZUGPYDJ7FN2IHAIKDSG764P","short_pith_number":"pith:P5VZUGPY","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"},"canonical_sha256":"7f6b9a19f81a7e56e9070214391bfee3c6da2f9f0bc1d72efe304023930e59b1","source":{"kind":"arxiv","id":"1008.3654","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3654","created_at":"2026-05-18T04:06:08Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3654v2","created_at":"2026-05-18T04:06:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3654","created_at":"2026-05-18T04:06:08Z"},{"alias_kind":"pith_short_12","alias_value":"P5VZUGPYDJ7F","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P5VZUGPYDJ7FN2IH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P5VZUGPY","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:P5VZUGPYDJ7FN2IHAIKDSG764P","target":"record","payload":{"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"},"canonical_sha256":"7f6b9a19f81a7e56e9070214391bfee3c6da2f9f0bc1d72efe304023930e59b1","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"},"source_kind":"arxiv","source_id":"1008.3654","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-18T04:06:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5C55O/S/FGTvX9PEeBDcLrOAVbihfXPUI5B+YIUYow5bGOeeuf5ckiXPPaOfRdNvDaB4wN2z7fP+pE04IkqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:36:20.800045Z"},"content_sha256":"493a447e54045b985210b81b9381831023b5a36ef5c13606a2ebefe86fbb1d24","schema_version":"1.0","event_id":"sha256:493a447e54045b985210b81b9381831023b5a36ef5c13606a2ebefe86fbb1d24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:P5VZUGPYDJ7FN2IHAIKDSG764P","target":"graph","payload":{"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"},"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-18T04:06:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqX/H95wj3T55ITyvUsuI2Yedj9VconSDBgKjeRya8pySPDrZRzRacuoAojMTJor2EAauyJIqIJB8uWtKPMKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:36:20.800469Z"},"content_sha256":"ef7b91ce9f8e9d6b82fc1f86babee6844e55e47dde1b5849c9999b9bc85cb7f7","schema_version":"1.0","event_id":"sha256:ef7b91ce9f8e9d6b82fc1f86babee6844e55e47dde1b5849c9999b9bc85cb7f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/bundle.json","state_url":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/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-02T02:36:20Z","links":{"resolver":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P","bundle":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/bundle.json","state":"https://pith.science/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5VZUGPYDJ7FN2IHAIKDSG764P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:P5VZUGPYDJ7FN2IHAIKDSG764P","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":"7abc330bb8467cfb1762aceb5c8a9966220d5d6ee1e8eb644536d46bc2d252af","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:40:10Z","title_canon_sha256":"de7344c1977ebc6702b2b420126923a3bbe63a4c1fa8a44dc075970b46ca0eaf"},"schema_version":"1.0","source":{"id":"1008.3654","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3654","created_at":"2026-05-18T04:06:08Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3654v2","created_at":"2026-05-18T04:06:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3654","created_at":"2026-05-18T04:06:08Z"},{"alias_kind":"pith_short_12","alias_value":"P5VZUGPYDJ7F","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"P5VZUGPYDJ7FN2IH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"P5VZUGPY","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:ef7b91ce9f8e9d6b82fc1f86babee6844e55e47dde1b5849c9999b9bc85cb7f7","target":"graph","created_at":"2026-05-18T04:06:08Z","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":"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","authors_text":"Bin Yu, Garvesh Raskutti, Martin J. Wainwright","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:40:10Z","title":"Minimax-optimal rates for sparse additive models over kernel classes via convex programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3654","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:493a447e54045b985210b81b9381831023b5a36ef5c13606a2ebefe86fbb1d24","target":"record","created_at":"2026-05-18T04:06:08Z","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":"7abc330bb8467cfb1762aceb5c8a9966220d5d6ee1e8eb644536d46bc2d252af","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:40:10Z","title_canon_sha256":"de7344c1977ebc6702b2b420126923a3bbe63a4c1fa8a44dc075970b46ca0eaf"},"schema_version":"1.0","source":{"id":"1008.3654","kind":"arxiv","version":2}},"canonical_sha256":"7f6b9a19f81a7e56e9070214391bfee3c6da2f9f0bc1d72efe304023930e59b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f6b9a19f81a7e56e9070214391bfee3c6da2f9f0bc1d72efe304023930e59b1","first_computed_at":"2026-05-18T04:06:08.117576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:08.117576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c63DUke9UKwwWcwiV3XemsaCSePYhGgmsF/np2PU0PJC7K16G9eKMr/46+rKEyk2uw1Ln8is64OiGVSLt5YsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:08.118014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3654","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:493a447e54045b985210b81b9381831023b5a36ef5c13606a2ebefe86fbb1d24","sha256:ef7b91ce9f8e9d6b82fc1f86babee6844e55e47dde1b5849c9999b9bc85cb7f7"],"state_sha256":"3a5b4b568029869a9a7f3bc2f5eed68f8481e63b9ff000ffe2b66b700f920589"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JpdZUOe6ecDt9exVyhM6Uh9ZxWBvX+xulH7MdSY6h46APU/HoK4mZWrBB2I61vuuJNdWGIeqRgR8t3/h1LALDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:36:20.802535Z","bundle_sha256":"a8498c92411cbbdc5e7166245a7de530c724152613822cd18b397e7f85f952e5"}}