{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UTDMJYMI22YQU7B7L4QNHCTUV6","short_pith_number":"pith:UTDMJYMI","schema_version":"1.0","canonical_sha256":"a4c6c4e188d6b10a7c3f5f20d38a74af9e5e3e0e6ebbc537b0f80cb6b8f4d924","source":{"kind":"arxiv","id":"1102.2818","version":2},"attestation_state":"computed","paper":{"title":"Estimating composite functions by model selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Lucien Birg\\'e, Yannick Baraud","submitted_at":"2011-02-14T16:24:41Z","abstract_excerpt":"We consider the problem of estimating a function $s$ on $[-1,1]^{k}$ for large values of $k$ by looking for some best approximation by composite functions of the form $g\\circ u$. Our solution is based on model selection and leads to a very general approach to solve this problem with respect to many different types of functions $g,u$ and statistical frameworks. In particular, we handle the problems of approximating $s$ by additive functions, single and multiple index models, neural networks, mixtures of Gaussian densities (when $s$ is a density) among other examples. We also investigate the sit"},"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":"1102.2818","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-02-14T16:24:41Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"b8f5b3e598b10c4b34b0133a178e2851c41e539ff23c44bf80c7d6f8d89c331b","abstract_canon_sha256":"754cdf94f41afc95ecf35598e147f97e29d87ce16d56e292e4a6a661dc374dc9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:26.413459Z","signature_b64":"DgDSvDP+QfXgpyE3V+D/ahESWqDJgPjFl5O4UzlnTBQY+nS0w0FTQd+bF+uIGYLbdyD2nAjwpnH6jUdN2zYNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4c6c4e188d6b10a7c3f5f20d38a74af9e5e3e0e6ebbc537b0f80cb6b8f4d924","last_reissued_at":"2026-05-18T03:35:26.412783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:26.412783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating composite functions by model selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Lucien Birg\\'e, Yannick Baraud","submitted_at":"2011-02-14T16:24:41Z","abstract_excerpt":"We consider the problem of estimating a function $s$ on $[-1,1]^{k}$ for large values of $k$ by looking for some best approximation by composite functions of the form $g\\circ u$. Our solution is based on model selection and leads to a very general approach to solve this problem with respect to many different types of functions $g,u$ and statistical frameworks. In particular, we handle the problems of approximating $s$ by additive functions, single and multiple index models, neural networks, mixtures of Gaussian densities (when $s$ is a density) among other examples. We also investigate the sit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2818","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":"1102.2818","created_at":"2026-05-18T03:35:26.412870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2818v2","created_at":"2026-05-18T03:35:26.412870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2818","created_at":"2026-05-18T03:35:26.412870+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTDMJYMI22YQ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTDMJYMI22YQU7B7","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTDMJYMI","created_at":"2026-05-18T12:26:42.757692+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/UTDMJYMI22YQU7B7L4QNHCTUV6","json":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6.json","graph_json":"https://pith.science/api/pith-number/UTDMJYMI22YQU7B7L4QNHCTUV6/graph.json","events_json":"https://pith.science/api/pith-number/UTDMJYMI22YQU7B7L4QNHCTUV6/events.json","paper":"https://pith.science/paper/UTDMJYMI"},"agent_actions":{"view_html":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6","download_json":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6.json","view_paper":"https://pith.science/paper/UTDMJYMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2818&json=true","fetch_graph":"https://pith.science/api/pith-number/UTDMJYMI22YQU7B7L4QNHCTUV6/graph.json","fetch_events":"https://pith.science/api/pith-number/UTDMJYMI22YQU7B7L4QNHCTUV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/action/storage_attestation","attest_author":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/action/author_attestation","sign_citation":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/action/citation_signature","submit_replication":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/action/replication_record"}},"created_at":"2026-05-18T03:35:26.412870+00:00","updated_at":"2026-05-18T03:35:26.412870+00:00"}