{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RRJOWOJSXFB3IZM4NJ23JCAPYE","short_pith_number":"pith:RRJOWOJS","schema_version":"1.0","canonical_sha256":"8c52eb3932b943b4659c6a75b4880fc136868be4ba8373f6b1efe5fc9b1e253f","source":{"kind":"arxiv","id":"1404.2298","version":2},"attestation_state":"computed","paper":{"title":"Global rates of convergence in log-concave density estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Arlene K. H. Kim, Richard J. Samworth","submitted_at":"2014-04-08T20:29:22Z","abstract_excerpt":"The estimation of a log-concave density on $\\mathbb{R}^d$ represents a central problem in the area of nonparametric inference under shape constraints. In this paper, we study the performance of log-concave density estimators with respect to global loss functions, and adopt a minimax approach. We first show that no statistical procedure based on a sample of size $n$ can estimate a log-concave density with respect to the squared Hellinger loss function with supremum risk smaller than order $n^{-4/5}$, when $d=1$, and order $n^{-2/(d+1)}$ when $d \\geq 2$. In particular, this reveals a sense in wh"},"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":"1404.2298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-04-08T20:29:22Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2773b8e6635ada3ee79edc234e33d7019a37ea16f937b40cb04090bd589b7741","abstract_canon_sha256":"c9e29e81ac1c5d1547d544974efd25994839ce6ccf44145e1b5027a8a55a2c60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:01.260024Z","signature_b64":"hoGXY6pqk+sHoUTGxvRBIsIbEJA08pjxjGfa58IcNLuN94OlCiIZRB0jnFRVCyxd+ccAbkgIc3T7ll+iHBh2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c52eb3932b943b4659c6a75b4880fc136868be4ba8373f6b1efe5fc9b1e253f","last_reissued_at":"2026-05-18T01:32:01.259371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:01.259371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global rates of convergence in log-concave density estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Arlene K. H. Kim, Richard J. Samworth","submitted_at":"2014-04-08T20:29:22Z","abstract_excerpt":"The estimation of a log-concave density on $\\mathbb{R}^d$ represents a central problem in the area of nonparametric inference under shape constraints. In this paper, we study the performance of log-concave density estimators with respect to global loss functions, and adopt a minimax approach. We first show that no statistical procedure based on a sample of size $n$ can estimate a log-concave density with respect to the squared Hellinger loss function with supremum risk smaller than order $n^{-4/5}$, when $d=1$, and order $n^{-2/(d+1)}$ when $d \\geq 2$. In particular, this reveals a sense in wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2298","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":"1404.2298","created_at":"2026-05-18T01:32:01.259478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2298v2","created_at":"2026-05-18T01:32:01.259478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2298","created_at":"2026-05-18T01:32:01.259478+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRJOWOJSXFB3","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRJOWOJSXFB3IZM4","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRJOWOJS","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08306","citing_title":"A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE","json":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE.json","graph_json":"https://pith.science/api/pith-number/RRJOWOJSXFB3IZM4NJ23JCAPYE/graph.json","events_json":"https://pith.science/api/pith-number/RRJOWOJSXFB3IZM4NJ23JCAPYE/events.json","paper":"https://pith.science/paper/RRJOWOJS"},"agent_actions":{"view_html":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE","download_json":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE.json","view_paper":"https://pith.science/paper/RRJOWOJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2298&json=true","fetch_graph":"https://pith.science/api/pith-number/RRJOWOJSXFB3IZM4NJ23JCAPYE/graph.json","fetch_events":"https://pith.science/api/pith-number/RRJOWOJSXFB3IZM4NJ23JCAPYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE/action/storage_attestation","attest_author":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE/action/author_attestation","sign_citation":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE/action/citation_signature","submit_replication":"https://pith.science/pith/RRJOWOJSXFB3IZM4NJ23JCAPYE/action/replication_record"}},"created_at":"2026-05-18T01:32:01.259478+00:00","updated_at":"2026-05-18T01:32:01.259478+00:00"}