{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5TVANBKJN5ROBYQVGJUS4VDBUA","short_pith_number":"pith:5TVANBKJ","canonical_record":{"source":{"id":"1107.2574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-13T15:20:08Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ae82d801c67512dd8e418d986e56089c445441163018daf043ce2bea1013238c","abstract_canon_sha256":"9f0391fce6af01cac6d4532e42730b34d7571b5dcefe009fa5f0509c87ba8651"},"schema_version":"1.0"},"canonical_sha256":"ecea0685496f62e0e21532692e5461a00fe56b3cd990fbdda66ad0d243eb5d0d","source":{"kind":"arxiv","id":"1107.2574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2574","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2574v1","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2574","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"5TVANBKJN5RO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TVANBKJN5ROBYQV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TVANBKJ","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5TVANBKJN5ROBYQVGJUS4VDBUA","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-13T15:20:08Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"ae82d801c67512dd8e418d986e56089c445441163018daf043ce2bea1013238c","abstract_canon_sha256":"9f0391fce6af01cac6d4532e42730b34d7571b5dcefe009fa5f0509c87ba8651"},"schema_version":"1.0"},"canonical_sha256":"ecea0685496f62e0e21532692e5461a00fe56b3cd990fbdda66ad0d243eb5d0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:15.893058Z","signature_b64":"YH/Rlsza5h+M+mOQx+2xuzzPbD1YAQt+jni/cGtfR+xHKosExuyymgM6BwQ+AiF3DsWmXUspzqO5VHwUDL3LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecea0685496f62e0e21532692e5461a00fe56b3cd990fbdda66ad0d243eb5d0d","last_reissued_at":"2026-05-18T04:18:15.892668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:15.892668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2574","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-18T04:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6q6axNzHxYeYd6l3QJybHWMKMwQ3gSrVtoos+2kdZQaNhujl5D2bXcqDoe3iYlsXyHzge0AnWvI7A24GgpIQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:51:09.445203Z"},"content_sha256":"60379d57dd8107369bd5368d65c975af55396d5e39523ee334a925cb1cc7b0bd","schema_version":"1.0","event_id":"sha256:60379d57dd8107369bd5368d65c975af55396d5e39523ee334a925cb1cc7b0bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5TVANBKJN5ROBYQVGJUS4VDBUA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A central limit theorem for adaptive and interacting Markov chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Eric Moulines (LTCI), Gersende Fort (LTCI), Pierre Priouret (LPMA), Pierre Vandekerkhove (LAMA)","submitted_at":"2011-07-13T15:20:08Z","abstract_excerpt":"Adaptive and interacting Markov Chains Monte Carlo (MCMC) algorithms are a novel class of non-Markovian algorithms aimed at improving the simulation efficiency for complicated target distributions. In this paper, we study a general (non-Markovian) simulation framework covering both the adaptive and interacting MCMC algorithms. We establish a Central Limit Theorem for additive functionals of unbounded functions under a set of verifiable conditions, and identify the asymptotic variance. Our result extends all the results reported so far. An application to the interacting tempering algorithm (a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2574","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-18T04:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9MqE5BwcMCRbeUbYNbk0oy5thtFVr7bPH7ugeJasJfszAaugC38eo2AVEO53lDC365gBNTlp0vowVXtb0N6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:51:09.445589Z"},"content_sha256":"4d6817425df34714b598e7b0cf56a9a669fae6a259387a55f349fdc544241d19","schema_version":"1.0","event_id":"sha256:4d6817425df34714b598e7b0cf56a9a669fae6a259387a55f349fdc544241d19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/bundle.json","state_url":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/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-05-26T09:51:09Z","links":{"resolver":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA","bundle":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/bundle.json","state":"https://pith.science/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TVANBKJN5ROBYQVGJUS4VDBUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5TVANBKJN5ROBYQVGJUS4VDBUA","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":"9f0391fce6af01cac6d4532e42730b34d7571b5dcefe009fa5f0509c87ba8651","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-13T15:20:08Z","title_canon_sha256":"ae82d801c67512dd8e418d986e56089c445441163018daf043ce2bea1013238c"},"schema_version":"1.0","source":{"id":"1107.2574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2574","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2574v1","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2574","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"5TVANBKJN5RO","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TVANBKJN5ROBYQV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TVANBKJ","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:4d6817425df34714b598e7b0cf56a9a669fae6a259387a55f349fdc544241d19","target":"graph","created_at":"2026-05-18T04:18:15Z","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":"Adaptive and interacting Markov Chains Monte Carlo (MCMC) algorithms are a novel class of non-Markovian algorithms aimed at improving the simulation efficiency for complicated target distributions. In this paper, we study a general (non-Markovian) simulation framework covering both the adaptive and interacting MCMC algorithms. We establish a Central Limit Theorem for additive functionals of unbounded functions under a set of verifiable conditions, and identify the asymptotic variance. Our result extends all the results reported so far. An application to the interacting tempering algorithm (a s","authors_text":"Eric Moulines (LTCI), Gersende Fort (LTCI), Pierre Priouret (LPMA), Pierre Vandekerkhove (LAMA)","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-13T15:20:08Z","title":"A central limit theorem for adaptive and interacting Markov chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2574","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:60379d57dd8107369bd5368d65c975af55396d5e39523ee334a925cb1cc7b0bd","target":"record","created_at":"2026-05-18T04:18:15Z","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":"9f0391fce6af01cac6d4532e42730b34d7571b5dcefe009fa5f0509c87ba8651","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-07-13T15:20:08Z","title_canon_sha256":"ae82d801c67512dd8e418d986e56089c445441163018daf043ce2bea1013238c"},"schema_version":"1.0","source":{"id":"1107.2574","kind":"arxiv","version":1}},"canonical_sha256":"ecea0685496f62e0e21532692e5461a00fe56b3cd990fbdda66ad0d243eb5d0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecea0685496f62e0e21532692e5461a00fe56b3cd990fbdda66ad0d243eb5d0d","first_computed_at":"2026-05-18T04:18:15.892668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:15.892668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YH/Rlsza5h+M+mOQx+2xuzzPbD1YAQt+jni/cGtfR+xHKosExuyymgM6BwQ+AiF3DsWmXUspzqO5VHwUDL3LBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:15.893058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60379d57dd8107369bd5368d65c975af55396d5e39523ee334a925cb1cc7b0bd","sha256:4d6817425df34714b598e7b0cf56a9a669fae6a259387a55f349fdc544241d19"],"state_sha256":"5a8e9beee1249fb4eb333db4c5f617a0ca319f93934cda914f1fe4b40edf1fbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Libj4s3Ho2jpaO74SjEBWTYwBYAO2tWNRF9FRcoxJE3hwJMizbuvYEeD+kXTVheef9aliihwT6WkqIHrXtSvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:51:09.448639Z","bundle_sha256":"675961b850f20cf53f32ca74da78d7e7796ec2a965569d887323e356cd75c6dd"}}