{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:34CN3X4ZPRHCBFSME3CGS57VC6","short_pith_number":"pith:34CN3X4Z","canonical_record":{"source":{"id":"math/0610317","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-10-10T10:57:12Z","cross_cats_sorted":[],"title_canon_sha256":"6e279d9aa285524d4d3a641032a006e2061d35029459fdc29b29a86708d2ee75","abstract_canon_sha256":"bb90ddfa5b477ea852feec9f1641d7e63a2154de7f861f9b7bf4825203ebac0e"},"schema_version":"1.0"},"canonical_sha256":"df04dddf997c4e20964c26c46977f5179e0a3f044f4db62ab8799cab2a7d9f99","source":{"kind":"arxiv","id":"math/0610317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0610317","created_at":"2026-05-18T01:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"math/0610317v1","created_at":"2026-05-18T01:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610317","created_at":"2026-05-18T01:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"34CN3X4ZPRHC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"34CN3X4ZPRHCBFSM","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"34CN3X4Z","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:34CN3X4ZPRHCBFSME3CGS57VC6","target":"record","payload":{"canonical_record":{"source":{"id":"math/0610317","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-10-10T10:57:12Z","cross_cats_sorted":[],"title_canon_sha256":"6e279d9aa285524d4d3a641032a006e2061d35029459fdc29b29a86708d2ee75","abstract_canon_sha256":"bb90ddfa5b477ea852feec9f1641d7e63a2154de7f861f9b7bf4825203ebac0e"},"schema_version":"1.0"},"canonical_sha256":"df04dddf997c4e20964c26c46977f5179e0a3f044f4db62ab8799cab2a7d9f99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:49.630093Z","signature_b64":"2ZT8U6AMj3K+Ic5wjWmOZEKn/PkLu7FTN4fA5VF2QZWZrlGV+p8FzSmbMmd5C5kPKfeYwR3HM2no/RpgQwsOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df04dddf997c4e20964c26c46977f5179e0a3f044f4db62ab8799cab2a7d9f99","last_reissued_at":"2026-05-18T01:08:49.629464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:49.629464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0610317","source_version":1,"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-18T01:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7hxA9I43T8pI+P8wz9rxjj89+mnU6FTtjl0ZKVnhLcrG5LXysFwMosyLNJP/6IqYpBh8lmb9HXpOwHQpiopDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:10:12.953462Z"},"content_sha256":"9e8d3018f872a920f04dae5417fe3c393a6f66664404a6c7a3ef5f41e5b81fc3","schema_version":"1.0","event_id":"sha256:9e8d3018f872a920f04dae5417fe3c393a6f66664404a6c7a3ef5f41e5b81fc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:34CN3X4ZPRHCBFSME3CGS57VC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the ergodicity properties of some adaptive MCMC algorithms","license":"","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christophe Andrieu, \\'Eric Moulines","submitted_at":"2006-10-10T10:57:12Z","abstract_excerpt":"In this paper we study the ergodicity properties of some adaptive Markov chain Monte Carlo algorithms (MCMC) that have been recently proposed in the literature. We prove that under a set of verifiable conditions, ergodic averages calculated from the output of a so-called adaptive MCMC sampler converge to the required value and can even, under more stringent assumptions, satisfy a central limit theorem. We prove that the conditions required are satisfied for the independent Metropolis--Hastings algorithm and the random walk Metropolis algorithm with symmetric increments. Finally, we propose an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610317","kind":"arxiv","version":1},"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-18T01:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mp8vxbZ96NwSeDnlWoyf+bxpGNflqYkedUhv2gJnPPiWmKhev8EIlzppIa2Q/Yt2Bv8ZlCK6iaAMvihN60ovAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:10:12.953811Z"},"content_sha256":"66549edd43d5f5e82ef314745cd2d87225cc6130b0b5e5e5e3202d08883b04b1","schema_version":"1.0","event_id":"sha256:66549edd43d5f5e82ef314745cd2d87225cc6130b0b5e5e5e3202d08883b04b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/bundle.json","state_url":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34CN3X4ZPRHCBFSME3CGS57VC6/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-01T09:10:12Z","links":{"resolver":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6","bundle":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/bundle.json","state":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34CN3X4ZPRHCBFSME3CGS57VC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:34CN3X4ZPRHCBFSME3CGS57VC6","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":"bb90ddfa5b477ea852feec9f1641d7e63a2154de7f861f9b7bf4825203ebac0e","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2006-10-10T10:57:12Z","title_canon_sha256":"6e279d9aa285524d4d3a641032a006e2061d35029459fdc29b29a86708d2ee75"},"schema_version":"1.0","source":{"id":"math/0610317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0610317","created_at":"2026-05-18T01:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"math/0610317v1","created_at":"2026-05-18T01:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610317","created_at":"2026-05-18T01:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"34CN3X4ZPRHC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"34CN3X4ZPRHCBFSM","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"34CN3X4Z","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:66549edd43d5f5e82ef314745cd2d87225cc6130b0b5e5e5e3202d08883b04b1","target":"graph","created_at":"2026-05-18T01:08:49Z","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":"In this paper we study the ergodicity properties of some adaptive Markov chain Monte Carlo algorithms (MCMC) that have been recently proposed in the literature. We prove that under a set of verifiable conditions, ergodic averages calculated from the output of a so-called adaptive MCMC sampler converge to the required value and can even, under more stringent assumptions, satisfy a central limit theorem. We prove that the conditions required are satisfied for the independent Metropolis--Hastings algorithm and the random walk Metropolis algorithm with symmetric increments. Finally, we propose an ","authors_text":"Christophe Andrieu, \\'Eric Moulines","cross_cats":[],"headline":"","license":"","primary_cat":"math.PR","submitted_at":"2006-10-10T10:57:12Z","title":"On the ergodicity properties of some adaptive MCMC algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610317","kind":"arxiv","version":1},"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:9e8d3018f872a920f04dae5417fe3c393a6f66664404a6c7a3ef5f41e5b81fc3","target":"record","created_at":"2026-05-18T01:08:49Z","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":"bb90ddfa5b477ea852feec9f1641d7e63a2154de7f861f9b7bf4825203ebac0e","cross_cats_sorted":[],"license":"","primary_cat":"math.PR","submitted_at":"2006-10-10T10:57:12Z","title_canon_sha256":"6e279d9aa285524d4d3a641032a006e2061d35029459fdc29b29a86708d2ee75"},"schema_version":"1.0","source":{"id":"math/0610317","kind":"arxiv","version":1}},"canonical_sha256":"df04dddf997c4e20964c26c46977f5179e0a3f044f4db62ab8799cab2a7d9f99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df04dddf997c4e20964c26c46977f5179e0a3f044f4db62ab8799cab2a7d9f99","first_computed_at":"2026-05-18T01:08:49.629464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:49.629464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2ZT8U6AMj3K+Ic5wjWmOZEKn/PkLu7FTN4fA5VF2QZWZrlGV+p8FzSmbMmd5C5kPKfeYwR3HM2no/RpgQwsOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:49.630093Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0610317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e8d3018f872a920f04dae5417fe3c393a6f66664404a6c7a3ef5f41e5b81fc3","sha256:66549edd43d5f5e82ef314745cd2d87225cc6130b0b5e5e5e3202d08883b04b1"],"state_sha256":"c20053d2ca02f04fa9a90143879d0eb6e250864176ebbb19050a638e3d8e88d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVcbYqkn7Y7Av7sbaX1mluCULK2OIw1JDf7L8/qfbvkAz4FB8Er6DBefcwppEy4UPhFfAdp/OYp1dYXmzkQyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:10:12.956203Z","bundle_sha256":"5bb077c0ff00ead4d9902f1c38f5b85dbe5fe7af1611820bd8eceddb8572ce9c"}}