{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SWJPYBO2O3FIAAFDVR75MQ6ZZT","short_pith_number":"pith:SWJPYBO2","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"},"canonical_sha256":"9592fc05da76ca8000a3ac7fd643d9ccda8c3656339e73b21fe61d830e5bccb2","source":{"kind":"arxiv","id":"1802.07889","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07889","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07889v3","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07889","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"SWJPYBO2O3FI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SWJPYBO2O3FIAAFD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SWJPYBO2","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SWJPYBO2O3FIAAFDVR75MQ6ZZT","target":"record","payload":{"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"},"canonical_sha256":"9592fc05da76ca8000a3ac7fd643d9ccda8c3656339e73b21fe61d830e5bccb2","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"},"source_kind":"arxiv","source_id":"1802.07889","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-18T00:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4H4oP8LIsDvTIGYkFVdpHGqmS3kUShr3QNfmEnmWV2BeyJgi8D4IqsAz4Jx0/d/Nb4iPVM5tqHbv0zSMe0LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:51:07.801657Z"},"content_sha256":"d49ec3502dd3dbfafce852abe11bbba90574316938bc839b3a0812aff9868aab","schema_version":"1.0","event_id":"sha256:d49ec3502dd3dbfafce852abe11bbba90574316938bc839b3a0812aff9868aab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SWJPYBO2O3FIAAFDVR75MQ6ZZT","target":"graph","payload":{"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"},"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-18T00:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zA7DgIkbglPGSKxGbbdJvtZj3Hn/EzDY1r5FCqDkOQrbuJI2tbGAdPqoTqBvOzCJGHgvXhB7Xn/ss4UTDmQCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:51:07.801990Z"},"content_sha256":"dbdc3e3e5b191ec1ac3944c7d1289c62c04b404894fdc62237f0f7b609c4d566","schema_version":"1.0","event_id":"sha256:dbdc3e3e5b191ec1ac3944c7d1289c62c04b404894fdc62237f0f7b609c4d566"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/bundle.json","state_url":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/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-06-28T21:51:07Z","links":{"resolver":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT","bundle":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/bundle.json","state":"https://pith.science/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWJPYBO2O3FIAAFDVR75MQ6ZZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SWJPYBO2O3FIAAFDVR75MQ6ZZT","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":"c8369eae4d7f9d155300bbf598fb7432c686cc76be021ca7832a60ab276a0eb2","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T03:10:17Z","title_canon_sha256":"262b2a838aed72ea6ccb84a7f8c014b9bc9d66fd5eb99d8b2e065c94e7164e98"},"schema_version":"1.0","source":{"id":"1802.07889","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07889","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07889v3","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07889","created_at":"2026-05-18T00:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"SWJPYBO2O3FI","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SWJPYBO2O3FIAAFD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SWJPYBO2","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:dbdc3e3e5b191ec1ac3944c7d1289c62c04b404894fdc62237f0f7b609c4d566","target":"graph","created_at":"2026-05-18T00:05:05Z","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":"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","authors_text":"Chuan-Zheng Lee, Jiantao Jiao, Tiancheng Yu, Tsachy Weissman, Yanjun Han, Yihong Wu","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T03:10:17Z","title":"Entropy Rate Estimation for Markov Chains with Large State Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07889","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:d49ec3502dd3dbfafce852abe11bbba90574316938bc839b3a0812aff9868aab","target":"record","created_at":"2026-05-18T00:05:05Z","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":"c8369eae4d7f9d155300bbf598fb7432c686cc76be021ca7832a60ab276a0eb2","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T03:10:17Z","title_canon_sha256":"262b2a838aed72ea6ccb84a7f8c014b9bc9d66fd5eb99d8b2e065c94e7164e98"},"schema_version":"1.0","source":{"id":"1802.07889","kind":"arxiv","version":3}},"canonical_sha256":"9592fc05da76ca8000a3ac7fd643d9ccda8c3656339e73b21fe61d830e5bccb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9592fc05da76ca8000a3ac7fd643d9ccda8c3656339e73b21fe61d830e5bccb2","first_computed_at":"2026-05-18T00:05:05.235672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:05.235672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V67k00qpq9M/B5O1X2F+L84VHkbnDKsusVFcyndKFGgGSq4KiuYa223Ui+sl++8QnSmVt0f2E3byfDQTjFXjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:05.236178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07889","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d49ec3502dd3dbfafce852abe11bbba90574316938bc839b3a0812aff9868aab","sha256:dbdc3e3e5b191ec1ac3944c7d1289c62c04b404894fdc62237f0f7b609c4d566"],"state_sha256":"c144f190f1a6b93d18d9d8917288e93dd2aaa5258482cda81c6145991381fb80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"322RF8vKS7mYqxqhAAYmrZGlhhobBTWIjOhTYWBdLEf7S5NgjQXJN76B8leeR0LdUmL5mEVIGm2a0A1GQhc+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T21:51:07.804118Z","bundle_sha256":"8d4cf22b377ce906525e83469ac371c3389f2ecbaf75ce0de38ca325b453a132"}}