{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HRBGLK23DTZ36U653RLJHNA3MI","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":"d17e5f8fad77664b48cf1fec669da48fcab286af1b5ae93995c7b9f091b71d13","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-08-16T10:30:31Z","title_canon_sha256":"e276a1ec5a2d7a95b8dbf08a15b9bff1c648a0dccdf4a0bb1e04cae4e17bd4e5"},"schema_version":"1.0","source":{"id":"1108.3201","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3201","created_at":"2026-06-03T23:06:59Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3201v2","created_at":"2026-06-03T23:06:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3201","created_at":"2026-06-03T23:06:59Z"},{"alias_kind":"pith_short_12","alias_value":"HRBGLK23DTZ3","created_at":"2026-06-03T23:06:59Z"},{"alias_kind":"pith_short_16","alias_value":"HRBGLK23DTZ36U65","created_at":"2026-06-03T23:06:59Z"},{"alias_kind":"pith_short_8","alias_value":"HRBGLK23","created_at":"2026-06-03T23:06:59Z"}],"graph_snapshots":[{"event_id":"sha256:a335a33ccce7042d1ee421a61ceac3ec015ae97e799c81973f3e32d074f56f15","target":"graph","created_at":"2026-06-03T23:06:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1108.3201/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove explicit, i.e. non-asymptotic, error bounds for Markov chain Monte Carlo methods. The problem is to compute the expectation of a function f with respect to a measure {\\pi}. Different convergence properties of Markov chains imply different error bounds. For uniformly ergodic and reversible Markov chains we prove a lower and an upper error bound with respect to the L2 -norm of f . If there exists an L2 -spectral gap, which is a weaker convergence property than uniform ergodicity, then we show an upper error bound with respect to the Lp -norm of f for p > 2. Usually a burn-in period is a","authors_text":"Daniel Rudolf","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-08-16T10:30:31Z","title":"Explicit error bounds for Markov chain Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3201","kind":"arxiv","version":2},"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:1c638ed078778128d749f45d09296ce69f821b01204aa61e2ce849b79e58245a","target":"record","created_at":"2026-06-03T23:06:59Z","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":"d17e5f8fad77664b48cf1fec669da48fcab286af1b5ae93995c7b9f091b71d13","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-08-16T10:30:31Z","title_canon_sha256":"e276a1ec5a2d7a95b8dbf08a15b9bff1c648a0dccdf4a0bb1e04cae4e17bd4e5"},"schema_version":"1.0","source":{"id":"1108.3201","kind":"arxiv","version":2}},"canonical_sha256":"3c4265ab5b1cf3bf53dddc5693b41b621835d949a3bbce54c37fdb020abc84eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c4265ab5b1cf3bf53dddc5693b41b621835d949a3bbce54c37fdb020abc84eb","first_computed_at":"2026-06-03T23:06:59.733501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T23:06:59.733501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j8yTVEo+EvyLs/eT6kefDR7EbCQEJrIgvjJu6BngO99vL40+1xwa8suUA9ujrje3pwV2KyA6lu4xaDtP521BCw==","signature_status":"signed_v1","signed_at":"2026-06-03T23:06:59.734025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3201","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c638ed078778128d749f45d09296ce69f821b01204aa61e2ce849b79e58245a","sha256:a335a33ccce7042d1ee421a61ceac3ec015ae97e799c81973f3e32d074f56f15"],"state_sha256":"867cbd4799a70f07ddb8555dc7a7946915b9fcf513b17f4bdaf5573ae44acd6a"}