{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BZK3TMXECALHHOPHDQGY5XK6V5","short_pith_number":"pith:BZK3TMXE","canonical_record":{"source":{"id":"1103.4483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2011-03-23T10:33:30Z","cross_cats_sorted":["math.PR","q-fin.PR"],"title_canon_sha256":"a0541096e4f18f169bf8e06dde242aa20c2dbdce4099927d17e4513bc59a670b","abstract_canon_sha256":"5a4c69c42d14de8378eaf04c10561df8ab3752f98b6b6a69b41a3bba1c343d51"},"schema_version":"1.0"},"canonical_sha256":"0e55b9b2e4101673b9e71c0d8edd5eaf7b4f126f7fde5a45df3ce909fe3a082f","source":{"kind":"arxiv","id":"1103.4483","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4483","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4483v2","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4483","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"BZK3TMXECALH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BZK3TMXECALHHOPH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BZK3TMXE","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BZK3TMXECALHHOPHDQGY5XK6V5","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4483","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2011-03-23T10:33:30Z","cross_cats_sorted":["math.PR","q-fin.PR"],"title_canon_sha256":"a0541096e4f18f169bf8e06dde242aa20c2dbdce4099927d17e4513bc59a670b","abstract_canon_sha256":"5a4c69c42d14de8378eaf04c10561df8ab3752f98b6b6a69b41a3bba1c343d51"},"schema_version":"1.0"},"canonical_sha256":"0e55b9b2e4101673b9e71c0d8edd5eaf7b4f126f7fde5a45df3ce909fe3a082f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:24.711881Z","signature_b64":"C7+VzH1N5OT3ZuORAvQMl8XBUL3xIRYdI0XytdtpOxwudoQcM3otPxsbQ4Y3bGUBP9b1pxzxQHxJyhxvMavQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e55b9b2e4101673b9e71c0d8edd5eaf7b4f126f7fde5a45df3ce909fe3a082f","last_reissued_at":"2026-05-18T03:10:24.711344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:24.711344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4483","source_version":2,"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:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9XoGbQ2FYTJezX47ZJ5hYu5iUuu3oBDmpyJgR+1uYhV2BTK5Yvo+Q5XLfka8tn5JfbWpggQE/hFWF8sa0qyNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:21:04.323181Z"},"content_sha256":"c150f009fc2d55ae3f39f4457a0d059c4f8b26adf221fd4af304003dc68910f4","schema_version":"1.0","event_id":"sha256:c150f009fc2d55ae3f39f4457a0d059c4f8b26adf221fd4af304003dc68910f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BZK3TMXECALHHOPHDQGY5XK6V5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A method for pricing American options using semi-infinite linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-fin.PR"],"primary_cat":"q-fin.CP","authors_text":"S\\\"oren Christensen","submitted_at":"2011-03-23T10:33:30Z","abstract_excerpt":"We introduce a new approach for the numerical pricing of American options. The main idea is to choose a finite number of suitable excessive functions (randomly) and to find the smallest majorant of the gain function in the span of these functions. The resulting problem is a linear semi-infinite programming problem, that can be solved using standard algorithms. This leads to good upper bounds for the original problem. For our algorithms no discretization of space and time and no simulation is necessary. Furthermore it is applicable even for high-dimensional problems. The algorithm provides an a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4483","kind":"arxiv","version":2},"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:10:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DfZDUrxTrcv8MpQ5zDS7g87CvDyPyAXK4QeSmzi5FS51AR56Fce+/1u9lKVW7SQ+XHdkYHkTXaWMHTjOOga5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:21:04.323547Z"},"content_sha256":"fa7ed229a3f7bbdc19c6607aafea27218e184bd21bc8c70430a143440d0f12d8","schema_version":"1.0","event_id":"sha256:fa7ed229a3f7bbdc19c6607aafea27218e184bd21bc8c70430a143440d0f12d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZK3TMXECALHHOPHDQGY5XK6V5/bundle.json","state_url":"https://pith.science/pith/BZK3TMXECALHHOPHDQGY5XK6V5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZK3TMXECALHHOPHDQGY5XK6V5/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-20T20:21:04Z","links":{"resolver":"https://pith.science/pith/BZK3TMXECALHHOPHDQGY5XK6V5","bundle":"https://pith.science/pith/BZK3TMXECALHHOPHDQGY5XK6V5/bundle.json","state":"https://pith.science/pith/BZK3TMXECALHHOPHDQGY5XK6V5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZK3TMXECALHHOPHDQGY5XK6V5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BZK3TMXECALHHOPHDQGY5XK6V5","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":"5a4c69c42d14de8378eaf04c10561df8ab3752f98b6b6a69b41a3bba1c343d51","cross_cats_sorted":["math.PR","q-fin.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2011-03-23T10:33:30Z","title_canon_sha256":"a0541096e4f18f169bf8e06dde242aa20c2dbdce4099927d17e4513bc59a670b"},"schema_version":"1.0","source":{"id":"1103.4483","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4483","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4483v2","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4483","created_at":"2026-05-18T03:10:24Z"},{"alias_kind":"pith_short_12","alias_value":"BZK3TMXECALH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BZK3TMXECALHHOPH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BZK3TMXE","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:fa7ed229a3f7bbdc19c6607aafea27218e184bd21bc8c70430a143440d0f12d8","target":"graph","created_at":"2026-05-18T03:10:24Z","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":"We introduce a new approach for the numerical pricing of American options. The main idea is to choose a finite number of suitable excessive functions (randomly) and to find the smallest majorant of the gain function in the span of these functions. The resulting problem is a linear semi-infinite programming problem, that can be solved using standard algorithms. This leads to good upper bounds for the original problem. For our algorithms no discretization of space and time and no simulation is necessary. Furthermore it is applicable even for high-dimensional problems. The algorithm provides an a","authors_text":"S\\\"oren Christensen","cross_cats":["math.PR","q-fin.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2011-03-23T10:33:30Z","title":"A method for pricing American options using semi-infinite linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4483","kind":"arxiv","version":2},"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:c150f009fc2d55ae3f39f4457a0d059c4f8b26adf221fd4af304003dc68910f4","target":"record","created_at":"2026-05-18T03:10:24Z","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":"5a4c69c42d14de8378eaf04c10561df8ab3752f98b6b6a69b41a3bba1c343d51","cross_cats_sorted":["math.PR","q-fin.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2011-03-23T10:33:30Z","title_canon_sha256":"a0541096e4f18f169bf8e06dde242aa20c2dbdce4099927d17e4513bc59a670b"},"schema_version":"1.0","source":{"id":"1103.4483","kind":"arxiv","version":2}},"canonical_sha256":"0e55b9b2e4101673b9e71c0d8edd5eaf7b4f126f7fde5a45df3ce909fe3a082f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e55b9b2e4101673b9e71c0d8edd5eaf7b4f126f7fde5a45df3ce909fe3a082f","first_computed_at":"2026-05-18T03:10:24.711344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:24.711344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C7+VzH1N5OT3ZuORAvQMl8XBUL3xIRYdI0XytdtpOxwudoQcM3otPxsbQ4Y3bGUBP9b1pxzxQHxJyhxvMavQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:24.711881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4483","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c150f009fc2d55ae3f39f4457a0d059c4f8b26adf221fd4af304003dc68910f4","sha256:fa7ed229a3f7bbdc19c6607aafea27218e184bd21bc8c70430a143440d0f12d8"],"state_sha256":"3c3d9ffc2d4061923d0a8069afa4194a71a12898b8d6ec621f307d569fb277dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IeS2u9hn6g5bE616ZHwctKeXqD7LQrUPUeHBC8kUN3u4wdr/b13drPZXP1+yTPQahLH/9DM8Tf2Xw93AMIChCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:21:04.325391Z","bundle_sha256":"923c7adc96ebca7c189a6d7e6f7aecddc9f0ba987bdf922fc2b92d31325c6404"}}