{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ULWQHBAW2E7QVDNTKKIJEYLXL4","short_pith_number":"pith:ULWQHBAW","canonical_record":{"source":{"id":"1211.2207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-09T18:41:35Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"aa86fe983a1a402b6296bd286e98907a0331b7c2e05ef1be3ddc35f90103c218","abstract_canon_sha256":"2e18d2bb4138e6885a3710972f1e1e665b367340b94024b79d660ddbfd7f536f"},"schema_version":"1.0"},"canonical_sha256":"a2ed038416d13f0a8db352909261775f23805970513cb87b9655a4a42c5e7ffb","source":{"kind":"arxiv","id":"1211.2207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2207","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2207v1","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2207","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"ULWQHBAW2E7Q","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"ULWQHBAW2E7QVDNT","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"ULWQHBAW","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ULWQHBAW2E7QVDNTKKIJEYLXL4","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-09T18:41:35Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"aa86fe983a1a402b6296bd286e98907a0331b7c2e05ef1be3ddc35f90103c218","abstract_canon_sha256":"2e18d2bb4138e6885a3710972f1e1e665b367340b94024b79d660ddbfd7f536f"},"schema_version":"1.0"},"canonical_sha256":"a2ed038416d13f0a8db352909261775f23805970513cb87b9655a4a42c5e7ffb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:11.454417Z","signature_b64":"rabWpleJ/SqfzsL2OQRrv4afFYV+lE3iEtRVDOJ3F7KZTgNPNxvQDUT4CTSj4Y8koUfy0SRt+FjVxWdOyAwLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2ed038416d13f0a8db352909261775f23805970513cb87b9655a4a42c5e7ffb","last_reissued_at":"2026-05-18T03:41:11.453990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:11.453990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2207","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-18T03:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lP1YZQOc0BEoZlVckjuoecXh4CvJb9qWGg9B9TT1Huo4um4lMnr+wWbsApql8BzSmrt6ZS5PQXun5dC+qsMkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:43:45.156561Z"},"content_sha256":"aeabd41e1bfacf8fbe358bd964a610e0ced85c1b306d3d5ffd543c4f5ed44bbf","schema_version":"1.0","event_id":"sha256:aeabd41e1bfacf8fbe358bd964a610e0ced85c1b306d3d5ffd543c4f5ed44bbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ULWQHBAW2E7QVDNTKKIJEYLXL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov chain Monte Carlo for computing rare-event probabilities for a heavy-tailed random walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.PR","authors_text":"Henrik Hult, Thorbj\\\"orn Gudmundsson","submitted_at":"2012-11-09T18:41:35Z","abstract_excerpt":"In this paper a method based on a Markov chain Monte Carlo (MCMC) algorithm is proposed to compute the probability of a rare event. The conditional distribution of the underlying process given that the rare event occurs has the probability of the rare event as its normalizing constant. Using the MCMC methodology a Markov chain is simulated, with that conditional distribution as its invariant distribution, and information about the normalizing constant is extracted from its trajectory. The algorithm is described in full generality and applied to the problem of computing the probability that a h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2207","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-18T03:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFJGPP0LgD4jITypqXNWBMk3VkZ9/p/y2KhwlXggDeElejc/TWz6AI0NKII6MEhJ85id0VpiXue40ThPGwLvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:43:45.156904Z"},"content_sha256":"b299b02946ada2d49b5c39146ed2d73fc5968899ef64ea7e79c2c4fd6811189f","schema_version":"1.0","event_id":"sha256:b299b02946ada2d49b5c39146ed2d73fc5968899ef64ea7e79c2c4fd6811189f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULWQHBAW2E7QVDNTKKIJEYLXL4/bundle.json","state_url":"https://pith.science/pith/ULWQHBAW2E7QVDNTKKIJEYLXL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULWQHBAW2E7QVDNTKKIJEYLXL4/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-03T03:43:45Z","links":{"resolver":"https://pith.science/pith/ULWQHBAW2E7QVDNTKKIJEYLXL4","bundle":"https://pith.science/pith/ULWQHBAW2E7QVDNTKKIJEYLXL4/bundle.json","state":"https://pith.science/pith/ULWQHBAW2E7QVDNTKKIJEYLXL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULWQHBAW2E7QVDNTKKIJEYLXL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ULWQHBAW2E7QVDNTKKIJEYLXL4","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":"2e18d2bb4138e6885a3710972f1e1e665b367340b94024b79d660ddbfd7f536f","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-09T18:41:35Z","title_canon_sha256":"aa86fe983a1a402b6296bd286e98907a0331b7c2e05ef1be3ddc35f90103c218"},"schema_version":"1.0","source":{"id":"1211.2207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2207","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2207v1","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2207","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"ULWQHBAW2E7Q","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"ULWQHBAW2E7QVDNT","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"ULWQHBAW","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:b299b02946ada2d49b5c39146ed2d73fc5968899ef64ea7e79c2c4fd6811189f","target":"graph","created_at":"2026-05-18T03:41:11Z","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":"In this paper a method based on a Markov chain Monte Carlo (MCMC) algorithm is proposed to compute the probability of a rare event. The conditional distribution of the underlying process given that the rare event occurs has the probability of the rare event as its normalizing constant. Using the MCMC methodology a Markov chain is simulated, with that conditional distribution as its invariant distribution, and information about the normalizing constant is extracted from its trajectory. The algorithm is described in full generality and applied to the problem of computing the probability that a h","authors_text":"Henrik Hult, Thorbj\\\"orn Gudmundsson","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-09T18:41:35Z","title":"Markov chain Monte Carlo for computing rare-event probabilities for a heavy-tailed random walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2207","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:aeabd41e1bfacf8fbe358bd964a610e0ced85c1b306d3d5ffd543c4f5ed44bbf","target":"record","created_at":"2026-05-18T03:41:11Z","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":"2e18d2bb4138e6885a3710972f1e1e665b367340b94024b79d660ddbfd7f536f","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-11-09T18:41:35Z","title_canon_sha256":"aa86fe983a1a402b6296bd286e98907a0331b7c2e05ef1be3ddc35f90103c218"},"schema_version":"1.0","source":{"id":"1211.2207","kind":"arxiv","version":1}},"canonical_sha256":"a2ed038416d13f0a8db352909261775f23805970513cb87b9655a4a42c5e7ffb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2ed038416d13f0a8db352909261775f23805970513cb87b9655a4a42c5e7ffb","first_computed_at":"2026-05-18T03:41:11.453990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:11.453990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rabWpleJ/SqfzsL2OQRrv4afFYV+lE3iEtRVDOJ3F7KZTgNPNxvQDUT4CTSj4Y8koUfy0SRt+FjVxWdOyAwLBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:11.454417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aeabd41e1bfacf8fbe358bd964a610e0ced85c1b306d3d5ffd543c4f5ed44bbf","sha256:b299b02946ada2d49b5c39146ed2d73fc5968899ef64ea7e79c2c4fd6811189f"],"state_sha256":"cdedb5814a8da9e71c3cb7a42372887f183b8d159e1132a95e6f9dba11e01173"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zQyVCqRw9VbKdc90kp/InaEoqMQiHKTHxFVVcdSAmGpDKIY0uDaPUtcYmQa6oEp2BVIWjg3OX/+8exS0zihyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:43:45.158873Z","bundle_sha256":"677bb05b8e49cb79835ed8b048cc3455392bcb835a5c1d5449be0882a281fc38"}}