{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TKFYQB2KJNJUTOOUBEFVGDHAR3","short_pith_number":"pith:TKFYQB2K","canonical_record":{"source":{"id":"1211.2582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-12T11:53:55Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"712d77d52d820fcfb7599029cbedda2c15dd91155bd9ab5f606e592c2b4cde80","abstract_canon_sha256":"9c995305c53d777402116c67a83b7a932cd0026ada8c17228c2b01b4c16b411f"},"schema_version":"1.0"},"canonical_sha256":"9a8b88074a4b5349b9d4090b530ce08efed0115ecb69ab82b61b90407632856b","source":{"kind":"arxiv","id":"1211.2582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2582","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2582v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2582","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"TKFYQB2KJNJU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TKFYQB2KJNJUTOOU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TKFYQB2K","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TKFYQB2KJNJUTOOUBEFVGDHAR3","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-12T11:53:55Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"712d77d52d820fcfb7599029cbedda2c15dd91155bd9ab5f606e592c2b4cde80","abstract_canon_sha256":"9c995305c53d777402116c67a83b7a932cd0026ada8c17228c2b01b4c16b411f"},"schema_version":"1.0"},"canonical_sha256":"9a8b88074a4b5349b9d4090b530ce08efed0115ecb69ab82b61b90407632856b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:02.928037Z","signature_b64":"/OhRlSAJ2CAnaMnkHiAu4SwbresXe1uLrWjxxMFGI/FDrsrXtedlmSuXYbU29HMGcEo3VARSm/unPCXaNbzoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a8b88074a4b5349b9d4090b530ce08efed0115ecb69ab82b61b90407632856b","last_reissued_at":"2026-05-18T03:41:02.927300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:02.927300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2582","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-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Er7xRTcvWvRvBnPhGxH9fLgKW2kGAbzfnhy9o86xbWnhu1xOCWIcl3Q5eBdYSIUI2GaluGIyDSNcmkGZ0yTWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:26:21.750112Z"},"content_sha256":"1e8f80056620905a4a2a002aeea0ad7bde6045968931839c733abae9ecd36171","schema_version":"1.0","event_id":"sha256:1e8f80056620905a4a2a002aeea0ad7bde6045968931839c733abae9ecd36171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TKFYQB2KJNJUTOOUBEFVGDHAR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequentially interacting Markov chain Monte Carlo methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Anthony Brockwell, Arnaud Doucet, Pierre Del Moral","submitted_at":"2012-11-12T11:53:55Z","abstract_excerpt":"Sequential Monte Carlo (SMC) is a methodology for sampling approximately from a sequence of probability distributions of increasing dimension and estimating their normalizing constants. We propose here an alternative methodology named Sequentially Interacting Markov Chain Monte Carlo (SIMCMC). SIMCMC methods work by generating interacting non-Markovian sequences which behave asymptotically like independent Metropolis-Hastings (MH) Markov chains with the desired limiting distributions. Contrary to SMC, SIMCMC allows us to iteratively improve our estimates in an MCMC-like fashion. We establish c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2582","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-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mc6tiT0YezrKESES1hTZ/e88+FcUSmdKNDcmA4C+NJo8TiXx/SyV1Jk837oN8uhR3Pvnc5KbAGwnlRxmfPSCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:26:21.750763Z"},"content_sha256":"a3cf23693a4673319338c30f1430a74ecfac53224ef0b14b104f8ed3b60389ae","schema_version":"1.0","event_id":"sha256:a3cf23693a4673319338c30f1430a74ecfac53224ef0b14b104f8ed3b60389ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKFYQB2KJNJUTOOUBEFVGDHAR3/bundle.json","state_url":"https://pith.science/pith/TKFYQB2KJNJUTOOUBEFVGDHAR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKFYQB2KJNJUTOOUBEFVGDHAR3/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-30T22:26:21Z","links":{"resolver":"https://pith.science/pith/TKFYQB2KJNJUTOOUBEFVGDHAR3","bundle":"https://pith.science/pith/TKFYQB2KJNJUTOOUBEFVGDHAR3/bundle.json","state":"https://pith.science/pith/TKFYQB2KJNJUTOOUBEFVGDHAR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKFYQB2KJNJUTOOUBEFVGDHAR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TKFYQB2KJNJUTOOUBEFVGDHAR3","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":"9c995305c53d777402116c67a83b7a932cd0026ada8c17228c2b01b4c16b411f","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-12T11:53:55Z","title_canon_sha256":"712d77d52d820fcfb7599029cbedda2c15dd91155bd9ab5f606e592c2b4cde80"},"schema_version":"1.0","source":{"id":"1211.2582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2582","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2582v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2582","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"TKFYQB2KJNJU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TKFYQB2KJNJUTOOU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TKFYQB2K","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:a3cf23693a4673319338c30f1430a74ecfac53224ef0b14b104f8ed3b60389ae","target":"graph","created_at":"2026-05-18T03:41:02Z","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":"Sequential Monte Carlo (SMC) is a methodology for sampling approximately from a sequence of probability distributions of increasing dimension and estimating their normalizing constants. We propose here an alternative methodology named Sequentially Interacting Markov Chain Monte Carlo (SIMCMC). SIMCMC methods work by generating interacting non-Markovian sequences which behave asymptotically like independent Metropolis-Hastings (MH) Markov chains with the desired limiting distributions. Contrary to SMC, SIMCMC allows us to iteratively improve our estimates in an MCMC-like fashion. We establish c","authors_text":"Anthony Brockwell, Arnaud Doucet, Pierre Del Moral","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-12T11:53:55Z","title":"Sequentially interacting Markov chain Monte Carlo methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2582","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:1e8f80056620905a4a2a002aeea0ad7bde6045968931839c733abae9ecd36171","target":"record","created_at":"2026-05-18T03:41:02Z","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":"9c995305c53d777402116c67a83b7a932cd0026ada8c17228c2b01b4c16b411f","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-12T11:53:55Z","title_canon_sha256":"712d77d52d820fcfb7599029cbedda2c15dd91155bd9ab5f606e592c2b4cde80"},"schema_version":"1.0","source":{"id":"1211.2582","kind":"arxiv","version":1}},"canonical_sha256":"9a8b88074a4b5349b9d4090b530ce08efed0115ecb69ab82b61b90407632856b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a8b88074a4b5349b9d4090b530ce08efed0115ecb69ab82b61b90407632856b","first_computed_at":"2026-05-18T03:41:02.927300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:02.927300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/OhRlSAJ2CAnaMnkHiAu4SwbresXe1uLrWjxxMFGI/FDrsrXtedlmSuXYbU29HMGcEo3VARSm/unPCXaNbzoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:02.928037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e8f80056620905a4a2a002aeea0ad7bde6045968931839c733abae9ecd36171","sha256:a3cf23693a4673319338c30f1430a74ecfac53224ef0b14b104f8ed3b60389ae"],"state_sha256":"f8b3a92b7c6ee227c3412029840eb1e849c3e538793b0e799eff57899a67c074"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJxg9YITsUDq6IqNKF6MTz3MYrCZ0S0bBZVXYW5mWbAPgs/UqzMrNnZ6Uq5tEfBnge6u2MRPTl0sUMcaQ6xvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:26:21.754431Z","bundle_sha256":"2b447a71cf87b52af02aaef03ee1988e0756adaab035c18d8298abde910c1246"}}