{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:34CN3X4ZPRHCBFSME3CGS57VC6","short_pith_number":"pith:34CN3X4Z","schema_version":"1.0","canonical_sha256":"df04dddf997c4e20964c26c46977f5179e0a3f044f4db62ab8799cab2a7d9f99","source":{"kind":"arxiv","id":"math/0610317","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0610317","created_at":"2026-05-18T01:08:49.629567+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0610317v1","created_at":"2026-05-18T01:08:49.629567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610317","created_at":"2026-05-18T01:08:49.629567+00:00"},{"alias_kind":"pith_short_12","alias_value":"34CN3X4ZPRHC","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"34CN3X4ZPRHCBFSM","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"34CN3X4Z","created_at":"2026-05-18T12:25:53.939244+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/34CN3X4ZPRHCBFSME3CGS57VC6","json":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6.json","graph_json":"https://pith.science/api/pith-number/34CN3X4ZPRHCBFSME3CGS57VC6/graph.json","events_json":"https://pith.science/api/pith-number/34CN3X4ZPRHCBFSME3CGS57VC6/events.json","paper":"https://pith.science/paper/34CN3X4Z"},"agent_actions":{"view_html":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6","download_json":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6.json","view_paper":"https://pith.science/paper/34CN3X4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0610317&json=true","fetch_graph":"https://pith.science/api/pith-number/34CN3X4ZPRHCBFSME3CGS57VC6/graph.json","fetch_events":"https://pith.science/api/pith-number/34CN3X4ZPRHCBFSME3CGS57VC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/action/storage_attestation","attest_author":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/action/author_attestation","sign_citation":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/action/citation_signature","submit_replication":"https://pith.science/pith/34CN3X4ZPRHCBFSME3CGS57VC6/action/replication_record"}},"created_at":"2026-05-18T01:08:49.629567+00:00","updated_at":"2026-05-18T01:08:49.629567+00:00"}