{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CGHYWWJAP5QK7BHQ7NCGYZZQK4","short_pith_number":"pith:CGHYWWJA","canonical_record":{"source":{"id":"1804.02719","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T17:09:03Z","cross_cats_sorted":[],"title_canon_sha256":"fd105622e62402323cd3c03e4c2d698ee85e869bbc3c5ef4147b8be82dd2f7b6","abstract_canon_sha256":"81cecefa2f6ae2b80458854ec6e88434485d167262138697c4725a404d7fe581"},"schema_version":"1.0"},"canonical_sha256":"118f8b59207f60af84f0fb446c6730571ec38824049499e73c08bdcd12706550","source":{"kind":"arxiv","id":"1804.02719","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02719","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02719v2","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02719","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"CGHYWWJAP5QK","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGHYWWJAP5QK7BHQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGHYWWJA","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CGHYWWJAP5QK7BHQ7NCGYZZQK4","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02719","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T17:09:03Z","cross_cats_sorted":[],"title_canon_sha256":"fd105622e62402323cd3c03e4c2d698ee85e869bbc3c5ef4147b8be82dd2f7b6","abstract_canon_sha256":"81cecefa2f6ae2b80458854ec6e88434485d167262138697c4725a404d7fe581"},"schema_version":"1.0"},"canonical_sha256":"118f8b59207f60af84f0fb446c6730571ec38824049499e73c08bdcd12706550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.426216Z","signature_b64":"fQUey4HNbK5yXsaYVVfzNBkoemgNZ+INi+J7TgpjndsXzfEF9iAhkcqEiHrH6Css+gwX3NScg5R4HraylR+MBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118f8b59207f60af84f0fb446c6730571ec38824049499e73c08bdcd12706550","last_reissued_at":"2026-05-18T00:18:45.425580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.425580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02719","source_version":2,"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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Xd4/jLcZqPlthTMC0JGLdC3Dey73fjiqemIr0wXlXZu5O6xc+GG4+96r4ooSDfvE30w1tmokx0nUJumTHEdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:35:48.016950Z"},"content_sha256":"8db43338bc95e92842e23b743135c696216566c1093575672b05ee4c8b9be9c1","schema_version":"1.0","event_id":"sha256:8db43338bc95e92842e23b743135c696216566c1093575672b05ee4c8b9be9c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CGHYWWJAP5QK7BHQ7NCGYZZQK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating MCMC Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Changye Wu (University Paris Dauphine PSL), Christian P. Robert (University Paris Dauphine PSL, Nick Tawn (University of Warwick), University of Warwick), Victor Elvira (IMT Lille Douai)","submitted_at":"2018-04-08T17:09:03Z","abstract_excerpt":"Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the nature of the target, but it also potentially induces a lengthy exploration of this target, with a requirement on the number of simulations that grows with the dimension of the problem and with the complexity of the data behind it. Several techniques are available towards accelerating the convergence of these Monte Carlo algorithms, either at the exploration level (as in tempering, Ham"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02719","kind":"arxiv","version":2},"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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhbwkcaLnRKqwZhZDfJ23YmZhIZXdk4iIRaGzNklZzd/rH0U/vj/Nl+FqIaIig/IP7kvpUC+XLEv8juBhrkVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:35:48.017280Z"},"content_sha256":"7ca4336fdcd4b8611a3f34b0d478d35ae731771264cd9fb02c651b5a67b523ef","schema_version":"1.0","event_id":"sha256:7ca4336fdcd4b8611a3f34b0d478d35ae731771264cd9fb02c651b5a67b523ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGHYWWJAP5QK7BHQ7NCGYZZQK4/bundle.json","state_url":"https://pith.science/pith/CGHYWWJAP5QK7BHQ7NCGYZZQK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGHYWWJAP5QK7BHQ7NCGYZZQK4/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-11T14:35:48Z","links":{"resolver":"https://pith.science/pith/CGHYWWJAP5QK7BHQ7NCGYZZQK4","bundle":"https://pith.science/pith/CGHYWWJAP5QK7BHQ7NCGYZZQK4/bundle.json","state":"https://pith.science/pith/CGHYWWJAP5QK7BHQ7NCGYZZQK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGHYWWJAP5QK7BHQ7NCGYZZQK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CGHYWWJAP5QK7BHQ7NCGYZZQK4","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":"81cecefa2f6ae2b80458854ec6e88434485d167262138697c4725a404d7fe581","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T17:09:03Z","title_canon_sha256":"fd105622e62402323cd3c03e4c2d698ee85e869bbc3c5ef4147b8be82dd2f7b6"},"schema_version":"1.0","source":{"id":"1804.02719","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02719","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02719v2","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02719","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"CGHYWWJAP5QK","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGHYWWJAP5QK7BHQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGHYWWJA","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:7ca4336fdcd4b8611a3f34b0d478d35ae731771264cd9fb02c651b5a67b523ef","target":"graph","created_at":"2026-05-18T00:18:45Z","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":"Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the nature of the target, but it also potentially induces a lengthy exploration of this target, with a requirement on the number of simulations that grows with the dimension of the problem and with the complexity of the data behind it. Several techniques are available towards accelerating the convergence of these Monte Carlo algorithms, either at the exploration level (as in tempering, Ham","authors_text":"Changye Wu (University Paris Dauphine PSL), Christian P. Robert (University Paris Dauphine PSL, Nick Tawn (University of Warwick), University of Warwick), Victor Elvira (IMT Lille Douai)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T17:09:03Z","title":"Accelerating MCMC Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02719","kind":"arxiv","version":2},"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:8db43338bc95e92842e23b743135c696216566c1093575672b05ee4c8b9be9c1","target":"record","created_at":"2026-05-18T00:18:45Z","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":"81cecefa2f6ae2b80458854ec6e88434485d167262138697c4725a404d7fe581","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T17:09:03Z","title_canon_sha256":"fd105622e62402323cd3c03e4c2d698ee85e869bbc3c5ef4147b8be82dd2f7b6"},"schema_version":"1.0","source":{"id":"1804.02719","kind":"arxiv","version":2}},"canonical_sha256":"118f8b59207f60af84f0fb446c6730571ec38824049499e73c08bdcd12706550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"118f8b59207f60af84f0fb446c6730571ec38824049499e73c08bdcd12706550","first_computed_at":"2026-05-18T00:18:45.425580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:45.425580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fQUey4HNbK5yXsaYVVfzNBkoemgNZ+INi+J7TgpjndsXzfEF9iAhkcqEiHrH6Css+gwX3NScg5R4HraylR+MBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:45.426216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02719","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8db43338bc95e92842e23b743135c696216566c1093575672b05ee4c8b9be9c1","sha256:7ca4336fdcd4b8611a3f34b0d478d35ae731771264cd9fb02c651b5a67b523ef"],"state_sha256":"3b3497b10325b87c4aeab0f757612d082a61c452d6f01d488c32a7e9aad78943"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wKgbnNooRVKFp5Ob0zbutREEL6kFIJWoJB4KUVxs22wgAXqvxzrRnF48LNraYCNUtocXD1G8/gy8c/apxpEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:35:48.019216Z","bundle_sha256":"4003e6c8049be0dbfea890be982c151c3b9705d5ee9fe9a616bb06283c1b0fa5"}}