{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SDPMDT5CSEUS7D3ZXZBND3UBW4","short_pith_number":"pith:SDPMDT5C","canonical_record":{"source":{"id":"1507.08577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T16:47:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e435545c9dd78f3c88a529bdd26aa02d3d4453c1e8db9ccb5fd0aa1cc030d5fe","abstract_canon_sha256":"c28f2943b10462ef0e9e24186a5ac5c63f921f504b5cfd095cf11e5944c45912"},"schema_version":"1.0"},"canonical_sha256":"90dec1cfa291292f8f79be42d1ee81b738a5380a218f403aaa52e24764116930","source":{"kind":"arxiv","id":"1507.08577","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08577","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08577v2","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08577","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"SDPMDT5CSEUS","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SDPMDT5CSEUS7D3Z","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SDPMDT5C","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SDPMDT5CSEUS7D3ZXZBND3UBW4","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T16:47:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e435545c9dd78f3c88a529bdd26aa02d3d4453c1e8db9ccb5fd0aa1cc030d5fe","abstract_canon_sha256":"c28f2943b10462ef0e9e24186a5ac5c63f921f504b5cfd095cf11e5944c45912"},"schema_version":"1.0"},"canonical_sha256":"90dec1cfa291292f8f79be42d1ee81b738a5380a218f403aaa52e24764116930","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:00.145125Z","signature_b64":"qbib6J8Aba7VIEQBeDX+8jNuuFq8LCM/OFCfegZjgaweT0t6gBnoQpLzxtdMqa9/ZINd48kjF50gwb735vr2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90dec1cfa291292f8f79be42d1ee81b738a5380a218f403aaa52e24764116930","last_reissued_at":"2026-05-18T01:04:00.144450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:00.144450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08577","source_version":2,"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:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfExUlDh/V7Um2ro64tNHMqTnKrNFm3sCa4wpfmjOKJrlVBCk1r6OhdWkRPr/VniOUXqSBFAI+vw2hesoyiVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:31:49.658741Z"},"content_sha256":"f872e6038056eccf6198d97d7ea183cf5a1172c479d20cd8d2c1d7493dad7222","schema_version":"1.0","event_id":"sha256:f872e6038056eccf6198d97d7ea183cf5a1172c479d20cd8d2c1d7493dad7222"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SDPMDT5CSEUS7D3ZXZBND3UBW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Orthogonal parallel MCMC methods for sampling and optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"D. Luengo, F. Louzada, J. Corander, L. Martino, V. Elvira","submitted_at":"2015-07-30T16:47:33Z","abstract_excerpt":"Monte Carlo (MC) methods are widely used for Bayesian inference and optimization in statistics, signal processing and machine learning. A well-known class of MC methods are Markov Chain Monte Carlo (MCMC) algorithms. In order to foster better exploration of the state space, specially in high-dimensional applications, several schemes employing multiple parallel MCMC chains have been recently introduced. In this work, we describe a novel parallel interacting MCMC scheme, called {\\it orthogonal MCMC} (O-MCMC), where a set of \"vertical\" parallel MCMC chains share information using some \"horizontal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08577","kind":"arxiv","version":2},"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:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdqS30aHg14OSykmlA4XVZvTPueu7RPYHyh7l3HNat9RU+p3W/4g2AyVqKdUbZSGzDvIlW0eJ3b3C7DHni0lCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:31:49.659080Z"},"content_sha256":"f4b80d47c5d9a94a0a5b20702329c18753724bf2d83ca1925b8b2f945a68d91a","schema_version":"1.0","event_id":"sha256:f4b80d47c5d9a94a0a5b20702329c18753724bf2d83ca1925b8b2f945a68d91a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/bundle.json","state_url":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/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-27T10:31:49Z","links":{"resolver":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4","bundle":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/bundle.json","state":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SDPMDT5CSEUS7D3ZXZBND3UBW4","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":"c28f2943b10462ef0e9e24186a5ac5c63f921f504b5cfd095cf11e5944c45912","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T16:47:33Z","title_canon_sha256":"e435545c9dd78f3c88a529bdd26aa02d3d4453c1e8db9ccb5fd0aa1cc030d5fe"},"schema_version":"1.0","source":{"id":"1507.08577","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08577","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08577v2","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08577","created_at":"2026-05-18T01:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"SDPMDT5CSEUS","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SDPMDT5CSEUS7D3Z","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SDPMDT5C","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f4b80d47c5d9a94a0a5b20702329c18753724bf2d83ca1925b8b2f945a68d91a","target":"graph","created_at":"2026-05-18T01:04:00Z","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":"Monte Carlo (MC) methods are widely used for Bayesian inference and optimization in statistics, signal processing and machine learning. A well-known class of MC methods are Markov Chain Monte Carlo (MCMC) algorithms. In order to foster better exploration of the state space, specially in high-dimensional applications, several schemes employing multiple parallel MCMC chains have been recently introduced. In this work, we describe a novel parallel interacting MCMC scheme, called {\\it orthogonal MCMC} (O-MCMC), where a set of \"vertical\" parallel MCMC chains share information using some \"horizontal","authors_text":"D. Luengo, F. Louzada, J. Corander, L. Martino, V. Elvira","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T16:47:33Z","title":"Orthogonal parallel MCMC methods for sampling and optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08577","kind":"arxiv","version":2},"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:f872e6038056eccf6198d97d7ea183cf5a1172c479d20cd8d2c1d7493dad7222","target":"record","created_at":"2026-05-18T01:04:00Z","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":"c28f2943b10462ef0e9e24186a5ac5c63f921f504b5cfd095cf11e5944c45912","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-30T16:47:33Z","title_canon_sha256":"e435545c9dd78f3c88a529bdd26aa02d3d4453c1e8db9ccb5fd0aa1cc030d5fe"},"schema_version":"1.0","source":{"id":"1507.08577","kind":"arxiv","version":2}},"canonical_sha256":"90dec1cfa291292f8f79be42d1ee81b738a5380a218f403aaa52e24764116930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90dec1cfa291292f8f79be42d1ee81b738a5380a218f403aaa52e24764116930","first_computed_at":"2026-05-18T01:04:00.144450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:00.144450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qbib6J8Aba7VIEQBeDX+8jNuuFq8LCM/OFCfegZjgaweT0t6gBnoQpLzxtdMqa9/ZINd48kjF50gwb735vr2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:00.145125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08577","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f872e6038056eccf6198d97d7ea183cf5a1172c479d20cd8d2c1d7493dad7222","sha256:f4b80d47c5d9a94a0a5b20702329c18753724bf2d83ca1925b8b2f945a68d91a"],"state_sha256":"94349bfab22115e4d40c5f9af00bfec3c3d1d3f4906660986a533bdc28a4b9a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4silYyYNq39v3SBV5yklR/D8DduFEObFv/BwRPDZir74FffOffEcNd2PCRQnVgMy1JKW8rgOu4FtMOPHnAXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:31:49.660950Z","bundle_sha256":"97f1e11990a8e0ac783ad18148e4ed029f7b739dac531d6bdb131d1060c93a5c"}}