{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UTDMJYMI22YQU7B7L4QNHCTUV6","short_pith_number":"pith:UTDMJYMI","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"},"canonical_sha256":"a4c6c4e188d6b10a7c3f5f20d38a74af9e5e3e0e6ebbc537b0f80cb6b8f4d924","source":{"kind":"arxiv","id":"1102.2818","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2818","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2818v2","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2818","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"pith_short_12","alias_value":"UTDMJYMI22YQ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UTDMJYMI22YQU7B7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UTDMJYMI","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UTDMJYMI22YQU7B7L4QNHCTUV6","target":"record","payload":{"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"},"canonical_sha256":"a4c6c4e188d6b10a7c3f5f20d38a74af9e5e3e0e6ebbc537b0f80cb6b8f4d924","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"},"source_kind":"arxiv","source_id":"1102.2818","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-18T03:35:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpSL6crN4p7MkJZoLPpJYujHIuJ2rU5vpXQsVDIlfGMenq+YbV+jjI4+nidxzjb7elUPK/TeaqwP7EwUcnSIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:38:02.079456Z"},"content_sha256":"f0a25c107ed64205ee8ff27a0dabb30e6e381af846f017b97d786aac02d704ed","schema_version":"1.0","event_id":"sha256:f0a25c107ed64205ee8ff27a0dabb30e6e381af846f017b97d786aac02d704ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UTDMJYMI22YQU7B7L4QNHCTUV6","target":"graph","payload":{"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"},"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-18T03:35:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XM+D4dplYbUPYNIUxL1r8LchOKAn24pn8RvO9ustsTr3iycAjKMyyMpFEeNuVmbixKhAuO1Pir4zjt9iLVjzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:38:02.079804Z"},"content_sha256":"647d8c987145c6d1e160477f94386a38ab7aef668dc520475f3bca10e667e879","schema_version":"1.0","event_id":"sha256:647d8c987145c6d1e160477f94386a38ab7aef668dc520475f3bca10e667e879"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/bundle.json","state_url":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/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-03T10:38:02Z","links":{"resolver":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6","bundle":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/bundle.json","state":"https://pith.science/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTDMJYMI22YQU7B7L4QNHCTUV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UTDMJYMI22YQU7B7L4QNHCTUV6","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":"754cdf94f41afc95ecf35598e147f97e29d87ce16d56e292e4a6a661dc374dc9","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-02-14T16:24:41Z","title_canon_sha256":"b8f5b3e598b10c4b34b0133a178e2851c41e539ff23c44bf80c7d6f8d89c331b"},"schema_version":"1.0","source":{"id":"1102.2818","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2818","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2818v2","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2818","created_at":"2026-05-18T03:35:26Z"},{"alias_kind":"pith_short_12","alias_value":"UTDMJYMI22YQ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UTDMJYMI22YQU7B7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UTDMJYMI","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:647d8c987145c6d1e160477f94386a38ab7aef668dc520475f3bca10e667e879","target":"graph","created_at":"2026-05-18T03:35:26Z","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":"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","authors_text":"Lucien Birg\\'e, Yannick Baraud","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-02-14T16:24:41Z","title":"Estimating composite functions by model selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2818","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:f0a25c107ed64205ee8ff27a0dabb30e6e381af846f017b97d786aac02d704ed","target":"record","created_at":"2026-05-18T03:35:26Z","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":"754cdf94f41afc95ecf35598e147f97e29d87ce16d56e292e4a6a661dc374dc9","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-02-14T16:24:41Z","title_canon_sha256":"b8f5b3e598b10c4b34b0133a178e2851c41e539ff23c44bf80c7d6f8d89c331b"},"schema_version":"1.0","source":{"id":"1102.2818","kind":"arxiv","version":2}},"canonical_sha256":"a4c6c4e188d6b10a7c3f5f20d38a74af9e5e3e0e6ebbc537b0f80cb6b8f4d924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4c6c4e188d6b10a7c3f5f20d38a74af9e5e3e0e6ebbc537b0f80cb6b8f4d924","first_computed_at":"2026-05-18T03:35:26.412783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:26.412783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DgDSvDP+QfXgpyE3V+D/ahESWqDJgPjFl5O4UzlnTBQY+nS0w0FTQd+bF+uIGYLbdyD2nAjwpnH6jUdN2zYNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:26.413459Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2818","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0a25c107ed64205ee8ff27a0dabb30e6e381af846f017b97d786aac02d704ed","sha256:647d8c987145c6d1e160477f94386a38ab7aef668dc520475f3bca10e667e879"],"state_sha256":"5934efc8e4461fd653adf6f7eccd499c942030a4b7485095522bab29a5f08637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNOJe7Ik8rN7SJIw8a1hTr73zCVzLXSO1jwUHxgGlLdyLuSPTpC9zY0b4dD9rMWTjvAWLT4QB4sPv+kpfMNJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:38:02.081842Z","bundle_sha256":"df5f349d4931ffc8a1c315cd7e75e5eb0b4769f79de357a6962dcfbeba8fdea7"}}