{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SDPMDT5CSEUS7D3ZXZBND3UBW4","short_pith_number":"pith:SDPMDT5C","schema_version":"1.0","canonical_sha256":"90dec1cfa291292f8f79be42d1ee81b738a5380a218f403aaa52e24764116930","source":{"kind":"arxiv","id":"1507.08577","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.08577","created_at":"2026-05-18T01:04:00.144562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08577v2","created_at":"2026-05-18T01:04:00.144562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08577","created_at":"2026-05-18T01:04:00.144562+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDPMDT5CSEUS","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDPMDT5CSEUS7D3Z","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDPMDT5C","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4","json":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4.json","graph_json":"https://pith.science/api/pith-number/SDPMDT5CSEUS7D3ZXZBND3UBW4/graph.json","events_json":"https://pith.science/api/pith-number/SDPMDT5CSEUS7D3ZXZBND3UBW4/events.json","paper":"https://pith.science/paper/SDPMDT5C"},"agent_actions":{"view_html":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4","download_json":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4.json","view_paper":"https://pith.science/paper/SDPMDT5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08577&json=true","fetch_graph":"https://pith.science/api/pith-number/SDPMDT5CSEUS7D3ZXZBND3UBW4/graph.json","fetch_events":"https://pith.science/api/pith-number/SDPMDT5CSEUS7D3ZXZBND3UBW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/action/storage_attestation","attest_author":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/action/author_attestation","sign_citation":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/action/citation_signature","submit_replication":"https://pith.science/pith/SDPMDT5CSEUS7D3ZXZBND3UBW4/action/replication_record"}},"created_at":"2026-05-18T01:04:00.144562+00:00","updated_at":"2026-05-18T01:04:00.144562+00:00"}