{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KD57MIDN4LFBMGLBSNT7MDWPZR","short_pith_number":"pith:KD57MIDN","canonical_record":{"source":{"id":"2605.22301","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-21T10:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"6ee7d5ba0bac9120cac0d376a910a0d621b02e84a9098966816f19c43ea81ffe","abstract_canon_sha256":"ee05da8d2440894d8f1172713c864e834174785e06a166c48d5261605a98e196"},"schema_version":"1.0"},"canonical_sha256":"50fbf6206de2ca1619619367f60ecfcc69eb4fe9b54520e0232e2f6a9d7d63f8","source":{"kind":"arxiv","id":"2605.22301","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22301","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22301v1","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22301","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"pith_short_12","alias_value":"KD57MIDN4LFB","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"pith_short_16","alias_value":"KD57MIDN4LFBMGLB","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"pith_short_8","alias_value":"KD57MIDN","created_at":"2026-05-22T01:04:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KD57MIDN4LFBMGLBSNT7MDWPZR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22301","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-21T10:47:41Z","cross_cats_sorted":[],"title_canon_sha256":"6ee7d5ba0bac9120cac0d376a910a0d621b02e84a9098966816f19c43ea81ffe","abstract_canon_sha256":"ee05da8d2440894d8f1172713c864e834174785e06a166c48d5261605a98e196"},"schema_version":"1.0"},"canonical_sha256":"50fbf6206de2ca1619619367f60ecfcc69eb4fe9b54520e0232e2f6a9d7d63f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:36.872528Z","signature_b64":"JjI1AVVgHxkdXse6gDmaah+bfFh4az1+he7gn4BnOOYZR5daUI9rpLTDVSf0phdyHnLZXZ/pqqtP/fhA5YQ2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50fbf6206de2ca1619619367f60ecfcc69eb4fe9b54520e0232e2f6a9d7d63f8","last_reissued_at":"2026-05-22T01:04:36.871696Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:36.871696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22301","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-22T01:04:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wX/KekxJ5dJzdhDZ1t08q6kNEqjXp8asM0HmRYDZrkAL8agvPT+wxoakSHJrLVCXWDiXBF9lmbOlxChcviCbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:48:53.492473Z"},"content_sha256":"e807d1a83fafae2923fa91f0594dc41ef223040285ae033a99e1fa810d898f09","schema_version":"1.0","event_id":"sha256:e807d1a83fafae2923fa91f0594dc41ef223040285ae033a99e1fa810d898f09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KD57MIDN4LFBMGLBSNT7MDWPZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chained Markov melding using divide and conquer sequential Monte Carlo","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Robert J. B. Goudie, Yixuan Liu","submitted_at":"2026-05-21T10:47:41Z","abstract_excerpt":"Specifying a full Bayesian model that integrates multiple data sources can be challenging. One natural approach is to specify each individual model separately and join them afterwards. This is the approach adopted in Markov melding. However, when adjacent submodels share common quantities, as in chained Markov melding, posterior inference can be challenging for existing MCMC-based approaches. In this paper, we propose a new multi-stage sampler for chained Markov models involving an arbitrary number of submodels. The proposed sampler adopts a divide-and-conquer sequential Monte Carlo approach f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22301","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/2605.22301/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-05-22T01:04:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suH5+0Yo3hSZSNyIaZFbTde7wrRkL/pUqdwQ8/+DpGKbIr4t5U34ybSXFZFCbeI4p8So6xyhPjqjchEj/IvgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:48:53.493157Z"},"content_sha256":"34be6d3694142a382a19b0e33384780b0a463514d991b044f5133cc6c9def9c4","schema_version":"1.0","event_id":"sha256:34be6d3694142a382a19b0e33384780b0a463514d991b044f5133cc6c9def9c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KD57MIDN4LFBMGLBSNT7MDWPZR/bundle.json","state_url":"https://pith.science/pith/KD57MIDN4LFBMGLBSNT7MDWPZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KD57MIDN4LFBMGLBSNT7MDWPZR/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-10T05:48:53Z","links":{"resolver":"https://pith.science/pith/KD57MIDN4LFBMGLBSNT7MDWPZR","bundle":"https://pith.science/pith/KD57MIDN4LFBMGLBSNT7MDWPZR/bundle.json","state":"https://pith.science/pith/KD57MIDN4LFBMGLBSNT7MDWPZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KD57MIDN4LFBMGLBSNT7MDWPZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KD57MIDN4LFBMGLBSNT7MDWPZR","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":"ee05da8d2440894d8f1172713c864e834174785e06a166c48d5261605a98e196","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-21T10:47:41Z","title_canon_sha256":"6ee7d5ba0bac9120cac0d376a910a0d621b02e84a9098966816f19c43ea81ffe"},"schema_version":"1.0","source":{"id":"2605.22301","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22301","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22301v1","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22301","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"pith_short_12","alias_value":"KD57MIDN4LFB","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"pith_short_16","alias_value":"KD57MIDN4LFBMGLB","created_at":"2026-05-22T01:04:36Z"},{"alias_kind":"pith_short_8","alias_value":"KD57MIDN","created_at":"2026-05-22T01:04:36Z"}],"graph_snapshots":[{"event_id":"sha256:34be6d3694142a382a19b0e33384780b0a463514d991b044f5133cc6c9def9c4","target":"graph","created_at":"2026-05-22T01:04:36Z","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/2605.22301/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Specifying a full Bayesian model that integrates multiple data sources can be challenging. One natural approach is to specify each individual model separately and join them afterwards. This is the approach adopted in Markov melding. However, when adjacent submodels share common quantities, as in chained Markov melding, posterior inference can be challenging for existing MCMC-based approaches. In this paper, we propose a new multi-stage sampler for chained Markov models involving an arbitrary number of submodels. The proposed sampler adopts a divide-and-conquer sequential Monte Carlo approach f","authors_text":"Robert J. B. Goudie, Yixuan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-21T10:47:41Z","title":"Chained Markov melding using divide and conquer sequential Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22301","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:e807d1a83fafae2923fa91f0594dc41ef223040285ae033a99e1fa810d898f09","target":"record","created_at":"2026-05-22T01:04:36Z","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":"ee05da8d2440894d8f1172713c864e834174785e06a166c48d5261605a98e196","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-05-21T10:47:41Z","title_canon_sha256":"6ee7d5ba0bac9120cac0d376a910a0d621b02e84a9098966816f19c43ea81ffe"},"schema_version":"1.0","source":{"id":"2605.22301","kind":"arxiv","version":1}},"canonical_sha256":"50fbf6206de2ca1619619367f60ecfcc69eb4fe9b54520e0232e2f6a9d7d63f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50fbf6206de2ca1619619367f60ecfcc69eb4fe9b54520e0232e2f6a9d7d63f8","first_computed_at":"2026-05-22T01:04:36.871696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:36.871696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JjI1AVVgHxkdXse6gDmaah+bfFh4az1+he7gn4BnOOYZR5daUI9rpLTDVSf0phdyHnLZXZ/pqqtP/fhA5YQ2Cw==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:36.872528Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22301","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e807d1a83fafae2923fa91f0594dc41ef223040285ae033a99e1fa810d898f09","sha256:34be6d3694142a382a19b0e33384780b0a463514d991b044f5133cc6c9def9c4"],"state_sha256":"862e18683510c89ae99edee20e9e3f96cfd6b113b5ed7cf4b380a1894434c9f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUI0FTJY/65FJrvzeIVG92IWIsb4tPSN/v661gO/6mxbMGcgVy6ENbO0I/9D373pBzqny0SGBIQQuxAg9QUZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:48:53.497540Z","bundle_sha256":"dbb4cbadee36ca2cebab4797cde8f7b0eefb3267f027dfd08b87e5414b3e3d1d"}}