{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PY6F3OART5DB7PJ7VIUBYDFVXS","short_pith_number":"pith:PY6F3OAR","canonical_record":{"source":{"id":"1402.0934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-05T05:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"23478440e945ede00154d7b93ae7881657781f9c306f59206393612ca159fe1d","abstract_canon_sha256":"31b8264fe06b0f9be70c46e8c4cb4735a15dc1591bddf1953cea9e26f3eb96a3"},"schema_version":"1.0"},"canonical_sha256":"7e3c5db8119f461fbd3faa281c0cb5bcba315f19af6784e39870ec9312771e4f","source":{"kind":"arxiv","id":"1402.0934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0934","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0934v1","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0934","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"PY6F3OART5DB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PY6F3OART5DB7PJ7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PY6F3OAR","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PY6F3OART5DB7PJ7VIUBYDFVXS","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-05T05:09:38Z","cross_cats_sorted":[],"title_canon_sha256":"23478440e945ede00154d7b93ae7881657781f9c306f59206393612ca159fe1d","abstract_canon_sha256":"31b8264fe06b0f9be70c46e8c4cb4735a15dc1591bddf1953cea9e26f3eb96a3"},"schema_version":"1.0"},"canonical_sha256":"7e3c5db8119f461fbd3faa281c0cb5bcba315f19af6784e39870ec9312771e4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:02.245189Z","signature_b64":"EDEjBdMkehZMEr5uo8R12mj2SlpjQIYuNTTUB3ll7Rit9GGB9VSjjdKuIzcI3zckeXqz60BOfDCVF/mdSGw3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e3c5db8119f461fbd3faa281c0cb5bcba315f19af6784e39870ec9312771e4f","last_reissued_at":"2026-05-18T03:00:02.244478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:02.244478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0934","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:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7dQE0I0iBizJviQEAETtsiD91F/aXHkkvsmo5Kfbb5M0GZkAHWJIJ0WOFuXyXO5K9y4NVYHpwNnXMZtM93sAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:58:15.392800Z"},"content_sha256":"a45ebfef237c50a7154765efda8c4139d6f79ed11bb989ba821ee485a7805973","schema_version":"1.0","event_id":"sha256:a45ebfef237c50a7154765efda8c4139d6f79ed11bb989ba821ee485a7805973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PY6F3OART5DB7PJ7VIUBYDFVXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fragility Distributions and their approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A. Xia, H.L. Gan","submitted_at":"2014-02-05T05:09:38Z","abstract_excerpt":"Given a sequence of $n$ identically distributed random variables with common distribution $F$, the \\emph{fragility distribution of order $m$}, represented by $\\FD$, is the limit conditional distribution of the number of exceedances given there are at least $m$ exceedances, as the threshold tends to the right end point of $F$. In this paper we are concerned with the existence of $\\FD$ and its asymptotic behaviour when $n$ becomes large. For a stationary sequence with its exceedance process converging to a compound Poisson process, we derive an explicit formula for calculating $\\lim_{n \\to \\inft"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0934","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:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJuPTYkjmpPk7w/ko0hrp04TZw/yEUslhmB0F567syr0OSp0PSjFwl7RPOP/9xRstpKYdYb5UB7HCHoern9LBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T05:58:15.393146Z"},"content_sha256":"508c6a7b9884cde9758ea0a2ba1d7fbd0d9c1d1b6dfe471f492b9e049c7feb78","schema_version":"1.0","event_id":"sha256:508c6a7b9884cde9758ea0a2ba1d7fbd0d9c1d1b6dfe471f492b9e049c7feb78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PY6F3OART5DB7PJ7VIUBYDFVXS/bundle.json","state_url":"https://pith.science/pith/PY6F3OART5DB7PJ7VIUBYDFVXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PY6F3OART5DB7PJ7VIUBYDFVXS/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-27T05:58:15Z","links":{"resolver":"https://pith.science/pith/PY6F3OART5DB7PJ7VIUBYDFVXS","bundle":"https://pith.science/pith/PY6F3OART5DB7PJ7VIUBYDFVXS/bundle.json","state":"https://pith.science/pith/PY6F3OART5DB7PJ7VIUBYDFVXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PY6F3OART5DB7PJ7VIUBYDFVXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PY6F3OART5DB7PJ7VIUBYDFVXS","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":"31b8264fe06b0f9be70c46e8c4cb4735a15dc1591bddf1953cea9e26f3eb96a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-05T05:09:38Z","title_canon_sha256":"23478440e945ede00154d7b93ae7881657781f9c306f59206393612ca159fe1d"},"schema_version":"1.0","source":{"id":"1402.0934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0934","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0934v1","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0934","created_at":"2026-05-18T03:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"PY6F3OART5DB","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PY6F3OART5DB7PJ7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PY6F3OAR","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:508c6a7b9884cde9758ea0a2ba1d7fbd0d9c1d1b6dfe471f492b9e049c7feb78","target":"graph","created_at":"2026-05-18T03:00:02Z","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":"Given a sequence of $n$ identically distributed random variables with common distribution $F$, the \\emph{fragility distribution of order $m$}, represented by $\\FD$, is the limit conditional distribution of the number of exceedances given there are at least $m$ exceedances, as the threshold tends to the right end point of $F$. In this paper we are concerned with the existence of $\\FD$ and its asymptotic behaviour when $n$ becomes large. For a stationary sequence with its exceedance process converging to a compound Poisson process, we derive an explicit formula for calculating $\\lim_{n \\to \\inft","authors_text":"A. Xia, H.L. Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-05T05:09:38Z","title":"Fragility Distributions and their approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0934","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:a45ebfef237c50a7154765efda8c4139d6f79ed11bb989ba821ee485a7805973","target":"record","created_at":"2026-05-18T03:00:02Z","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":"31b8264fe06b0f9be70c46e8c4cb4735a15dc1591bddf1953cea9e26f3eb96a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-05T05:09:38Z","title_canon_sha256":"23478440e945ede00154d7b93ae7881657781f9c306f59206393612ca159fe1d"},"schema_version":"1.0","source":{"id":"1402.0934","kind":"arxiv","version":1}},"canonical_sha256":"7e3c5db8119f461fbd3faa281c0cb5bcba315f19af6784e39870ec9312771e4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e3c5db8119f461fbd3faa281c0cb5bcba315f19af6784e39870ec9312771e4f","first_computed_at":"2026-05-18T03:00:02.244478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:02.244478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EDEjBdMkehZMEr5uo8R12mj2SlpjQIYuNTTUB3ll7Rit9GGB9VSjjdKuIzcI3zckeXqz60BOfDCVF/mdSGw3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:02.245189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a45ebfef237c50a7154765efda8c4139d6f79ed11bb989ba821ee485a7805973","sha256:508c6a7b9884cde9758ea0a2ba1d7fbd0d9c1d1b6dfe471f492b9e049c7feb78"],"state_sha256":"82509037f42386143927cacd63c54480a746e1545d29a70757515a1a121d809f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StJP6ffCKD8kIMBIIOVogy+U/+CUG2/IU2HIbqADqLuhQ51N4Kmjllv0cAMkwgy9AdN6wovTYg+nj8oOVw/7Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T05:58:15.395014Z","bundle_sha256":"c32e802f7279823093f8613c26592fea96068f6fc191fddbbd6e23d99a05402e"}}