{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KFCXRXEACDPQK7EPQ3EQPVKI7H","short_pith_number":"pith:KFCXRXEA","schema_version":"1.0","canonical_sha256":"514578dc8010df057c8f86c907d548f9e987e107cded7ce86c541fa740fcf01f","source":{"kind":"arxiv","id":"1412.6231","version":1},"attestation_state":"computed","paper":{"title":"Efficient strategy for the Markov chain Monte Carlo in high-dimension with heavy-tailed target probability distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Kengo Kamatani","submitted_at":"2014-12-19T06:55:24Z","abstract_excerpt":"The purpose of this paper is to introduce a new Markov chain Monte Carlo method and exhibit its efficiency by simulation and high-dimensional asymptotic theory. Key fact is that our algorithm has a reversible proposal transition kernel, which is designed to have a heavy-tailed invariant probability distribution. The high-dimensional asymptotic theory is studied for a class of heavy-tailed target probability distribution. As the number of dimension of the state space goes to infinity, we will show that our algorithm has a much better convergence rate than that of the preconditioned Crank Nicols"},"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":"1412.6231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-12-19T06:55:24Z","cross_cats_sorted":[],"title_canon_sha256":"aca5cfb5819af188cee6b959141920b816a1a7b85a68457aea60e9d6c94c8413","abstract_canon_sha256":"f33d523182e71afb70b54214e08edce9fb7cc829d8c8890f987c035d01d8d6d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:54.052072Z","signature_b64":"Y1SKtwzGGqoHkiFq4I+MIoOlPcq3bq2JKsqED496m/xjnsxurw3arPIlTZcEz51vNT7gUibRgYbp6WzCEPjYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"514578dc8010df057c8f86c907d548f9e987e107cded7ce86c541fa740fcf01f","last_reissued_at":"2026-05-18T02:30:54.051593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:54.051593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient strategy for the Markov chain Monte Carlo in high-dimension with heavy-tailed target probability distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Kengo Kamatani","submitted_at":"2014-12-19T06:55:24Z","abstract_excerpt":"The purpose of this paper is to introduce a new Markov chain Monte Carlo method and exhibit its efficiency by simulation and high-dimensional asymptotic theory. Key fact is that our algorithm has a reversible proposal transition kernel, which is designed to have a heavy-tailed invariant probability distribution. The high-dimensional asymptotic theory is studied for a class of heavy-tailed target probability distribution. As the number of dimension of the state space goes to infinity, we will show that our algorithm has a much better convergence rate than that of the preconditioned Crank Nicols"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6231","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":"1412.6231","created_at":"2026-05-18T02:30:54.051659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6231v1","created_at":"2026-05-18T02:30:54.051659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6231","created_at":"2026-05-18T02:30:54.051659+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFCXRXEACDPQ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFCXRXEACDPQK7EP","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFCXRXEA","created_at":"2026-05-18T12:28:35.611951+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/KFCXRXEACDPQK7EPQ3EQPVKI7H","json":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H.json","graph_json":"https://pith.science/api/pith-number/KFCXRXEACDPQK7EPQ3EQPVKI7H/graph.json","events_json":"https://pith.science/api/pith-number/KFCXRXEACDPQK7EPQ3EQPVKI7H/events.json","paper":"https://pith.science/paper/KFCXRXEA"},"agent_actions":{"view_html":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H","download_json":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H.json","view_paper":"https://pith.science/paper/KFCXRXEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6231&json=true","fetch_graph":"https://pith.science/api/pith-number/KFCXRXEACDPQK7EPQ3EQPVKI7H/graph.json","fetch_events":"https://pith.science/api/pith-number/KFCXRXEACDPQK7EPQ3EQPVKI7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/action/storage_attestation","attest_author":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/action/author_attestation","sign_citation":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/action/citation_signature","submit_replication":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/action/replication_record"}},"created_at":"2026-05-18T02:30:54.051659+00:00","updated_at":"2026-05-18T02:30:54.051659+00:00"}