{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WSEVTYLMX4WG5UXPMTRN2XJCMF","short_pith_number":"pith:WSEVTYLM","canonical_record":{"source":{"id":"1911.09698","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"stat.CO","submitted_at":"2019-11-21T19:02:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f500f0b85dffc5fdbdf6292b200da99b36a7f8a4367d0e992e45f2ff16a81b2e","abstract_canon_sha256":"f664076499f2f2774fb4084357f4ae6a6670042f55c62640caa430fafec40176"},"schema_version":"1.0"},"canonical_sha256":"b48959e16cbf2c6ed2ef64e2dd5d22614e5553dcda5fdd7f1275c6186f19fecd","source":{"kind":"arxiv","id":"1911.09698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.09698","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1911.09698v1","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09698","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"WSEVTYLMX4WG","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"pith_short_16","alias_value":"WSEVTYLMX4WG5UXP","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"pith_short_8","alias_value":"WSEVTYLM","created_at":"2026-07-05T00:21:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WSEVTYLMX4WG5UXPMTRN2XJCMF","target":"record","payload":{"canonical_record":{"source":{"id":"1911.09698","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"stat.CO","submitted_at":"2019-11-21T19:02:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f500f0b85dffc5fdbdf6292b200da99b36a7f8a4367d0e992e45f2ff16a81b2e","abstract_canon_sha256":"f664076499f2f2774fb4084357f4ae6a6670042f55c62640caa430fafec40176"},"schema_version":"1.0"},"canonical_sha256":"b48959e16cbf2c6ed2ef64e2dd5d22614e5553dcda5fdd7f1275c6186f19fecd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:17.074740Z","signature_b64":"aBZxgWqVkgjdgDKEHyTKOLMKb/y1R67wF0NFIerCOa72d+XKRtQ+46iL17SdeWjPmPGyevryNI0AsQpwfwxWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b48959e16cbf2c6ed2ef64e2dd5d22614e5553dcda5fdd7f1275c6186f19fecd","last_reissued_at":"2026-07-05T00:21:17.074371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:17.074371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.09698","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-07-05T00:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfZe1WWbmRtNOEkFRHZ2u7H77eNmpS5GnPZOSqmMAmhk8HAGQEmi/QVH9z/CLXB7jcXFuzOIu7B1vy7VBzCBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:14:59.439527Z"},"content_sha256":"660ec540e784ba8a9f5b5e3d73d09ff2abbc3fa69e391adc597e84b2d8f928a8","schema_version":"1.0","event_id":"sha256:660ec540e784ba8a9f5b5e3d73d09ff2abbc3fa69e391adc597e84b2d8f928a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WSEVTYLMX4WG5UXPMTRN2XJCMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallelising MCMC via Random Forests","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Christian P. Robert, Wu Changye","submitted_at":"2019-11-21T19:02:13Z","abstract_excerpt":"For Bayesian computation in big data contexts, the divide-and-conquer MCMC concept splits the whole data set into batches, runs MCMC algorithms separately over each batch to produce samples of parameters, and combines them to produce an approximation of the target distribution. In this article, we embed random forests into this framework and use each subposterior/partial-posterior as a proposal distribution to implement importance sampling. Unlike the existing divide-and-conquer MCMC, our methods are based on scaled subposteriors, whose scale factors are not necessarily restricted to being equ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09698","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.09698/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMAnbOneaOde0VbmiHdmsrECrOOix2TKjciMAyVDJTZ2mdWPsCvHvlw7bkfJxW7cVq2XRNJCTx/cCw6kLfTLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:14:59.439901Z"},"content_sha256":"fbbf6bf52d63b674f22605fbb99bbd0f3780384979573ed4d029a0019f34d895","schema_version":"1.0","event_id":"sha256:fbbf6bf52d63b674f22605fbb99bbd0f3780384979573ed4d029a0019f34d895"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSEVTYLMX4WG5UXPMTRN2XJCMF/bundle.json","state_url":"https://pith.science/pith/WSEVTYLMX4WG5UXPMTRN2XJCMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSEVTYLMX4WG5UXPMTRN2XJCMF/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-07-05T09:14:59Z","links":{"resolver":"https://pith.science/pith/WSEVTYLMX4WG5UXPMTRN2XJCMF","bundle":"https://pith.science/pith/WSEVTYLMX4WG5UXPMTRN2XJCMF/bundle.json","state":"https://pith.science/pith/WSEVTYLMX4WG5UXPMTRN2XJCMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSEVTYLMX4WG5UXPMTRN2XJCMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WSEVTYLMX4WG5UXPMTRN2XJCMF","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":"f664076499f2f2774fb4084357f4ae6a6670042f55c62640caa430fafec40176","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"stat.CO","submitted_at":"2019-11-21T19:02:13Z","title_canon_sha256":"f500f0b85dffc5fdbdf6292b200da99b36a7f8a4367d0e992e45f2ff16a81b2e"},"schema_version":"1.0","source":{"id":"1911.09698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.09698","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1911.09698v1","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09698","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"WSEVTYLMX4WG","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"pith_short_16","alias_value":"WSEVTYLMX4WG5UXP","created_at":"2026-07-05T00:21:17Z"},{"alias_kind":"pith_short_8","alias_value":"WSEVTYLM","created_at":"2026-07-05T00:21:17Z"}],"graph_snapshots":[{"event_id":"sha256:fbbf6bf52d63b674f22605fbb99bbd0f3780384979573ed4d029a0019f34d895","target":"graph","created_at":"2026-07-05T00:21:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.09698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For Bayesian computation in big data contexts, the divide-and-conquer MCMC concept splits the whole data set into batches, runs MCMC algorithms separately over each batch to produce samples of parameters, and combines them to produce an approximation of the target distribution. In this article, we embed random forests into this framework and use each subposterior/partial-posterior as a proposal distribution to implement importance sampling. Unlike the existing divide-and-conquer MCMC, our methods are based on scaled subposteriors, whose scale factors are not necessarily restricted to being equ","authors_text":"Christian P. Robert, Wu Changye","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"stat.CO","submitted_at":"2019-11-21T19:02:13Z","title":"Parallelising MCMC via Random Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09698","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:660ec540e784ba8a9f5b5e3d73d09ff2abbc3fa69e391adc597e84b2d8f928a8","target":"record","created_at":"2026-07-05T00:21:17Z","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":"f664076499f2f2774fb4084357f4ae6a6670042f55c62640caa430fafec40176","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"stat.CO","submitted_at":"2019-11-21T19:02:13Z","title_canon_sha256":"f500f0b85dffc5fdbdf6292b200da99b36a7f8a4367d0e992e45f2ff16a81b2e"},"schema_version":"1.0","source":{"id":"1911.09698","kind":"arxiv","version":1}},"canonical_sha256":"b48959e16cbf2c6ed2ef64e2dd5d22614e5553dcda5fdd7f1275c6186f19fecd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b48959e16cbf2c6ed2ef64e2dd5d22614e5553dcda5fdd7f1275c6186f19fecd","first_computed_at":"2026-07-05T00:21:17.074371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:21:17.074371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aBZxgWqVkgjdgDKEHyTKOLMKb/y1R67wF0NFIerCOa72d+XKRtQ+46iL17SdeWjPmPGyevryNI0AsQpwfwxWDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:21:17.074740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.09698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:660ec540e784ba8a9f5b5e3d73d09ff2abbc3fa69e391adc597e84b2d8f928a8","sha256:fbbf6bf52d63b674f22605fbb99bbd0f3780384979573ed4d029a0019f34d895"],"state_sha256":"4547832be4cf32c6cfca39aeca868dafffa03bef0313aebab86eee675da2af64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJk6zq/1hKOJGFZ9fW45BPqOWBY8LHIMRRKJvoeUQua71Vtd1P9QDmhgSzvTWshJJ/S/Jh2xDQ2dJ0bcPcemAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:14:59.441907Z","bundle_sha256":"66d4e52937554d8de6f2ca1f612abe1c22bd6ee61e5292fe6a7472038e3cabec"}}