{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2WSQJC3TD4CFAM2W4WUADWNIZX","short_pith_number":"pith:2WSQJC3T","schema_version":"1.0","canonical_sha256":"d5a5048b731f04503356e5a801d9a8cdd6887f4cd26351075415b64030f274f4","source":{"kind":"arxiv","id":"1303.1334","version":2},"attestation_state":"computed","paper":{"title":"Pricing American options via multi-level approximation methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Denis Belomestny, Fabian Dickmann, Tigran Nagapetyan","submitted_at":"2013-03-06T13:56:24Z","abstract_excerpt":"In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we propose a multi-level low biased estimate for the price of an American option. It turns out that the resulting complexity gain can be rather high and can even reach the order (\\varepsilon^{-1}) with (\\varepsilon) denoting the desired precision. The performance of the proposed multilevel algorithm is il"},"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":"1303.1334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.CP","submitted_at":"2013-03-06T13:56:24Z","cross_cats_sorted":[],"title_canon_sha256":"f356fe98d00e8437788cc6cc44b71e6fac595b5bec2caf5249967cfcf1bd9c56","abstract_canon_sha256":"c1dcdb49ba5d5a45f12a02fa4081861e649c893886f5fd7a07a9d6e6889b83ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:54.896515Z","signature_b64":"EzYaaRzDrNBp76+QdsFm3bW1uEvkAn1gk/ka1K+PZVfuTvtjMF5/cNfymTPltIlDmB6KoNZYHZub6IYkHVcPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5a5048b731f04503356e5a801d9a8cdd6887f4cd26351075415b64030f274f4","last_reissued_at":"2026-05-18T03:03:54.895772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:54.895772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pricing American options via multi-level approximation methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-fin.CP","authors_text":"Denis Belomestny, Fabian Dickmann, Tigran Nagapetyan","submitted_at":"2013-03-06T13:56:24Z","abstract_excerpt":"In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we propose a multi-level low biased estimate for the price of an American option. It turns out that the resulting complexity gain can be rather high and can even reach the order (\\varepsilon^{-1}) with (\\varepsilon) denoting the desired precision. The performance of the proposed multilevel algorithm is il"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1334","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.1334","created_at":"2026-05-18T03:03:54.895894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1334v2","created_at":"2026-05-18T03:03:54.895894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1334","created_at":"2026-05-18T03:03:54.895894+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WSQJC3TD4CF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WSQJC3TD4CFAM2W","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WSQJC3T","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX","json":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX.json","graph_json":"https://pith.science/api/pith-number/2WSQJC3TD4CFAM2W4WUADWNIZX/graph.json","events_json":"https://pith.science/api/pith-number/2WSQJC3TD4CFAM2W4WUADWNIZX/events.json","paper":"https://pith.science/paper/2WSQJC3T"},"agent_actions":{"view_html":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX","download_json":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX.json","view_paper":"https://pith.science/paper/2WSQJC3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1334&json=true","fetch_graph":"https://pith.science/api/pith-number/2WSQJC3TD4CFAM2W4WUADWNIZX/graph.json","fetch_events":"https://pith.science/api/pith-number/2WSQJC3TD4CFAM2W4WUADWNIZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX/action/storage_attestation","attest_author":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX/action/author_attestation","sign_citation":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX/action/citation_signature","submit_replication":"https://pith.science/pith/2WSQJC3TD4CFAM2W4WUADWNIZX/action/replication_record"}},"created_at":"2026-05-18T03:03:54.895894+00:00","updated_at":"2026-05-18T03:03:54.895894+00:00"}