{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QNMZ4PQCHRRHANP2HFT6HN7XXR","short_pith_number":"pith:QNMZ4PQC","canonical_record":{"source":{"id":"1203.3036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-14T10:20:53Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"a65d55fe6aeff98a21a62137faf08abe50b2eedbdc88000a39d981e7d99139a0","abstract_canon_sha256":"042ca0c3e9d82e1d23dc4d40397635521b88c5a99ca6876a23bfbe29c1e7a1ca"},"schema_version":"1.0"},"canonical_sha256":"83599e3e023c627035fa3967e3b7f7bc7ac8afbcecb969766d68a3ecb0a86e58","source":{"kind":"arxiv","id":"1203.3036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3036","created_at":"2026-05-18T04:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3036v1","created_at":"2026-05-18T04:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3036","created_at":"2026-05-18T04:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"QNMZ4PQCHRRH","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QNMZ4PQCHRRHANP2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QNMZ4PQC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QNMZ4PQCHRRHANP2HFT6HN7XXR","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-14T10:20:53Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"a65d55fe6aeff98a21a62137faf08abe50b2eedbdc88000a39d981e7d99139a0","abstract_canon_sha256":"042ca0c3e9d82e1d23dc4d40397635521b88c5a99ca6876a23bfbe29c1e7a1ca"},"schema_version":"1.0"},"canonical_sha256":"83599e3e023c627035fa3967e3b7f7bc7ac8afbcecb969766d68a3ecb0a86e58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:12.805637Z","signature_b64":"5x34wv2Ph/sV7/S7r7GrncokjAeBZmbtzOTNsGgMUlqeMu6I7bdO/hWD6ShN8iYGgJXBXq83xx8kSUpdlZ6LDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83599e3e023c627035fa3967e3b7f7bc7ac8afbcecb969766d68a3ecb0a86e58","last_reissued_at":"2026-05-18T04:00:12.804905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:12.804905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3036","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:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ubek14QN5d8DedlD9BA7zYZDsS/ukXkj1TX5q/pAjFnmnzUMk1Jq0xtpdeovFffQ0I4cmFx+aCLjkffTBpNsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:38:51.975647Z"},"content_sha256":"771268d06c59970190aec8b75b0034faf1f65c4cdc167f570ecd103122fb708a","schema_version":"1.0","event_id":"sha256:771268d06c59970190aec8b75b0034faf1f65c4cdc167f570ecd103122fb708a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QNMZ4PQCHRRHANP2HFT6HN7XXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of adaptive and interacting Markov chain Monte Carlo algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"E. Moulines, G. Fort, P. Priouret","submitted_at":"2012-03-14T10:20:53Z","abstract_excerpt":"Adaptive and interacting Markov chain Monte Carlo algorithms (MCMC) have been recently introduced in the literature. These novel simulation algorithms are designed to increase the simulation efficiency to sample complex distributions. Motivated by some recently introduced algorithms (such as the adaptive Metropolis algorithm and the interacting tempering algorithm), we develop a general methodological and theoretical framework to establish both the convergence of the marginal distribution and a strong law of large numbers. This framework weakens the conditions introduced in the pioneering pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3036","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:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7UKuODX34RnXI6g2PeawMwdT7wgy//z9m5NL/xMj7G5Qi37fFONKrhpj2YmQbyIxv+5aD2GiDG9ZA53XOQ2dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:38:51.976104Z"},"content_sha256":"1eea42fd3f07f99811c14bacaa70c0029347482adef66f5ae8d39bad9d1886cc","schema_version":"1.0","event_id":"sha256:1eea42fd3f07f99811c14bacaa70c0029347482adef66f5ae8d39bad9d1886cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QNMZ4PQCHRRHANP2HFT6HN7XXR/bundle.json","state_url":"https://pith.science/pith/QNMZ4PQCHRRHANP2HFT6HN7XXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QNMZ4PQCHRRHANP2HFT6HN7XXR/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-09T10:38:51Z","links":{"resolver":"https://pith.science/pith/QNMZ4PQCHRRHANP2HFT6HN7XXR","bundle":"https://pith.science/pith/QNMZ4PQCHRRHANP2HFT6HN7XXR/bundle.json","state":"https://pith.science/pith/QNMZ4PQCHRRHANP2HFT6HN7XXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QNMZ4PQCHRRHANP2HFT6HN7XXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QNMZ4PQCHRRHANP2HFT6HN7XXR","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":"042ca0c3e9d82e1d23dc4d40397635521b88c5a99ca6876a23bfbe29c1e7a1ca","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-14T10:20:53Z","title_canon_sha256":"a65d55fe6aeff98a21a62137faf08abe50b2eedbdc88000a39d981e7d99139a0"},"schema_version":"1.0","source":{"id":"1203.3036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3036","created_at":"2026-05-18T04:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3036v1","created_at":"2026-05-18T04:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3036","created_at":"2026-05-18T04:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"QNMZ4PQCHRRH","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QNMZ4PQCHRRHANP2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QNMZ4PQC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:1eea42fd3f07f99811c14bacaa70c0029347482adef66f5ae8d39bad9d1886cc","target":"graph","created_at":"2026-05-18T04:00:12Z","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 chain Monte Carlo algorithms (MCMC) have been recently introduced in the literature. These novel simulation algorithms are designed to increase the simulation efficiency to sample complex distributions. Motivated by some recently introduced algorithms (such as the adaptive Metropolis algorithm and the interacting tempering algorithm), we develop a general methodological and theoretical framework to establish both the convergence of the marginal distribution and a strong law of large numbers. This framework weakens the conditions introduced in the pioneering pape","authors_text":"E. Moulines, G. Fort, P. Priouret","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-14T10:20:53Z","title":"Convergence of adaptive and interacting Markov chain Monte Carlo algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3036","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:771268d06c59970190aec8b75b0034faf1f65c4cdc167f570ecd103122fb708a","target":"record","created_at":"2026-05-18T04:00:12Z","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":"042ca0c3e9d82e1d23dc4d40397635521b88c5a99ca6876a23bfbe29c1e7a1ca","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-03-14T10:20:53Z","title_canon_sha256":"a65d55fe6aeff98a21a62137faf08abe50b2eedbdc88000a39d981e7d99139a0"},"schema_version":"1.0","source":{"id":"1203.3036","kind":"arxiv","version":1}},"canonical_sha256":"83599e3e023c627035fa3967e3b7f7bc7ac8afbcecb969766d68a3ecb0a86e58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83599e3e023c627035fa3967e3b7f7bc7ac8afbcecb969766d68a3ecb0a86e58","first_computed_at":"2026-05-18T04:00:12.804905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:12.804905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5x34wv2Ph/sV7/S7r7GrncokjAeBZmbtzOTNsGgMUlqeMu6I7bdO/hWD6ShN8iYGgJXBXq83xx8kSUpdlZ6LDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:12.805637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:771268d06c59970190aec8b75b0034faf1f65c4cdc167f570ecd103122fb708a","sha256:1eea42fd3f07f99811c14bacaa70c0029347482adef66f5ae8d39bad9d1886cc"],"state_sha256":"4fb60630423d1a4749cd1a0eba786e5deb4a4156d7af521ec4173e485167b2ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zmaX8ZJNP/56nfA8WIPlv5iXDU8EGj1a0zjfWYO+I/rizLSFR0Vm6D7TuXerDySjygjdYz/IlmPd+qR/B2Y8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:38:51.978608Z","bundle_sha256":"6d918557db4c1756ac0aa9be7b93fda14d06646bc3233eaad20c9f289c87dafe"}}