{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RLHFK7OVLTDLG36FTD2SUTGXSC","short_pith_number":"pith:RLHFK7OV","canonical_record":{"source":{"id":"2605.12807","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2026-05-12T22:59:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d3f052aa21bdbdbd1d180a316c32be343642c57b629ba045889ed8cbca376c7a","abstract_canon_sha256":"d098f7e283f2f152065047f75312a62ae3ab4703f3360f008609b1c971d3de8b"},"schema_version":"1.0"},"canonical_sha256":"8ace557dd55cc6b36fc598f52a4cd790806bbd8b47d807be369ecd22920e4539","source":{"kind":"arxiv","id":"2605.12807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12807","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12807v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12807","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"RLHFK7OVLTDL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"RLHFK7OVLTDLG36F","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"RLHFK7OV","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RLHFK7OVLTDLG36FTD2SUTGXSC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12807","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2026-05-12T22:59:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d3f052aa21bdbdbd1d180a316c32be343642c57b629ba045889ed8cbca376c7a","abstract_canon_sha256":"d098f7e283f2f152065047f75312a62ae3ab4703f3360f008609b1c971d3de8b"},"schema_version":"1.0"},"canonical_sha256":"8ace557dd55cc6b36fc598f52a4cd790806bbd8b47d807be369ecd22920e4539","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.580578Z","signature_b64":"Hn+e5YFiKZa60E6hwGn/Maz+pEW0wyNbUH5OYuBpZBV1rjeQbvL5j42VwAkcVUCrGGkyDUbv946MeKTDryWCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ace557dd55cc6b36fc598f52a4cd790806bbd8b47d807be369ecd22920e4539","last_reissued_at":"2026-05-18T03:09:12.579734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.579734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12807","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:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYF7Yw3GBH5nAWitLwbeA5JtLdDkUDsUPF6IHL3oLO1LQBPbKKTJD7L2ydajsT2v0GOj/H1g2NvBmnF091vSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:37:39.017715Z"},"content_sha256":"cca96a7b5eed678d19d366cd86e70b9c2e62924bd9c6b66a98cfdb391b948613","schema_version":"1.0","event_id":"sha256:cca96a7b5eed678d19d366cd86e70b9c2e62924bd9c6b66a98cfdb391b948613"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RLHFK7OVLTDLG36FTD2SUTGXSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Marginal Couplings for Metropolis-Hastings","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent.","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.CO","authors_text":"Ashish Khisti, Buu Phan, Gergely Flamich, Shahab Asoodeh","submitted_at":"2026-05-12T22:59:47Z","abstract_excerpt":"Convergence diagnosis for Markov chain Monte Carlo is a matter of fundamental importance in computational statistics: it determines the resources allocated to a particular sampling problem and influences the practitioner's view of the quality of estimates obtained from a Markov chain. Motivated by this, we contribute to the emerging class of coupling-based convergence diagnostic algorithms. Concretely, we study coupling multiple Metropolis-Hastings chains using multi-marginal coupling. We introduce a natural objective for this setting and establish lower and upper bounds by drawing connections"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments on grand couplings of Markov chains show that our methods improve coalescence rates across dimensions, reducing meeting times by up to 50% compared with existing baselines.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The adaptive rule for updating the point process preserves the validity of the multi-marginal coupling while removing the dimension-dependent runtime bottleneck.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Multi-marginal couplings combined with an adaptive shared-randomness Poisson Monte Carlo method improve coalescence rates for multiple Metropolis-Hastings chains, cutting meeting times by up to 50%.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"761a91710c71190b481c718f40b9413a03e1b2a68b26c3c18f43f60185324094"},"source":{"id":"2605.12807","kind":"arxiv","version":1},"verdict":{"id":"d49ce706-634f-41b9-8051-cc91f3a2477d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:18:35.114651Z","strongest_claim":"Experiments on grand couplings of Markov chains show that our methods improve coalescence rates across dimensions, reducing meeting times by up to 50% compared with existing baselines.","one_line_summary":"Multi-marginal couplings combined with an adaptive shared-randomness Poisson Monte Carlo method improve coalescence rates for multiple Metropolis-Hastings chains, cutting meeting times by up to 50%.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The adaptive rule for updating the point process preserves the validity of the multi-marginal coupling while removing the dimension-dependent runtime bottleneck.","pith_extraction_headline":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent."},"references":{"count":29,"sample":[{"doi":"","year":1903,"title":"Pairwise optimal coupling of multiple random variables.arXiv preprint arXiv:1903.00632, 2019","work_id":"8f80251f-30e1-429b-9f28-02dc1dec5c4c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Estimating convergence of markov chains with l-lag couplings.Advances in neural information processing systems, 32, 2019","work_id":"e604119b-7365-4b2b-98fa-5d2b4af1ae95","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"General methods for monitoring convergence of iterative simulations.Journal of computational and graphical statistics, 7(4):434–455, 1998","work_id":"0142c83a-1763-4050-97d9-3822e1a47301","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"A coupling-based approach to f-divergences diagnostics for markov chain monte carlo.arXiv preprint arXiv:2510.07559, 2025","work_id":"7c4ca0bb-e7de-409e-a53a-a22607eba396","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Coupling without communi- cation and drafter-invariant speculative decoding","work_id":"72c1ef01-9d86-40ed-8b59-2c45ff68ebba","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":29,"snapshot_sha256":"5381f48e6a7fc5aaf43e51e262a3acddf7b0c36a5d77544ac5ff3c16990d0342","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"af774157885fce277b8851c63a1f15f1547ee5c08103bd80fcc275cfc3f7e52e"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d49ce706-634f-41b9-8051-cc91f3a2477d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19whhmgRwJSq2FKv1YdltkSYLHvWYWXNhCdXZT3dThveBAgOxnor1AvZ95LDKzMKPZHKt5c394YL7mkrKZXNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T02:37:39.018737Z"},"content_sha256":"8c77dec64e6afba2718782e526f4b249a40d179c8138380487ad2bdb301b6a9d","schema_version":"1.0","event_id":"sha256:8c77dec64e6afba2718782e526f4b249a40d179c8138380487ad2bdb301b6a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/bundle.json","state_url":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/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-22T02:37:39Z","links":{"resolver":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC","bundle":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/bundle.json","state":"https://pith.science/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLHFK7OVLTDLG36FTD2SUTGXSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RLHFK7OVLTDLG36FTD2SUTGXSC","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":"d098f7e283f2f152065047f75312a62ae3ab4703f3360f008609b1c971d3de8b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2026-05-12T22:59:47Z","title_canon_sha256":"d3f052aa21bdbdbd1d180a316c32be343642c57b629ba045889ed8cbca376c7a"},"schema_version":"1.0","source":{"id":"2605.12807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12807","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12807v1","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12807","created_at":"2026-05-18T03:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"RLHFK7OVLTDL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"RLHFK7OVLTDLG36F","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"RLHFK7OV","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:8c77dec64e6afba2718782e526f4b249a40d179c8138380487ad2bdb301b6a9d","target":"graph","created_at":"2026-05-18T03:09: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Experiments on grand couplings of Markov chains show that our methods improve coalescence rates across dimensions, reducing meeting times by up to 50% compared with existing baselines."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The adaptive rule for updating the point process preserves the validity of the multi-marginal coupling while removing the dimension-dependent runtime bottleneck."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Multi-marginal couplings combined with an adaptive shared-randomness Poisson Monte Carlo method improve coalescence rates for multiple Metropolis-Hastings chains, cutting meeting times by up to 50%."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent."}],"snapshot_sha256":"761a91710c71190b481c718f40b9413a03e1b2a68b26c3c18f43f60185324094"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"af774157885fce277b8851c63a1f15f1547ee5c08103bd80fcc275cfc3f7e52e"},"paper":{"abstract_excerpt":"Convergence diagnosis for Markov chain Monte Carlo is a matter of fundamental importance in computational statistics: it determines the resources allocated to a particular sampling problem and influences the practitioner's view of the quality of estimates obtained from a Markov chain. Motivated by this, we contribute to the emerging class of coupling-based convergence diagnostic algorithms. Concretely, we study coupling multiple Metropolis-Hastings chains using multi-marginal coupling. We introduce a natural objective for this setting and establish lower and upper bounds by drawing connections","authors_text":"Ashish Khisti, Buu Phan, Gergely Flamich, Shahab Asoodeh","cross_cats":["cs.IT","math.IT"],"headline":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2026-05-12T22:59:47Z","title":"Multi-Marginal Couplings for Metropolis-Hastings"},"references":{"count":29,"internal_anchors":1,"resolved_work":29,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Pairwise optimal coupling of multiple random variables.arXiv preprint arXiv:1903.00632, 2019","work_id":"8f80251f-30e1-429b-9f28-02dc1dec5c4c","year":1903},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Estimating convergence of markov chains with l-lag couplings.Advances in neural information processing systems, 32, 2019","work_id":"e604119b-7365-4b2b-98fa-5d2b4af1ae95","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"General methods for monitoring convergence of iterative simulations.Journal of computational and graphical statistics, 7(4):434–455, 1998","work_id":"0142c83a-1763-4050-97d9-3822e1a47301","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A coupling-based approach to f-divergences diagnostics for markov chain monte carlo.arXiv preprint arXiv:2510.07559, 2025","work_id":"7c4ca0bb-e7de-409e-a53a-a22607eba396","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Coupling without communi- cation and drafter-invariant speculative decoding","work_id":"72c1ef01-9d86-40ed-8b59-2c45ff68ebba","year":2025}],"snapshot_sha256":"5381f48e6a7fc5aaf43e51e262a3acddf7b0c36a5d77544ac5ff3c16990d0342"},"source":{"id":"2605.12807","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:18:35.114651Z","id":"d49ce706-634f-41b9-8051-cc91f3a2477d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Multi-marginal couplings combined with an adaptive shared-randomness Poisson Monte Carlo method improve coalescence rates for multiple Metropolis-Hastings chains, cutting meeting times by up to 50%.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Multi-marginal couplings with adaptive Poisson Monte Carlo reduce meeting times for multiple Metropolis-Hastings chains by up to 50 percent.","strongest_claim":"Experiments on grand couplings of Markov chains show that our methods improve coalescence rates across dimensions, reducing meeting times by up to 50% compared with existing baselines.","weakest_assumption":"The adaptive rule for updating the point process preserves the validity of the multi-marginal coupling while removing the dimension-dependent runtime bottleneck."}},"verdict_id":"d49ce706-634f-41b9-8051-cc91f3a2477d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cca96a7b5eed678d19d366cd86e70b9c2e62924bd9c6b66a98cfdb391b948613","target":"record","created_at":"2026-05-18T03:09: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":"d098f7e283f2f152065047f75312a62ae3ab4703f3360f008609b1c971d3de8b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2026-05-12T22:59:47Z","title_canon_sha256":"d3f052aa21bdbdbd1d180a316c32be343642c57b629ba045889ed8cbca376c7a"},"schema_version":"1.0","source":{"id":"2605.12807","kind":"arxiv","version":1}},"canonical_sha256":"8ace557dd55cc6b36fc598f52a4cd790806bbd8b47d807be369ecd22920e4539","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ace557dd55cc6b36fc598f52a4cd790806bbd8b47d807be369ecd22920e4539","first_computed_at":"2026-05-18T03:09:12.579734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:12.579734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hn+e5YFiKZa60E6hwGn/Maz+pEW0wyNbUH5OYuBpZBV1rjeQbvL5j42VwAkcVUCrGGkyDUbv946MeKTDryWCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:12.580578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cca96a7b5eed678d19d366cd86e70b9c2e62924bd9c6b66a98cfdb391b948613","sha256:8c77dec64e6afba2718782e526f4b249a40d179c8138380487ad2bdb301b6a9d"],"state_sha256":"7cb5303612a5dcff52b4ec8f85ffa52a61911ab449cb607f6c321186bdecff6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gu0xIKOWq0vgbhNXELRaGwWCAgMBrNueKmzIBJXY5fUIeOqANtjUVyR1So/eyWpNxYD9YPVzr0fVtYtwL7AZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T02:37:39.023717Z","bundle_sha256":"1589c61701f18e1f5fd88d41dee557d48431961fce48d83352c654b4357c62e2"}}