{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SWJPYBO2O3FIAAFDVR75MQ6ZZT","short_pith_number":"pith:SWJPYBO2","schema_version":"1.0","canonical_sha256":"9592fc05da76ca8000a3ac7fd643d9ccda8c3656339e73b21fe61d830e5bccb2","source":{"kind":"arxiv","id":"1802.07889","version":3},"attestation_state":"computed","paper":{"title":"Entropy Rate Estimation for Markov Chains with Large State Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Chuan-Zheng Lee, Jiantao Jiao, Tiancheng Yu, Tsachy Weissman, Yanjun Han, Yihong Wu","submitted_at":"2018-02-22T03:10:17Z","abstract_excerpt":"Estimating the entropy based on data is one of the prototypical problems in distribution property testing and estimation. For estimating the Shannon entropy of a distribution on $S$ elements with independent samples, [Paninski2004] showed that the sample complexity is sublinear in $S$, and [Valiant--Valiant2011] showed that consistent estimation of Shannon entropy is possible if and only if the sample size $n$ far exceeds $\\frac{S}{\\log S}$. In this paper we consider the problem of estimating the entropy rate of a stationary reversible Markov chain with $S$ states from a sample path of $n$ obs"},"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":"1802.07889","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T03:10:17Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"262b2a838aed72ea6ccb84a7f8c014b9bc9d66fd5eb99d8b2e065c94e7164e98","abstract_canon_sha256":"c8369eae4d7f9d155300bbf598fb7432c686cc76be021ca7832a60ab276a0eb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:05.236178Z","signature_b64":"V67k00qpq9M/B5O1X2F+L84VHkbnDKsusVFcyndKFGgGSq4KiuYa223Ui+sl++8QnSmVt0f2E3byfDQTjFXjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9592fc05da76ca8000a3ac7fd643d9ccda8c3656339e73b21fe61d830e5bccb2","last_reissued_at":"2026-05-18T00:05:05.235672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:05.235672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropy Rate Estimation for Markov Chains with Large State Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Chuan-Zheng Lee, Jiantao Jiao, Tiancheng Yu, Tsachy Weissman, Yanjun Han, Yihong Wu","submitted_at":"2018-02-22T03:10:17Z","abstract_excerpt":"Estimating the entropy based on data is one of the prototypical problems in distribution property testing and estimation. For estimating the Shannon entropy of a distribution on $S$ elements with independent samples, [Paninski2004] showed that the sample complexity is sublinear in $S$, and [Valiant--Valiant2011] showed that consistent estimation of Shannon entropy is possible if and only if the sample size $n$ far exceeds $\\frac{S}{\\log S}$. In this paper we consider the problem of estimating the entropy rate of a stationary reversible Markov chain with $S$ states from a sample path of $n$ obs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07889","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":"1802.07889","created_at":"2026-05-18T00:05:05.235753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07889v3","created_at":"2026-05-18T00:05:05.235753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07889","created_at":"2026-05-18T00:05:05.235753+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWJPYBO2O3FI","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWJPYBO2O3FIAAFD","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWJPYBO2","created_at":"2026-05-18T12:32:53.628368+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/SWJPYBO2O3FIAAFDVR75MQ6ZZT","json":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT.json","graph_json":"https://pith.science/api/pith-number/SWJPYBO2O3FIAAFDVR75MQ6ZZT/graph.json","events_json":"https://pith.science/api/pith-number/SWJPYBO2O3FIAAFDVR75MQ6ZZT/events.json","paper":"https://pith.science/paper/SWJPYBO2"},"agent_actions":{"view_html":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT","download_json":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT.json","view_paper":"https://pith.science/paper/SWJPYBO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07889&json=true","fetch_graph":"https://pith.science/api/pith-number/SWJPYBO2O3FIAAFDVR75MQ6ZZT/graph.json","fetch_events":"https://pith.science/api/pith-number/SWJPYBO2O3FIAAFDVR75MQ6ZZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/action/storage_attestation","attest_author":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/action/author_attestation","sign_citation":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/action/citation_signature","submit_replication":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/action/replication_record"}},"created_at":"2026-05-18T00:05:05.235753+00:00","updated_at":"2026-05-18T00:05:05.235753+00:00"}