{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:HNMPBV2WP25G7SRWJASLV27EM5","short_pith_number":"pith:HNMPBV2W","schema_version":"1.0","canonical_sha256":"3b58f0d7567eba6fca364824baebe4676a54dfde9a2f7f9a535e8b2e3c2e24b7","source":{"kind":"arxiv","id":"0805.3587","version":2},"attestation_state":"computed","paper":{"title":"Explicit error bounds for lazy reversible Markov Chain Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"Daniel Rudolf","submitted_at":"2008-05-23T07:08:28Z","abstract_excerpt":"We prove explicit, i.e., non-asymptotic, error bounds for Markov Chain Monte Carlo methods, such as the Metropolis algorithm. The problem is to compute the expectation (or integral) of f with respect to a measure which can be given by a density with respect to another measure. A straight simulation of the desired distribution by a random number generator is in general not possible. Thus it is reasonable to use Markov chain sampling with a burn-in. We study such an algorithm and extend the analysis of Lovasz and Simonovits (1993) to obtain an explicit error bound."},"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":"0805.3587","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-05-23T07:08:28Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"2cb7fcfce93bf7be327325f6bfca4749c1ae0361533dd4e60d924013dbcd2750","abstract_canon_sha256":"79e66c143a36f78d285f094ad98363b227f467439e1786056d08ff5ad9082ea9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:31.467378Z","signature_b64":"+TZqO0gCBbMj77PeOGyqNLU5wmQRGMDTRGrlOdCJMV2TzV5pkJnNQ+P92ftIYcLtxTg41826MhanmcitmOujDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b58f0d7567eba6fca364824baebe4676a54dfde9a2f7f9a535e8b2e3c2e24b7","last_reissued_at":"2026-05-18T04:31:31.466805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:31.466805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit error bounds for lazy reversible Markov Chain Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"Daniel Rudolf","submitted_at":"2008-05-23T07:08:28Z","abstract_excerpt":"We prove explicit, i.e., non-asymptotic, error bounds for Markov Chain Monte Carlo methods, such as the Metropolis algorithm. The problem is to compute the expectation (or integral) of f with respect to a measure which can be given by a density with respect to another measure. A straight simulation of the desired distribution by a random number generator is in general not possible. Thus it is reasonable to use Markov chain sampling with a burn-in. We study such an algorithm and extend the analysis of Lovasz and Simonovits (1993) to obtain an explicit error bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.3587","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":""},"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":"0805.3587","created_at":"2026-05-18T04:31:31.466923+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.3587v2","created_at":"2026-05-18T04:31:31.466923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.3587","created_at":"2026-05-18T04:31:31.466923+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNMPBV2WP25G","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNMPBV2WP25G7SRW","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNMPBV2W","created_at":"2026-05-18T12:25:57.157939+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/HNMPBV2WP25G7SRWJASLV27EM5","json":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5.json","graph_json":"https://pith.science/api/pith-number/HNMPBV2WP25G7SRWJASLV27EM5/graph.json","events_json":"https://pith.science/api/pith-number/HNMPBV2WP25G7SRWJASLV27EM5/events.json","paper":"https://pith.science/paper/HNMPBV2W"},"agent_actions":{"view_html":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5","download_json":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5.json","view_paper":"https://pith.science/paper/HNMPBV2W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.3587&json=true","fetch_graph":"https://pith.science/api/pith-number/HNMPBV2WP25G7SRWJASLV27EM5/graph.json","fetch_events":"https://pith.science/api/pith-number/HNMPBV2WP25G7SRWJASLV27EM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5/action/storage_attestation","attest_author":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5/action/author_attestation","sign_citation":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5/action/citation_signature","submit_replication":"https://pith.science/pith/HNMPBV2WP25G7SRWJASLV27EM5/action/replication_record"}},"created_at":"2026-05-18T04:31:31.466923+00:00","updated_at":"2026-05-18T04:31:31.466923+00:00"}