{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WIGVES463GAGR5KTNEKC3GC5KO","short_pith_number":"pith:WIGVES46","schema_version":"1.0","canonical_sha256":"b20d524b9ed98068f55369142d985d5388f28430858342e958d76b81699b7c5d","source":{"kind":"arxiv","id":"2502.07123","version":1},"attestation_state":"computed","paper":{"title":"A nested MLMC framework for efficient simulations on FPGAs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"q-fin.CP","authors_text":"Irina-Beatrice Haas, Michael B. Giles","submitted_at":"2025-02-10T23:36:41Z","abstract_excerpt":"Multilevel Monte Carlo (MLMC) reduces the total computational cost of financial option pricing by combining SDE approximations with multiple resolutions. This paper explores a further avenue for reducing cost and improving power efficiency through the use of low precision calculations on configurable hardware devices such as Field-Programmable Gate Arrays (FPGAs). We propose a new framework that exploits approximate random variables and fixed-point operations with optimised precision to generate most SDE paths with a lower cost and reduce the overall cost of the MLMC framework. We first discus"},"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":"2502.07123","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.CP","submitted_at":"2025-02-10T23:36:41Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"e9e4bbc3d31f18061bab703a34d0575c70c3e891cd7aa51e4537422e03868630","abstract_canon_sha256":"5f9a4ba9864f079b252bbf49c130e2cd35963ea51ca22d3fc52fac20137458fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:33.204093Z","signature_b64":"uo5tEbhpChCwEP7grcOND2o/VtRfGq11Y2IGr8YWEJf1ZGB5l9IJc3wIsMOCEd9Ogy6Va0K7fZOl08/Sje6eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b20d524b9ed98068f55369142d985d5388f28430858342e958d76b81699b7c5d","last_reissued_at":"2026-07-05T10:12:33.203657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:33.203657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A nested MLMC framework for efficient simulations on FPGAs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"q-fin.CP","authors_text":"Irina-Beatrice Haas, Michael B. Giles","submitted_at":"2025-02-10T23:36:41Z","abstract_excerpt":"Multilevel Monte Carlo (MLMC) reduces the total computational cost of financial option pricing by combining SDE approximations with multiple resolutions. This paper explores a further avenue for reducing cost and improving power efficiency through the use of low precision calculations on configurable hardware devices such as Field-Programmable Gate Arrays (FPGAs). We propose a new framework that exploits approximate random variables and fixed-point operations with optimised precision to generate most SDE paths with a lower cost and reduce the overall cost of the MLMC framework. We first discus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07123","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.07123/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":"2502.07123","created_at":"2026-07-05T10:12:33.203708+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07123v1","created_at":"2026-07-05T10:12:33.203708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07123","created_at":"2026-07-05T10:12:33.203708+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIGVES463GAG","created_at":"2026-07-05T10:12:33.203708+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIGVES463GAGR5KT","created_at":"2026-07-05T10:12:33.203708+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIGVES46","created_at":"2026-07-05T10:12:33.203708+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08060","citing_title":"Eliciting Fine-Tuned Transformer Capabilities via Inference-Time Techniques","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO","json":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO.json","graph_json":"https://pith.science/api/pith-number/WIGVES463GAGR5KTNEKC3GC5KO/graph.json","events_json":"https://pith.science/api/pith-number/WIGVES463GAGR5KTNEKC3GC5KO/events.json","paper":"https://pith.science/paper/WIGVES46"},"agent_actions":{"view_html":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO","download_json":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO.json","view_paper":"https://pith.science/paper/WIGVES46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07123&json=true","fetch_graph":"https://pith.science/api/pith-number/WIGVES463GAGR5KTNEKC3GC5KO/graph.json","fetch_events":"https://pith.science/api/pith-number/WIGVES463GAGR5KTNEKC3GC5KO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO/action/storage_attestation","attest_author":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO/action/author_attestation","sign_citation":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO/action/citation_signature","submit_replication":"https://pith.science/pith/WIGVES463GAGR5KTNEKC3GC5KO/action/replication_record"}},"created_at":"2026-07-05T10:12:33.203708+00:00","updated_at":"2026-07-05T10:12:33.203708+00:00"}