{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:46FUMFKIJE6POW3OMII23E6BIK","short_pith_number":"pith:46FUMFKI","canonical_record":{"source":{"id":"1806.03816","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-11T05:35:45Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"fc9ff56f338dc36ad7515c8b5d31a47be296b2c0dbe22af92c0c2e14a509ff99","abstract_canon_sha256":"8b33198048690effa49de335e6b3c597049fd0524a45385bab67eb259774e324"},"schema_version":"1.0"},"canonical_sha256":"e78b461548493cf75b6e6211ad93c142813e5584b46bce2ba06c2cd2032e0195","source":{"kind":"arxiv","id":"1806.03816","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03816","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03816v6","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03816","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"46FUMFKIJE6P","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"46FUMFKIJE6POW3O","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"46FUMFKI","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:46FUMFKIJE6POW3OMII23E6BIK","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03816","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-11T05:35:45Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"fc9ff56f338dc36ad7515c8b5d31a47be296b2c0dbe22af92c0c2e14a509ff99","abstract_canon_sha256":"8b33198048690effa49de335e6b3c597049fd0524a45385bab67eb259774e324"},"schema_version":"1.0"},"canonical_sha256":"e78b461548493cf75b6e6211ad93c142813e5584b46bce2ba06c2cd2032e0195","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:43.748719Z","signature_b64":"yQXbi18tQjGr1akglunk4BA625exxpmNVg3eerDe7WkxhhVVyF6gp5gvXgJhfRC2LwL9Od1bHy0hQFHgNmOdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e78b461548493cf75b6e6211ad93c142813e5584b46bce2ba06c2cd2032e0195","last_reissued_at":"2026-05-17T23:40:43.748208Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:43.748208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03816","source_version":6,"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-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"159Cb2xp6vhXLdizRjWBwYV2ScPNJRBaToZRkRmLuDGcvzpr+56/5xpmWjecgjC4B9Qaul0p5qQxqkVJylwiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:48:42.009386Z"},"content_sha256":"740341c697a08f9de1ce4612c20050efb83863c962fd9a9486887b62b28b99e5","schema_version":"1.0","event_id":"sha256:740341c697a08f9de1ce4612c20050efb83863c962fd9a9486887b62b28b99e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:46FUMFKIJE6POW3OMII23E6BIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive MCMC via Combining Local Samplers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Kiarash Shaloudegi","submitted_at":"2018-06-11T05:35:45Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) methods are widely used in machine learning. One of the major problems with MCMC is the question of how to design chains that mix fast over the whole state space; in particular, how to select the parameters of an MCMC algorithm. Here we take a different approach and, similarly to parallel MCMC methods, instead of trying to find a single chain that samples from the whole distribution, we combine samples from several chains run in parallel, each exploring only parts of the state space (e.g., a few modes only). The chains are prioritized based on kernel Stein discr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03816","kind":"arxiv","version":6},"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-17T23:40:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/IpkkPsncAVsfz+ZcprQqOGLQqaWRDE0GRyUboXBDhuKEHiwBeqX2syDp7/yJuiuzi0+iQ2sNI34r8xSg+AAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:48:42.009917Z"},"content_sha256":"965aee0ac615460635545b6345db3bd0e1b19058fa62fc40e0d6bc520437026b","schema_version":"1.0","event_id":"sha256:965aee0ac615460635545b6345db3bd0e1b19058fa62fc40e0d6bc520437026b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46FUMFKIJE6POW3OMII23E6BIK/bundle.json","state_url":"https://pith.science/pith/46FUMFKIJE6POW3OMII23E6BIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46FUMFKIJE6POW3OMII23E6BIK/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-11T08:48:42Z","links":{"resolver":"https://pith.science/pith/46FUMFKIJE6POW3OMII23E6BIK","bundle":"https://pith.science/pith/46FUMFKIJE6POW3OMII23E6BIK/bundle.json","state":"https://pith.science/pith/46FUMFKIJE6POW3OMII23E6BIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46FUMFKIJE6POW3OMII23E6BIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:46FUMFKIJE6POW3OMII23E6BIK","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":"8b33198048690effa49de335e6b3c597049fd0524a45385bab67eb259774e324","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-11T05:35:45Z","title_canon_sha256":"fc9ff56f338dc36ad7515c8b5d31a47be296b2c0dbe22af92c0c2e14a509ff99"},"schema_version":"1.0","source":{"id":"1806.03816","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03816","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03816v6","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03816","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"46FUMFKIJE6P","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"46FUMFKIJE6POW3O","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"46FUMFKI","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:965aee0ac615460635545b6345db3bd0e1b19058fa62fc40e0d6bc520437026b","target":"graph","created_at":"2026-05-17T23:40:43Z","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 (MCMC) methods are widely used in machine learning. One of the major problems with MCMC is the question of how to design chains that mix fast over the whole state space; in particular, how to select the parameters of an MCMC algorithm. Here we take a different approach and, similarly to parallel MCMC methods, instead of trying to find a single chain that samples from the whole distribution, we combine samples from several chains run in parallel, each exploring only parts of the state space (e.g., a few modes only). The chains are prioritized based on kernel Stein discr","authors_text":"Andr\\'as Gy\\\"orgy, Kiarash Shaloudegi","cross_cats":["cs.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-11T05:35:45Z","title":"Adaptive MCMC via Combining Local Samplers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03816","kind":"arxiv","version":6},"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:740341c697a08f9de1ce4612c20050efb83863c962fd9a9486887b62b28b99e5","target":"record","created_at":"2026-05-17T23:40:43Z","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":"8b33198048690effa49de335e6b3c597049fd0524a45385bab67eb259774e324","cross_cats_sorted":["cs.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-11T05:35:45Z","title_canon_sha256":"fc9ff56f338dc36ad7515c8b5d31a47be296b2c0dbe22af92c0c2e14a509ff99"},"schema_version":"1.0","source":{"id":"1806.03816","kind":"arxiv","version":6}},"canonical_sha256":"e78b461548493cf75b6e6211ad93c142813e5584b46bce2ba06c2cd2032e0195","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e78b461548493cf75b6e6211ad93c142813e5584b46bce2ba06c2cd2032e0195","first_computed_at":"2026-05-17T23:40:43.748208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:43.748208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yQXbi18tQjGr1akglunk4BA625exxpmNVg3eerDe7WkxhhVVyF6gp5gvXgJhfRC2LwL9Od1bHy0hQFHgNmOdDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:43.748719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03816","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:740341c697a08f9de1ce4612c20050efb83863c962fd9a9486887b62b28b99e5","sha256:965aee0ac615460635545b6345db3bd0e1b19058fa62fc40e0d6bc520437026b"],"state_sha256":"6ea76ee0e465243e83130521ca7add361fd0bddd0295aa4661910c82391f99b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVJ3GHXrUxikAmkKmvf1gQKeoAuRN50GKGfiWxzU+U8bV0hExruvfe6m6y6QKn6QSlqBnjiXMfENlUB1TdEoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:48:42.014277Z","bundle_sha256":"82eeda79e33264a429cc7442172a9a0418c344faca6cc7f9d45ade1545933231"}}