{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CWOKXRWE7Q2KXCC7N2PJXTIWZ3","short_pith_number":"pith:CWOKXRWE","schema_version":"1.0","canonical_sha256":"159cabc6c4fc34ab885f6e9e9bcd16cef417885c5afc6db73bdafd722d920de7","source":{"kind":"arxiv","id":"1203.2369","version":1},"attestation_state":"computed","paper":{"title":"Counterparty Risk Valuation: A Marked Branching Diffusion Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Pierre Henry-Labordere (SOCIETE Generale)","submitted_at":"2012-03-11T19:40:07Z","abstract_excerpt":"The purpose of this paper is to design an algorithm for the computation of the counterparty risk which is competitive in regards of a brute force \"Monte-Carlo of Monte-Carlo\" method (with nested simulations). This is achieved using marked branching diffusions describing a Galton-Watson random tree. Such an algorithm leads at the same time to a computation of the (bilateral) counterparty risk when we use the default-risky or counterparty-riskless option values as mark-to-market. Our method is illustrated by various numerical examples."},"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":"1203.2369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2012-03-11T19:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"d4abd5bf14ac82de0a608f4de759a20e25d8c4f9cdeaf2cedf499aaed792d289","abstract_canon_sha256":"83deb11af4425ecdb69bbebf0afbbe6949e2253b131c12dc7faa9624fc52b454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:25.713576Z","signature_b64":"V7hhx4Wux4E9XmW+Sm+meiRGRn6mD0JzQvHPub0PMOigSPgEPwc93X3Dsk/FsEWt6HOOWpn8AruIXGzbkmy+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"159cabc6c4fc34ab885f6e9e9bcd16cef417885c5afc6db73bdafd722d920de7","last_reissued_at":"2026-05-18T04:00:25.712938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:25.712938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counterparty Risk Valuation: A Marked Branching Diffusion Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Pierre Henry-Labordere (SOCIETE Generale)","submitted_at":"2012-03-11T19:40:07Z","abstract_excerpt":"The purpose of this paper is to design an algorithm for the computation of the counterparty risk which is competitive in regards of a brute force \"Monte-Carlo of Monte-Carlo\" method (with nested simulations). This is achieved using marked branching diffusions describing a Galton-Watson random tree. Such an algorithm leads at the same time to a computation of the (bilateral) counterparty risk when we use the default-risky or counterparty-riskless option values as mark-to-market. Our method is illustrated by various numerical examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2369","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.2369","created_at":"2026-05-18T04:00:25.713037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2369v1","created_at":"2026-05-18T04:00:25.713037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2369","created_at":"2026-05-18T04:00:25.713037+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWOKXRWE7Q2K","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWOKXRWE7Q2KXCC7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWOKXRWE","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06238","citing_title":"XNet-Enhanced Deep BSDE Method and Numerical Analysis","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3","json":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3.json","graph_json":"https://pith.science/api/pith-number/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/graph.json","events_json":"https://pith.science/api/pith-number/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/events.json","paper":"https://pith.science/paper/CWOKXRWE"},"agent_actions":{"view_html":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3","download_json":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3.json","view_paper":"https://pith.science/paper/CWOKXRWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2369&json=true","fetch_graph":"https://pith.science/api/pith-number/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/action/storage_attestation","attest_author":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/action/author_attestation","sign_citation":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/action/citation_signature","submit_replication":"https://pith.science/pith/CWOKXRWE7Q2KXCC7N2PJXTIWZ3/action/replication_record"}},"created_at":"2026-05-18T04:00:25.713037+00:00","updated_at":"2026-05-18T04:00:25.713037+00:00"}