{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KFCXRXEACDPQK7EPQ3EQPVKI7H","short_pith_number":"pith:KFCXRXEA","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"},"canonical_sha256":"514578dc8010df057c8f86c907d548f9e987e107cded7ce86c541fa740fcf01f","source":{"kind":"arxiv","id":"1412.6231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6231","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6231v1","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6231","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"KFCXRXEACDPQ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KFCXRXEACDPQK7EP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KFCXRXEA","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KFCXRXEACDPQK7EPQ3EQPVKI7H","target":"record","payload":{"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"},"canonical_sha256":"514578dc8010df057c8f86c907d548f9e987e107cded7ce86c541fa740fcf01f","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"},"source_kind":"arxiv","source_id":"1412.6231","source_version":1,"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-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ds3NB5I77mC+chmKOseGU7JWX4AUS+aFmutbB83Lr5+U40zsVydEF6IO4xQ5MVxTh8weFdK8Bn7N7bbRDworDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:52:39.078987Z"},"content_sha256":"08740351fa42a58f8db01d0507ef2329d74864e706687a95fc689935513e23cb","schema_version":"1.0","event_id":"sha256:08740351fa42a58f8db01d0507ef2329d74864e706687a95fc689935513e23cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KFCXRXEACDPQK7EPQ3EQPVKI7H","target":"graph","payload":{"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"},"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-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yseC9RWJNC0Z07O88GygG5mw+6hTcgu5G7h4cmr7V78oa94xdvXSguDLQ+V1mC+kbuOORL7mf6sHyr//hN+5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:52:39.079353Z"},"content_sha256":"e06397d1be6d2eb36e78f7eeec2b7b7c112cd359d657296eadcafe29892511af","schema_version":"1.0","event_id":"sha256:e06397d1be6d2eb36e78f7eeec2b7b7c112cd359d657296eadcafe29892511af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/bundle.json","state_url":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/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-05-28T00:52:39Z","links":{"resolver":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H","bundle":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/bundle.json","state":"https://pith.science/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFCXRXEACDPQK7EPQ3EQPVKI7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KFCXRXEACDPQK7EPQ3EQPVKI7H","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":"f33d523182e71afb70b54214e08edce9fb7cc829d8c8890f987c035d01d8d6d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-12-19T06:55:24Z","title_canon_sha256":"aca5cfb5819af188cee6b959141920b816a1a7b85a68457aea60e9d6c94c8413"},"schema_version":"1.0","source":{"id":"1412.6231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6231","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6231v1","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6231","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"KFCXRXEACDPQ","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KFCXRXEACDPQK7EP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KFCXRXEA","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:e06397d1be6d2eb36e78f7eeec2b7b7c112cd359d657296eadcafe29892511af","target":"graph","created_at":"2026-05-18T02:30:54Z","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":"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","authors_text":"Kengo Kamatani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-12-19T06:55:24Z","title":"Efficient strategy for the Markov chain Monte Carlo in high-dimension with heavy-tailed target probability distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6231","kind":"arxiv","version":1},"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:08740351fa42a58f8db01d0507ef2329d74864e706687a95fc689935513e23cb","target":"record","created_at":"2026-05-18T02:30:54Z","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":"f33d523182e71afb70b54214e08edce9fb7cc829d8c8890f987c035d01d8d6d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-12-19T06:55:24Z","title_canon_sha256":"aca5cfb5819af188cee6b959141920b816a1a7b85a68457aea60e9d6c94c8413"},"schema_version":"1.0","source":{"id":"1412.6231","kind":"arxiv","version":1}},"canonical_sha256":"514578dc8010df057c8f86c907d548f9e987e107cded7ce86c541fa740fcf01f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"514578dc8010df057c8f86c907d548f9e987e107cded7ce86c541fa740fcf01f","first_computed_at":"2026-05-18T02:30:54.051593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:54.051593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y1SKtwzGGqoHkiFq4I+MIoOlPcq3bq2JKsqED496m/xjnsxurw3arPIlTZcEz51vNT7gUibRgYbp6WzCEPjYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:54.052072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08740351fa42a58f8db01d0507ef2329d74864e706687a95fc689935513e23cb","sha256:e06397d1be6d2eb36e78f7eeec2b7b7c112cd359d657296eadcafe29892511af"],"state_sha256":"e95b3f822388cda29e64fb8f3cfc9853613f5cc7ffc48a3565bc37ebd75cbbbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ugnb3NABRlY0OnD0EZNDNBmCai9AyPL62iLZTNxm89bKlqflpNsv3icNj9aJglG4RwLlndzXmnz6RakB5ccDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:52:39.081369Z","bundle_sha256":"cde30933925afa04dc8a3d78fbfc856118c3a3754eeb1470b6e5d539924d7c9e"}}