{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KHKY4COGU6PXK3QTZIK7CK6DR3","short_pith_number":"pith:KHKY4COG","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"},"canonical_sha256":"51d58e09c6a79f756e13ca15f12bc38ef3161337876fb7af2cebd547b887747f","source":{"kind":"arxiv","id":"1106.4739","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4739","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4739v3","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4739","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"KHKY4COGU6PX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KHKY4COGU6PXK3QT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KHKY4COG","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KHKY4COGU6PXK3QTZIK7CK6DR3","target":"record","payload":{"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"},"canonical_sha256":"51d58e09c6a79f756e13ca15f12bc38ef3161337876fb7af2cebd547b887747f","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"},"source_kind":"arxiv","source_id":"1106.4739","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-18T03:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZgX+FGrE0eHbsDjATymFBwFxmCeH9c3WpIjAPiWCO471ZpPC9DJTzZScEhPgJtCpqZw+Sy8tve8eAVKc4hiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:20:26.119542Z"},"content_sha256":"6a0eaaafd734d7837dc1b8b5e35c27d80e56865aaeb6c03ea4265a5c7b064ec3","schema_version":"1.0","event_id":"sha256:6a0eaaafd734d7837dc1b8b5e35c27d80e56865aaeb6c03ea4265a5c7b064ec3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KHKY4COGU6PXK3QTZIK7CK6DR3","target":"graph","payload":{"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"},"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-18T03:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLaLoImKnWzrBoJ36KkvTFn2rVOIMceoxt6PuRqjh7gNj9YDAw7xMmAa+mg0JFRizukw+7RSbRdqiDgfAC/VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:20:26.119892Z"},"content_sha256":"b1541f9fcb0b2979d97de3b9138a833a13ea9951970d38851dcd24309790e856","schema_version":"1.0","event_id":"sha256:b1541f9fcb0b2979d97de3b9138a833a13ea9951970d38851dcd24309790e856"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/bundle.json","state_url":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/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-28T01:20:26Z","links":{"resolver":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3","bundle":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/bundle.json","state":"https://pith.science/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHKY4COGU6PXK3QTZIK7CK6DR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KHKY4COGU6PXK3QTZIK7CK6DR3","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":"9a83f3576070d69254ee6aa9e58fee02a76862cb5d7ec83feb1f858490fc3ad0","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-06-23T14:35:04Z","title_canon_sha256":"a45ad4d510296a7b67f82cb91bd42c3a52d0ba3e8bad7865ecccecb11070eb3e"},"schema_version":"1.0","source":{"id":"1106.4739","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4739","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4739v3","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4739","created_at":"2026-05-18T03:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"KHKY4COGU6PX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KHKY4COGU6PXK3QT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KHKY4COG","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:b1541f9fcb0b2979d97de3b9138a833a13ea9951970d38851dcd24309790e856","target":"graph","created_at":"2026-05-18T03:05:07Z","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":"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","authors_text":"B{\\l}a\\.zej Miasojedow, Krzysztof {\\L}atuszy\\'nski, Wojciech Niemiro","cross_cats":["math.ST","stat.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-06-23T14:35:04Z","title":"Nonasymptotic bounds on the estimation error of MCMC algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4739","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:6a0eaaafd734d7837dc1b8b5e35c27d80e56865aaeb6c03ea4265a5c7b064ec3","target":"record","created_at":"2026-05-18T03:05:07Z","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":"9a83f3576070d69254ee6aa9e58fee02a76862cb5d7ec83feb1f858490fc3ad0","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-06-23T14:35:04Z","title_canon_sha256":"a45ad4d510296a7b67f82cb91bd42c3a52d0ba3e8bad7865ecccecb11070eb3e"},"schema_version":"1.0","source":{"id":"1106.4739","kind":"arxiv","version":3}},"canonical_sha256":"51d58e09c6a79f756e13ca15f12bc38ef3161337876fb7af2cebd547b887747f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d58e09c6a79f756e13ca15f12bc38ef3161337876fb7af2cebd547b887747f","first_computed_at":"2026-05-18T03:05:07.814011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:07.814011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N6cr7shLnIUKh4Fyjfat64jR6I8q49yrj9NeVXGJau6YkIyMyQVqANEvFIVtF7bpkSZsuHWEKS6K9GU4ejRWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:07.814566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4739","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0eaaafd734d7837dc1b8b5e35c27d80e56865aaeb6c03ea4265a5c7b064ec3","sha256:b1541f9fcb0b2979d97de3b9138a833a13ea9951970d38851dcd24309790e856"],"state_sha256":"303e84c468299e12edcb271a3edd2591b616b9245a688bb31225320b21572927"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQhJwp1tTiwhAFbm1J2g9nuWSOthBui4ImqPYhrcBMXuVN2Kg6cTEWTF2yCyjXOw45lfH+uAMihg2pGND2g7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:20:26.121932Z","bundle_sha256":"3ffca5eaffdf2081226eec33bb4bfb97eebd9b35ac089ad22351600433ab7598"}}