{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:2FE7M76CM3JJHZNZEKRFUTTRME","short_pith_number":"pith:2FE7M76C","schema_version":"1.0","canonical_sha256":"d149f67fc266d293e5b922a25a4e716106f4851f61edd7c311740bcf1f0734e8","source":{"kind":"arxiv","id":"math/0603448","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds and aggregation in density estimation","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guillaume Lecu\\'e (PMA)","submitted_at":"2006-03-18T06:52:49Z","abstract_excerpt":"In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of $M$ density estimators for the Kullback-Leiber divergence (KL), the Hellinger's distance and the $L\\_1$-distance. The lower bound, with respect to the KL distance, can be achieved by the on-line type estimate suggested, among others, by Yang (2000). Combining these results, we state that $\\log M/n$ is an optimal rate of aggregation in the sense of Tsybakov (2003), where $n$ is the sample size."},"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":"math/0603448","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.ST","submitted_at":"2006-03-18T06:52:49Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"056329d5a93e40f177c22a0c1fe9c7a98f010032fc7390c79c7863b26b978460","abstract_canon_sha256":"1fe7d10e6fa4f82930278b234c812d5bf9d382abf14c6f8f5bb88c3c6ac7a709"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:50.431683Z","signature_b64":"UDnHpKyld0B+6g6Zw/uBV1CKXtTGIkjYG4Fjd4sLknbFxMaIUu7pwO+DiNnbPmYXBj5+l5tPb0Vd6nKUVdfHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d149f67fc266d293e5b922a25a4e716106f4851f61edd7c311740bcf1f0734e8","last_reissued_at":"2026-05-18T01:08:50.431046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:50.431046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds and aggregation in density estimation","license":"","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guillaume Lecu\\'e (PMA)","submitted_at":"2006-03-18T06:52:49Z","abstract_excerpt":"In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of $M$ density estimators for the Kullback-Leiber divergence (KL), the Hellinger's distance and the $L\\_1$-distance. The lower bound, with respect to the KL distance, can be achieved by the on-line type estimate suggested, among others, by Yang (2000). Combining these results, we state that $\\log M/n$ is an optimal rate of aggregation in the sense of Tsybakov (2003), where $n$ is the sample size."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0603448","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":""},"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":"math/0603448","created_at":"2026-05-18T01:08:50.431140+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0603448v1","created_at":"2026-05-18T01:08:50.431140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0603448","created_at":"2026-05-18T01:08:50.431140+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FE7M76CM3JJ","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FE7M76CM3JJHZNZ","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FE7M76C","created_at":"2026-05-18T12:25:53.939244+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/2FE7M76CM3JJHZNZEKRFUTTRME","json":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME.json","graph_json":"https://pith.science/api/pith-number/2FE7M76CM3JJHZNZEKRFUTTRME/graph.json","events_json":"https://pith.science/api/pith-number/2FE7M76CM3JJHZNZEKRFUTTRME/events.json","paper":"https://pith.science/paper/2FE7M76C"},"agent_actions":{"view_html":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME","download_json":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME.json","view_paper":"https://pith.science/paper/2FE7M76C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0603448&json=true","fetch_graph":"https://pith.science/api/pith-number/2FE7M76CM3JJHZNZEKRFUTTRME/graph.json","fetch_events":"https://pith.science/api/pith-number/2FE7M76CM3JJHZNZEKRFUTTRME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME/action/storage_attestation","attest_author":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME/action/author_attestation","sign_citation":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME/action/citation_signature","submit_replication":"https://pith.science/pith/2FE7M76CM3JJHZNZEKRFUTTRME/action/replication_record"}},"created_at":"2026-05-18T01:08:50.431140+00:00","updated_at":"2026-05-18T01:08:50.431140+00:00"}