{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZJJ2PYHS4KOLWBPXGFNMOKFMVI","short_pith_number":"pith:ZJJ2PYHS","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"},"canonical_sha256":"ca53a7e0f2e29cbb05f7315ac728acaa228ca95e59260a813ab8973718b11ea0","source":{"kind":"arxiv","id":"1407.0381","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0381","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0381v3","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0381","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZJJ2PYHS4KOL","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJJ2PYHS4KOLWBPX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJJ2PYHS","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZJJ2PYHS4KOLWBPXGFNMOKFMVI","target":"record","payload":{"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"},"canonical_sha256":"ca53a7e0f2e29cbb05f7315ac728acaa228ca95e59260a813ab8973718b11ea0","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"},"source_kind":"arxiv","source_id":"1407.0381","source_version":3,"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-18T01:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5d1PMcV9IELgUfzKd+wRZYxE7dXGFom2A05tVlKYJM9eOTfdNAHyHCPo7bbbepKpmUNI/bCan5OjkIeyk/bBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:22:48.331040Z"},"content_sha256":"f7141750b5a867671e6e3e65f308742dab4efd37e4dcd3ded7ec53c20340e840","schema_version":"1.0","event_id":"sha256:f7141750b5a867671e6e3e65f308742dab4efd37e4dcd3ded7ec53c20340e840"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZJJ2PYHS4KOLWBPXGFNMOKFMVI","target":"graph","payload":{"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"},"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-18T01:20:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yN6CeVoKLQYF62sicAzUQmLchkmVuePYoToSBKlAq8/ix+t27XZS0Ceo3Fh+rTwoX5j8b2ifNzS+ldjsbK0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:22:48.331649Z"},"content_sha256":"1903bd59ab9f6bf48966531f4e075bbf7b59afaf3f6a13e3a6c5f13ca042c46e","schema_version":"1.0","event_id":"sha256:1903bd59ab9f6bf48966531f4e075bbf7b59afaf3f6a13e3a6c5f13ca042c46e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/bundle.json","state_url":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/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-05-31T19:22:48Z","links":{"resolver":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI","bundle":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/bundle.json","state":"https://pith.science/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJJ2PYHS4KOLWBPXGFNMOKFMVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZJJ2PYHS4KOLWBPXGFNMOKFMVI","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":"f2c432a19a7ad48cec78a3c795c04b47bfca82aecf7408030d5f2607dcf84bad","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T19:51:11Z","title_canon_sha256":"4d997ab5ce4191caa12465062655ca0468a40d7ba3a553a2f74fc616f3a156ba"},"schema_version":"1.0","source":{"id":"1407.0381","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0381","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0381v3","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0381","created_at":"2026-05-18T01:20:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZJJ2PYHS4KOL","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZJJ2PYHS4KOLWBPX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZJJ2PYHS","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:1903bd59ab9f6bf48966531f4e075bbf7b59afaf3f6a13e3a6c5f13ca042c46e","target":"graph","created_at":"2026-05-18T01:20: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":"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 ","authors_text":"Pengkun Yang, Yihong Wu","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T19:51:11Z","title":"Minimax rates of entropy estimation on large alphabets via best polynomial approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0381","kind":"arxiv","version":3},"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:f7141750b5a867671e6e3e65f308742dab4efd37e4dcd3ded7ec53c20340e840","target":"record","created_at":"2026-05-18T01:20: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":"f2c432a19a7ad48cec78a3c795c04b47bfca82aecf7408030d5f2607dcf84bad","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T19:51:11Z","title_canon_sha256":"4d997ab5ce4191caa12465062655ca0468a40d7ba3a553a2f74fc616f3a156ba"},"schema_version":"1.0","source":{"id":"1407.0381","kind":"arxiv","version":3}},"canonical_sha256":"ca53a7e0f2e29cbb05f7315ac728acaa228ca95e59260a813ab8973718b11ea0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca53a7e0f2e29cbb05f7315ac728acaa228ca95e59260a813ab8973718b11ea0","first_computed_at":"2026-05-18T01:20:26.503572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:26.503572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ishfomWTf6h2VD3UdOlirW7YoqG59cISvDBF0NdWd8vXlXanbzzbri23vq2r4E7xNMTet7nrC+pXxuuiV4ADA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:26.504238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0381","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7141750b5a867671e6e3e65f308742dab4efd37e4dcd3ded7ec53c20340e840","sha256:1903bd59ab9f6bf48966531f4e075bbf7b59afaf3f6a13e3a6c5f13ca042c46e"],"state_sha256":"5ee8fa61cf76310327dcee2d20d35fcbfca53f88104ce97fd12ccfa2a9dc7955"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzJQ7PTT588F9sehkrJcc5FUPGkHnGb7IfWB9o5YHoIvawbwAuQ+pH7mxkHqfdeevMj2BAoVF9Rv2YLXlgrtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:22:48.335065Z","bundle_sha256":"32320ee40633a52d4aa96288254571999e10ae928596f47cd8a779166c47ee64"}}