{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KHKY4COGU6PXK3QTZIK7CK6DR3","short_pith_number":"pith:KHKY4COG","schema_version":"1.0","canonical_sha256":"51d58e09c6a79f756e13ca15f12bc38ef3161337876fb7af2cebd547b887747f","source":{"kind":"arxiv","id":"1106.4739","version":3},"attestation_state":"computed","paper":{"title":"Nonasymptotic bounds on the estimation error of MCMC algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ME","authors_text":"B{\\l}a\\.zej Miasojedow, Krzysztof {\\L}atuszy\\'nski, Wojciech Niemiro","submitted_at":"2011-06-23T14:35:04Z","abstract_excerpt":"We address the problem of upper bounding the mean square error of MCMC estimators. Our analysis is nonasymptotic. We first establish a general result valid for essentially all ergodic Markov chains encountered in Bayesian computation and a possibly unbounded target function $f$. The bound is sharp in the sense that the leading term is exactly $\\sigma_{\\mathrm {as}}^2(P,f)/n$, where $\\sigma_{\\mathrm{as}}^2(P,f)$ is the CLT asymptotic variance. Next, we proceed to specific additional assumptions and give explicit computable bounds for geometrically and polynomially ergodic Markov chains under qu"},"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":"1106.4739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-06-23T14:35:04Z","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"title_canon_sha256":"a45ad4d510296a7b67f82cb91bd42c3a52d0ba3e8bad7865ecccecb11070eb3e","abstract_canon_sha256":"9a83f3576070d69254ee6aa9e58fee02a76862cb5d7ec83feb1f858490fc3ad0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:07.814566Z","signature_b64":"N6cr7shLnIUKh4Fyjfat64jR6I8q49yrj9NeVXGJau6YkIyMyQVqANEvFIVtF7bpkSZsuHWEKS6K9GU4ejRWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d58e09c6a79f756e13ca15f12bc38ef3161337876fb7af2cebd547b887747f","last_reissued_at":"2026-05-18T03:05:07.814011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:07.814011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonasymptotic bounds on the estimation error of MCMC algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ME","authors_text":"B{\\l}a\\.zej Miasojedow, Krzysztof {\\L}atuszy\\'nski, Wojciech Niemiro","submitted_at":"2011-06-23T14:35:04Z","abstract_excerpt":"We address the problem of upper bounding the mean square error of MCMC estimators. Our analysis is nonasymptotic. We first establish a general result valid for essentially all ergodic Markov chains encountered in Bayesian computation and a possibly unbounded target function $f$. The bound is sharp in the sense that the leading term is exactly $\\sigma_{\\mathrm {as}}^2(P,f)/n$, where $\\sigma_{\\mathrm{as}}^2(P,f)$ is the CLT asymptotic variance. Next, we proceed to specific additional assumptions and give explicit computable bounds for geometrically and polynomially ergodic Markov chains under qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4739","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":"1106.4739","created_at":"2026-05-18T03:05:07.814112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.4739v3","created_at":"2026-05-18T03:05:07.814112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4739","created_at":"2026-05-18T03:05:07.814112+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHKY4COGU6PX","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHKY4COGU6PXK3QT","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHKY4COG","created_at":"2026-05-18T12:26:32.869790+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/KHKY4COGU6PXK3QTZIK7CK6DR3","json":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3.json","graph_json":"https://pith.science/api/pith-number/KHKY4COGU6PXK3QTZIK7CK6DR3/graph.json","events_json":"https://pith.science/api/pith-number/KHKY4COGU6PXK3QTZIK7CK6DR3/events.json","paper":"https://pith.science/paper/KHKY4COG"},"agent_actions":{"view_html":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3","download_json":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3.json","view_paper":"https://pith.science/paper/KHKY4COG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.4739&json=true","fetch_graph":"https://pith.science/api/pith-number/KHKY4COGU6PXK3QTZIK7CK6DR3/graph.json","fetch_events":"https://pith.science/api/pith-number/KHKY4COGU6PXK3QTZIK7CK6DR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/action/storage_attestation","attest_author":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/action/author_attestation","sign_citation":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/action/citation_signature","submit_replication":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/action/replication_record"}},"created_at":"2026-05-18T03:05:07.814112+00:00","updated_at":"2026-05-18T03:05:07.814112+00:00"}