{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZJJ2PYHS4KOLWBPXGFNMOKFMVI","short_pith_number":"pith:ZJJ2PYHS","schema_version":"1.0","canonical_sha256":"ca53a7e0f2e29cbb05f7315ac728acaa228ca95e59260a813ab8973718b11ea0","source":{"kind":"arxiv","id":"1407.0381","version":3},"attestation_state":"computed","paper":{"title":"Minimax rates of entropy estimation on large alphabets via best polynomial approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Pengkun Yang, Yihong Wu","submitted_at":"2014-07-01T19:51:11Z","abstract_excerpt":"Consider the problem of estimating the Shannon entropy of a distribution over $k$ elements from $n$ independent samples. We show that the minimax mean-square error is within universal multiplicative constant factors of $$\\Big(\\frac{k }{n \\log k}\\Big)^2 + \\frac{\\log^2 k}{n}$$ if $n$ exceeds a constant factor of $\\frac{k}{\\log k}$; otherwise there exists no consistent estimator. This refines the recent result of Valiant-Valiant \\cite{VV11} that the minimal sample size for consistent entropy estimation scales according to $\\Theta(\\frac{k}{\\log k})$. The apparatus of best polynomial approximation "},"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":"1407.0381","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T19:51:11Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"4d997ab5ce4191caa12465062655ca0468a40d7ba3a553a2f74fc616f3a156ba","abstract_canon_sha256":"f2c432a19a7ad48cec78a3c795c04b47bfca82aecf7408030d5f2607dcf84bad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:26.504238Z","signature_b64":"/ishfomWTf6h2VD3UdOlirW7YoqG59cISvDBF0NdWd8vXlXanbzzbri23vq2r4E7xNMTet7nrC+pXxuuiV4ADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca53a7e0f2e29cbb05f7315ac728acaa228ca95e59260a813ab8973718b11ea0","last_reissued_at":"2026-05-18T01:20:26.503572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:26.503572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimax rates of entropy estimation on large alphabets via best polynomial approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Pengkun Yang, Yihong Wu","submitted_at":"2014-07-01T19:51:11Z","abstract_excerpt":"Consider the problem of estimating the Shannon entropy of a distribution over $k$ elements from $n$ independent samples. We show that the minimax mean-square error is within universal multiplicative constant factors of $$\\Big(\\frac{k }{n \\log k}\\Big)^2 + \\frac{\\log^2 k}{n}$$ if $n$ exceeds a constant factor of $\\frac{k}{\\log k}$; otherwise there exists no consistent estimator. This refines the recent result of Valiant-Valiant \\cite{VV11} that the minimal sample size for consistent entropy estimation scales according to $\\Theta(\\frac{k}{\\log k})$. The apparatus of best polynomial approximation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0381","kind":"arxiv","version":3},"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":"1407.0381","created_at":"2026-05-18T01:20:26.503669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0381v3","created_at":"2026-05-18T01:20:26.503669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0381","created_at":"2026-05-18T01:20:26.503669+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJJ2PYHS4KOL","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJJ2PYHS4KOLWBPX","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJJ2PYHS","created_at":"2026-05-18T12:28:59.999130+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/ZJJ2PYHS4KOLWBPXGFNMOKFMVI","json":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI.json","graph_json":"https://pith.science/api/pith-number/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/graph.json","events_json":"https://pith.science/api/pith-number/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/events.json","paper":"https://pith.science/paper/ZJJ2PYHS"},"agent_actions":{"view_html":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI","download_json":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI.json","view_paper":"https://pith.science/paper/ZJJ2PYHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0381&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/action/storage_attestation","attest_author":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/action/author_attestation","sign_citation":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/action/citation_signature","submit_replication":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/action/replication_record"}},"created_at":"2026-05-18T01:20:26.503669+00:00","updated_at":"2026-05-18T01:20:26.503669+00:00"}