{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IEKCOLSOUJDTRP4TTNP7WOGFRJ","short_pith_number":"pith:IEKCOLSO","canonical_record":{"source":{"id":"1701.05536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-19T18:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"7b2f4bb354edd28f694641bf8066102926d1afc6e413eed6225a78177687e86a","abstract_canon_sha256":"238d19877cc4cae9aaeddc06b1b44ea67a639ebe9abd5b1031953fdbaeea5eeb"},"schema_version":"1.0"},"canonical_sha256":"4114272e4ea24738bf939b5ffb38c58a6600007e3154c5258621e5e9b9b5e78c","source":{"kind":"arxiv","id":"1701.05536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05536","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05536v1","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05536","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"IEKCOLSOUJDT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IEKCOLSOUJDTRP4T","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IEKCOLSO","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IEKCOLSOUJDTRP4TTNP7WOGFRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-19T18:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"7b2f4bb354edd28f694641bf8066102926d1afc6e413eed6225a78177687e86a","abstract_canon_sha256":"238d19877cc4cae9aaeddc06b1b44ea67a639ebe9abd5b1031953fdbaeea5eeb"},"schema_version":"1.0"},"canonical_sha256":"4114272e4ea24738bf939b5ffb38c58a6600007e3154c5258621e5e9b9b5e78c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:29.614968Z","signature_b64":"RfnLvOJWABCU8Ha1Gv/G+LqkrL9ZRhyDmx0IEgTmPeSceCth3u4Cz4kJxvCdlFBo4qULMrDChbEjy+Ow+Te0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4114272e4ea24738bf939b5ffb38c58a6600007e3154c5258621e5e9b9b5e78c","last_reissued_at":"2026-05-18T00:52:29.614491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:29.614491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05536","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-18T00:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g11H2+ytkEcJRCGDt3BU+TD9ebyXSadwc/4qSIkP6oDvUcTu88XFnQkPd/AzCXlA+5awFercBDM1SXi/HdbADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:49.745689Z"},"content_sha256":"28391341e4be7d15c26d78882738c68d2f50b7b350a8ba3460c29fbd2a223dbc","schema_version":"1.0","event_id":"sha256:28391341e4be7d15c26d78882738c68d2f50b7b350a8ba3460c29fbd2a223dbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IEKCOLSOUJDTRP4TTNP7WOGFRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Approximating Ruin Probability of Double Stochastic Compound Poisson Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amir T. Payandeh Najafabadi, Dan Kucerovsky","submitted_at":"2017-01-19T18:15:22Z","abstract_excerpt":"Consider a surplus process which both of collected premium and payed claim size are two independent compound Poisson processes. This article derives two approximated formulas for the ruin probability of such surplus process, say double stochastic compound poisson process. More precisely, it provides two mixture exponential approximations for ruin probability of such double stochastic compound poisson process. Applications to long_term Bonus_Malus systems and a heavy-tiled claim size distribution have been given. Improvement of our findings compared to the Cramer- Lundberg upper bound has been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05536","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-18T00:52:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9acXBQEFno/DitwRSw/OfrRHNE/JkDxWSeYRztM87faYuvnLP8nnwv80WDupfeG7ymJjLpZ/ALAFoTjIIvJQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:20:49.746114Z"},"content_sha256":"0bd84193203a00923072449a153679c8ab32d326442b49cc9b0c5bc0c93ed0a1","schema_version":"1.0","event_id":"sha256:0bd84193203a00923072449a153679c8ab32d326442b49cc9b0c5bc0c93ed0a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEKCOLSOUJDTRP4TTNP7WOGFRJ/bundle.json","state_url":"https://pith.science/pith/IEKCOLSOUJDTRP4TTNP7WOGFRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEKCOLSOUJDTRP4TTNP7WOGFRJ/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-30T05:20:49Z","links":{"resolver":"https://pith.science/pith/IEKCOLSOUJDTRP4TTNP7WOGFRJ","bundle":"https://pith.science/pith/IEKCOLSOUJDTRP4TTNP7WOGFRJ/bundle.json","state":"https://pith.science/pith/IEKCOLSOUJDTRP4TTNP7WOGFRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEKCOLSOUJDTRP4TTNP7WOGFRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IEKCOLSOUJDTRP4TTNP7WOGFRJ","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":"238d19877cc4cae9aaeddc06b1b44ea67a639ebe9abd5b1031953fdbaeea5eeb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-19T18:15:22Z","title_canon_sha256":"7b2f4bb354edd28f694641bf8066102926d1afc6e413eed6225a78177687e86a"},"schema_version":"1.0","source":{"id":"1701.05536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05536","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05536v1","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05536","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"IEKCOLSOUJDT","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IEKCOLSOUJDTRP4T","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IEKCOLSO","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:0bd84193203a00923072449a153679c8ab32d326442b49cc9b0c5bc0c93ed0a1","target":"graph","created_at":"2026-05-18T00:52:29Z","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":"Consider a surplus process which both of collected premium and payed claim size are two independent compound Poisson processes. This article derives two approximated formulas for the ruin probability of such surplus process, say double stochastic compound poisson process. More precisely, it provides two mixture exponential approximations for ruin probability of such double stochastic compound poisson process. Applications to long_term Bonus_Malus systems and a heavy-tiled claim size distribution have been given. Improvement of our findings compared to the Cramer- Lundberg upper bound has been ","authors_text":"Amir T. Payandeh Najafabadi, Dan Kucerovsky","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-19T18:15:22Z","title":"On Approximating Ruin Probability of Double Stochastic Compound Poisson Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05536","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:28391341e4be7d15c26d78882738c68d2f50b7b350a8ba3460c29fbd2a223dbc","target":"record","created_at":"2026-05-18T00:52:29Z","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":"238d19877cc4cae9aaeddc06b1b44ea67a639ebe9abd5b1031953fdbaeea5eeb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2017-01-19T18:15:22Z","title_canon_sha256":"7b2f4bb354edd28f694641bf8066102926d1afc6e413eed6225a78177687e86a"},"schema_version":"1.0","source":{"id":"1701.05536","kind":"arxiv","version":1}},"canonical_sha256":"4114272e4ea24738bf939b5ffb38c58a6600007e3154c5258621e5e9b9b5e78c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4114272e4ea24738bf939b5ffb38c58a6600007e3154c5258621e5e9b9b5e78c","first_computed_at":"2026-05-18T00:52:29.614491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:29.614491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RfnLvOJWABCU8Ha1Gv/G+LqkrL9ZRhyDmx0IEgTmPeSceCth3u4Cz4kJxvCdlFBo4qULMrDChbEjy+Ow+Te0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:29.614968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28391341e4be7d15c26d78882738c68d2f50b7b350a8ba3460c29fbd2a223dbc","sha256:0bd84193203a00923072449a153679c8ab32d326442b49cc9b0c5bc0c93ed0a1"],"state_sha256":"a8cef3020d6484bac4af0997655a318fc168ac62fc324fb922445a51b5c449e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugbExa9PD4hS5mE6MNSo3XyN2n7+GFEPvPKM1x9ZWT8blYOpPSXfO5DrRrh9/Y0fkD39CbF4i9fzJpFBOQVrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:20:49.749027Z","bundle_sha256":"79349dbb03af9d3bd81664af63d79493a81b503f738588821adf7238501440ec"}}