{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HRBGLK23DTZ36U653RLJHNA3MI","short_pith_number":"pith:HRBGLK23","canonical_record":{"source":{"id":"1108.3201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-08-16T10:30:31Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"e276a1ec5a2d7a95b8dbf08a15b9bff1c648a0dccdf4a0bb1e04cae4e17bd4e5","abstract_canon_sha256":"d17e5f8fad77664b48cf1fec669da48fcab286af1b5ae93995c7b9f091b71d13"},"schema_version":"1.0"},"canonical_sha256":"3c4265ab5b1cf3bf53dddc5693b41b621835d949a3bbce54c37fdb020abc84eb","source":{"kind":"arxiv","id":"1108.3201","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HRBGLK23DTZ36U653RLJHNA3MI","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3201","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-08-16T10:30:31Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"e276a1ec5a2d7a95b8dbf08a15b9bff1c648a0dccdf4a0bb1e04cae4e17bd4e5","abstract_canon_sha256":"d17e5f8fad77664b48cf1fec669da48fcab286af1b5ae93995c7b9f091b71d13"},"schema_version":"1.0"},"canonical_sha256":"3c4265ab5b1cf3bf53dddc5693b41b621835d949a3bbce54c37fdb020abc84eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:59.734025Z","signature_b64":"j8yTVEo+EvyLs/eT6kefDR7EbCQEJrIgvjJu6BngO99vL40+1xwa8suUA9ujrje3pwV2KyA6lu4xaDtP521BCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c4265ab5b1cf3bf53dddc5693b41b621835d949a3bbce54c37fdb020abc84eb","last_reissued_at":"2026-06-03T23:06:59.733501Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:59.733501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3201","source_version":2,"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-06-03T23:06:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"icdBK04CoKh2vfcW2WDJ9hQbCbOh7NqR+fh5DNKP4p6fnuKvR89UrHwCGJXivUWPLJS1kc3/sPXgJEFrM6vdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:31:43.858176Z"},"content_sha256":"1c638ed078778128d749f45d09296ce69f821b01204aa61e2ce849b79e58245a","schema_version":"1.0","event_id":"sha256:1c638ed078778128d749f45d09296ce69f821b01204aa61e2ce849b79e58245a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HRBGLK23DTZ36U653RLJHNA3MI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit error bounds for Markov chain Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.PR","authors_text":"Daniel Rudolf","submitted_at":"2011-08-16T10:30:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3201","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1108.3201/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-03T23:06:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5EeLx8ciciXWi7wKvOW6XzX3hww5uv+LGrINZ1SR6km2uNB+bTN4wHfB32tjKeEP1ltrtwI1XmLsQggbAGUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:31:43.858581Z"},"content_sha256":"a335a33ccce7042d1ee421a61ceac3ec015ae97e799c81973f3e32d074f56f15","schema_version":"1.0","event_id":"sha256:a335a33ccce7042d1ee421a61ceac3ec015ae97e799c81973f3e32d074f56f15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRBGLK23DTZ36U653RLJHNA3MI/bundle.json","state_url":"https://pith.science/pith/HRBGLK23DTZ36U653RLJHNA3MI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRBGLK23DTZ36U653RLJHNA3MI/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-10T14:31:43Z","links":{"resolver":"https://pith.science/pith/HRBGLK23DTZ36U653RLJHNA3MI","bundle":"https://pith.science/pith/HRBGLK23DTZ36U653RLJHNA3MI/bundle.json","state":"https://pith.science/pith/HRBGLK23DTZ36U653RLJHNA3MI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRBGLK23DTZ36U653RLJHNA3MI/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xhq3FlJuJAIcuSiJeTFfF30rav3GbLnA7ZUqBRQ6c1Oi4Q4JO5JzEp1FM4fCLoyS+zIXoxH622cmULaciQlPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:31:43.860460Z","bundle_sha256":"064add47503923a7423061ffa7a60ef1134a2a97305492cdaab3fa771d3a5bde"}}