{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PPOYP2XZO4EJTXAYJUUYMFXIEE","short_pith_number":"pith:PPOYP2XZ","schema_version":"1.0","canonical_sha256":"7bdd87eaf9770899dc184d298616e8212ed2d4b58875ebe5df5376f81c82c06a","source":{"kind":"arxiv","id":"2308.11828","version":5},"attestation_state":"computed","paper":{"title":"Optimal Robust Reinsurance with Multiple Insurers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.RM","authors_text":"Emma Kroell, Sebastian Jaimungal, Silvana M. Pesenti","submitted_at":"2023-08-22T23:24:02Z","abstract_excerpt":"We study a reinsurer who faces multiple sources of model uncertainty. The reinsurer offers contracts to $n$ insurers whose claims follow compound Poisson processes representing both idiosyncratic and systemic sources of loss. As the reinsurer is uncertain about the insurers' claim severity distributions and frequencies, they design reinsurance contracts that maximise their expected wealth subject to an entropy penalty. Insurers meanwhile seek to maximise their expected utility without ambiguity. We solve this continuous-time Stackelberg game for general reinsurance contracts and find that the "},"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":"2308.11828","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.RM","submitted_at":"2023-08-22T23:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"c85c1f4703b853068f72a1630bf04253a53277b80e6c4cb733104555348dba46","abstract_canon_sha256":"40873c5c5bac07dee03eb8874d9fa5ffd1e6d57c7d957be518d0826a45a11e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:27.818533Z","signature_b64":"G3GtXDH0UR6qXbglhIzkUrKKdKU6ErM0QY6HzLQ921pa3O3aol8LObjKMsIievbDZofdXXwAv/nqG6WqMdwFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bdd87eaf9770899dc184d298616e8212ed2d4b58875ebe5df5376f81c82c06a","last_reissued_at":"2026-07-05T09:14:27.817986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:27.817986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Robust Reinsurance with Multiple Insurers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.RM","authors_text":"Emma Kroell, Sebastian Jaimungal, Silvana M. Pesenti","submitted_at":"2023-08-22T23:24:02Z","abstract_excerpt":"We study a reinsurer who faces multiple sources of model uncertainty. The reinsurer offers contracts to $n$ insurers whose claims follow compound Poisson processes representing both idiosyncratic and systemic sources of loss. As the reinsurer is uncertain about the insurers' claim severity distributions and frequencies, they design reinsurance contracts that maximise their expected wealth subject to an entropy penalty. Insurers meanwhile seek to maximise their expected utility without ambiguity. We solve this continuous-time Stackelberg game for general reinsurance contracts and find that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.11828","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.11828/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.11828","created_at":"2026-07-05T09:14:27.818052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.11828v5","created_at":"2026-07-05T09:14:27.818052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.11828","created_at":"2026-07-05T09:14:27.818052+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPOYP2XZO4EJ","created_at":"2026-07-05T09:14:27.818052+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPOYP2XZO4EJTXAY","created_at":"2026-07-05T09:14:27.818052+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPOYP2XZ","created_at":"2026-07-05T09:14:27.818052+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09644","citing_title":"Neural Operators Can Play Dynamic Stackelberg Games","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE","json":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE.json","graph_json":"https://pith.science/api/pith-number/PPOYP2XZO4EJTXAYJUUYMFXIEE/graph.json","events_json":"https://pith.science/api/pith-number/PPOYP2XZO4EJTXAYJUUYMFXIEE/events.json","paper":"https://pith.science/paper/PPOYP2XZ"},"agent_actions":{"view_html":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE","download_json":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE.json","view_paper":"https://pith.science/paper/PPOYP2XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.11828&json=true","fetch_graph":"https://pith.science/api/pith-number/PPOYP2XZO4EJTXAYJUUYMFXIEE/graph.json","fetch_events":"https://pith.science/api/pith-number/PPOYP2XZO4EJTXAYJUUYMFXIEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE/action/storage_attestation","attest_author":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE/action/author_attestation","sign_citation":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE/action/citation_signature","submit_replication":"https://pith.science/pith/PPOYP2XZO4EJTXAYJUUYMFXIEE/action/replication_record"}},"created_at":"2026-07-05T09:14:27.818052+00:00","updated_at":"2026-07-05T09:14:27.818052+00:00"}