{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XZMIWLJFMFUBTKAOPGDNYAQW3N","short_pith_number":"pith:XZMIWLJF","canonical_record":{"source":{"id":"1605.09454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-31T00:40:09Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"0c5c736fab88b2bb5a6d82156544b5a2e6feb0f1884b10a81e4759408e25ec3f","abstract_canon_sha256":"5c630118bec0e34601709469c21c5f8a008912a2ce1010434678ef60ca190f3b"},"schema_version":"1.0"},"canonical_sha256":"be588b2d25616819a80e7986dc0216db4b5c90cea0575c86b74f5ed105964c95","source":{"kind":"arxiv","id":"1605.09454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09454","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09454v1","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09454","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"XZMIWLJFMFUB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZMIWLJFMFUBTKAO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZMIWLJF","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XZMIWLJFMFUBTKAOPGDNYAQW3N","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-31T00:40:09Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"0c5c736fab88b2bb5a6d82156544b5a2e6feb0f1884b10a81e4759408e25ec3f","abstract_canon_sha256":"5c630118bec0e34601709469c21c5f8a008912a2ce1010434678ef60ca190f3b"},"schema_version":"1.0"},"canonical_sha256":"be588b2d25616819a80e7986dc0216db4b5c90cea0575c86b74f5ed105964c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:17.265719Z","signature_b64":"8faZEitbcmDbpQLCAxXhAUAWZZIoHIxFw8aMcUVAfi5AVBcla/PD+HRjsR/OLD8CzBoT9RFppRX/VO/qSzuKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be588b2d25616819a80e7986dc0216db4b5c90cea0575c86b74f5ed105964c95","last_reissued_at":"2026-05-18T01:13:17.265179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:17.265179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09454","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-18T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKhOD4nKP2Qv064/RjkbkPBjonwEVf/5ETcgTPtJ45cf21ESr55CH26ABVmXtx/mTp/ndhDJauq+ZlFFuJBeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:17:43.499618Z"},"content_sha256":"6971d6abb678e67bbdfc66d1f8b5739ceb646efffdbc9883b5624cf78c180f00","schema_version":"1.0","event_id":"sha256:6971d6abb678e67bbdfc66d1f8b5739ceb646efffdbc9883b5624cf78c180f00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XZMIWLJFMFUBTKAOPGDNYAQW3N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Markov Chain Monte Carlo via Spectral Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Aaron Smith, Guillaume W. Basse, Natesh S. Pillai","submitted_at":"2016-05-31T00:40:09Z","abstract_excerpt":"As it has become common to use many computer cores in routine applications, finding good ways to parallelize popular algorithms has become increasingly important. In this paper, we present a parallelization scheme for Markov chain Monte Carlo (MCMC) methods based on spectral clustering of the underlying state space, generalizing earlier work on parallelization of MCMC methods by state space partitioning. We show empirically that this approach speeds up MCMC sampling for multimodal distributions and that it can be usefully applied in greater generality than several related algorithms. Our algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09454","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-18T01:13:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXyicLi3El0qqC+Z54l3pA5riaMxGdGPXzmreAsyLfO3ZEBtmLNz0QGyWNg/q3xPQ+MgTuL/pdneZWkIYGEEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:17:43.500067Z"},"content_sha256":"6b3a284a4e8d326d4091e33a1ca3cb58f61d5d73f99ae97c1862ab9386fcf919","schema_version":"1.0","event_id":"sha256:6b3a284a4e8d326d4091e33a1ca3cb58f61d5d73f99ae97c1862ab9386fcf919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZMIWLJFMFUBTKAOPGDNYAQW3N/bundle.json","state_url":"https://pith.science/pith/XZMIWLJFMFUBTKAOPGDNYAQW3N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZMIWLJFMFUBTKAOPGDNYAQW3N/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-30T04:17:43Z","links":{"resolver":"https://pith.science/pith/XZMIWLJFMFUBTKAOPGDNYAQW3N","bundle":"https://pith.science/pith/XZMIWLJFMFUBTKAOPGDNYAQW3N/bundle.json","state":"https://pith.science/pith/XZMIWLJFMFUBTKAOPGDNYAQW3N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZMIWLJFMFUBTKAOPGDNYAQW3N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XZMIWLJFMFUBTKAOPGDNYAQW3N","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":"5c630118bec0e34601709469c21c5f8a008912a2ce1010434678ef60ca190f3b","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-31T00:40:09Z","title_canon_sha256":"0c5c736fab88b2bb5a6d82156544b5a2e6feb0f1884b10a81e4759408e25ec3f"},"schema_version":"1.0","source":{"id":"1605.09454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09454","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09454v1","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09454","created_at":"2026-05-18T01:13:17Z"},{"alias_kind":"pith_short_12","alias_value":"XZMIWLJFMFUB","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZMIWLJFMFUBTKAO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZMIWLJF","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:6b3a284a4e8d326d4091e33a1ca3cb58f61d5d73f99ae97c1862ab9386fcf919","target":"graph","created_at":"2026-05-18T01:13: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"},"paper":{"abstract_excerpt":"As it has become common to use many computer cores in routine applications, finding good ways to parallelize popular algorithms has become increasingly important. In this paper, we present a parallelization scheme for Markov chain Monte Carlo (MCMC) methods based on spectral clustering of the underlying state space, generalizing earlier work on parallelization of MCMC methods by state space partitioning. We show empirically that this approach speeds up MCMC sampling for multimodal distributions and that it can be usefully applied in greater generality than several related algorithms. Our algor","authors_text":"Aaron Smith, Guillaume W. Basse, Natesh S. Pillai","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-31T00:40:09Z","title":"Parallel Markov Chain Monte Carlo via Spectral Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09454","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:6971d6abb678e67bbdfc66d1f8b5739ceb646efffdbc9883b5624cf78c180f00","target":"record","created_at":"2026-05-18T01:13: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":"5c630118bec0e34601709469c21c5f8a008912a2ce1010434678ef60ca190f3b","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-31T00:40:09Z","title_canon_sha256":"0c5c736fab88b2bb5a6d82156544b5a2e6feb0f1884b10a81e4759408e25ec3f"},"schema_version":"1.0","source":{"id":"1605.09454","kind":"arxiv","version":1}},"canonical_sha256":"be588b2d25616819a80e7986dc0216db4b5c90cea0575c86b74f5ed105964c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be588b2d25616819a80e7986dc0216db4b5c90cea0575c86b74f5ed105964c95","first_computed_at":"2026-05-18T01:13:17.265179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:17.265179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8faZEitbcmDbpQLCAxXhAUAWZZIoHIxFw8aMcUVAfi5AVBcla/PD+HRjsR/OLD8CzBoT9RFppRX/VO/qSzuKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:17.265719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6971d6abb678e67bbdfc66d1f8b5739ceb646efffdbc9883b5624cf78c180f00","sha256:6b3a284a4e8d326d4091e33a1ca3cb58f61d5d73f99ae97c1862ab9386fcf919"],"state_sha256":"e37c7c30d38a85f4cd10f5b7fe44404b061e491b2880499c5877b8842ea7ef06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBZxSgjcbzF1sBqQrjzG00BrGB/UUZP18dIwJKmn4QohT0nj5xz1uujS95w/apNmM1ORGRHh9VtRkIzuaZIAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:17:43.503487Z","bundle_sha256":"618c4b9b27f71bbd074b09b4d4be815ebd91aa2d308964132a36471838cf5324"}}