{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZBMZBFXZOZRQWAVR4G3EHHGKUG","short_pith_number":"pith:ZBMZBFXZ","schema_version":"1.0","canonical_sha256":"c8599096f976630b02b1e1b6439ccaa197ea9243edc9c639ed0468594b772a88","source":{"kind":"arxiv","id":"1602.02889","version":1},"attestation_state":"computed","paper":{"title":"Ergodicity of Markov chain Monte Carlo with reversible proposal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Kengo Kamatani","submitted_at":"2016-02-09T08:20:23Z","abstract_excerpt":"We describe ergodic properties of some Metropolis-Hastings (MH) algorithms for heavy-tailed target distributions. The analysis usually falls into sub-geometric ergodicity framework but we prove that the mixed preconditioned Crank-Nicolson (MpCN) algorithm has geometric ergodicity even for heavy-tailed target distributions. This useful property comes from the fact that the MpCN algorithm becomes a random-walk Metropolis algorithm under suitable transformation."},"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":"1602.02889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-02-09T08:20:23Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"4b4b6105ef45ba4ab840f85e4f8c5dfb6311a751fa1f22869ddd82641bcaafe6","abstract_canon_sha256":"b3dbd7bb7b786c23b780943651393848ccd8bc930f01462900a8512dbf4d4c0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:06.180388Z","signature_b64":"NWvwQjPhMYI/AZy0GA2HiDHJ/ILyS3BTkCSX5iKdmPwsWo9lQySE3BM6cSAaQX4Zh3SeiAqm7PEho3YdlLlSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8599096f976630b02b1e1b6439ccaa197ea9243edc9c639ed0468594b772a88","last_reissued_at":"2026-05-18T01:21:06.179705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:06.179705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ergodicity of Markov chain Monte Carlo with reversible proposal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Kengo Kamatani","submitted_at":"2016-02-09T08:20:23Z","abstract_excerpt":"We describe ergodic properties of some Metropolis-Hastings (MH) algorithms for heavy-tailed target distributions. The analysis usually falls into sub-geometric ergodicity framework but we prove that the mixed preconditioned Crank-Nicolson (MpCN) algorithm has geometric ergodicity even for heavy-tailed target distributions. This useful property comes from the fact that the MpCN algorithm becomes a random-walk Metropolis algorithm under suitable transformation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02889","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02889","created_at":"2026-05-18T01:21:06.179796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02889v1","created_at":"2026-05-18T01:21:06.179796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02889","created_at":"2026-05-18T01:21:06.179796+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBMZBFXZOZRQ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBMZBFXZOZRQWAVR","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBMZBFXZ","created_at":"2026-05-18T12:30:53.716459+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/ZBMZBFXZOZRQWAVR4G3EHHGKUG","json":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG.json","graph_json":"https://pith.science/api/pith-number/ZBMZBFXZOZRQWAVR4G3EHHGKUG/graph.json","events_json":"https://pith.science/api/pith-number/ZBMZBFXZOZRQWAVR4G3EHHGKUG/events.json","paper":"https://pith.science/paper/ZBMZBFXZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG","download_json":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG.json","view_paper":"https://pith.science/paper/ZBMZBFXZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02889&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBMZBFXZOZRQWAVR4G3EHHGKUG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBMZBFXZOZRQWAVR4G3EHHGKUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG/action/storage_attestation","attest_author":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG/action/author_attestation","sign_citation":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG/action/citation_signature","submit_replication":"https://pith.science/pith/ZBMZBFXZOZRQWAVR4G3EHHGKUG/action/replication_record"}},"created_at":"2026-05-18T01:21:06.179796+00:00","updated_at":"2026-05-18T01:21:06.179796+00:00"}