{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XTLESAJP3NDJAVH7BHSSQKPVG3","short_pith_number":"pith:XTLESAJP","schema_version":"1.0","canonical_sha256":"bcd649012fdb469054ff09e52829f536cfa1a950a1b949d0d14b290450e90d79","source":{"kind":"arxiv","id":"2405.00701","version":8},"attestation_state":"computed","paper":{"title":"Learning parameter dependence for Fourier-based option pricing with tensor trains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"q-fin.CP","authors_text":"Haruto Takahashi, Koichi Miyamoto, Rihito Sakurai","submitted_at":"2024-04-17T01:57:19Z","abstract_excerpt":"A long-standing issue in mathematical finance is the speed-up of option pricing, especially for multi-asset options. A recent study has proposed to use tensor train learning algorithms to speed up Fourier transform (FT)-based option pricing, utilizing the ability of tensor trains to compress high-dimensional tensors. Another usage of the tensor train is to compress functions, including their parameter dependence. Here, we propose a pricing method, where, by a tensor train learning algorithm, we build tensor trains that approximate functions appearing in FT-based option pricing with their param"},"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":"2405.00701","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-fin.CP","submitted_at":"2024-04-17T01:57:19Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2e72deca2e930afc9640ce705614559c04d863b4b4d1292fb0c3be5fffb330b9","abstract_canon_sha256":"33e381f34fa097211947aa6ad8df49c4b4bab0726792bb5d0fd690bf51a1fa00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:40.597352Z","signature_b64":"Qtr1M2/WMWnQrTDj2ycQN1dk4n3ZZeHXnM9Y1vcKjBzUBLU8oFD+LWN1qwLi3Tv3HTxswZ9YJo/AFfos4Rf+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcd649012fdb469054ff09e52829f536cfa1a950a1b949d0d14b290450e90d79","last_reissued_at":"2026-07-05T11:53:40.596852Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:40.596852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning parameter dependence for Fourier-based option pricing with tensor trains","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"q-fin.CP","authors_text":"Haruto Takahashi, Koichi Miyamoto, Rihito Sakurai","submitted_at":"2024-04-17T01:57:19Z","abstract_excerpt":"A long-standing issue in mathematical finance is the speed-up of option pricing, especially for multi-asset options. A recent study has proposed to use tensor train learning algorithms to speed up Fourier transform (FT)-based option pricing, utilizing the ability of tensor trains to compress high-dimensional tensors. Another usage of the tensor train is to compress functions, including their parameter dependence. Here, we propose a pricing method, where, by a tensor train learning algorithm, we build tensor trains that approximate functions appearing in FT-based option pricing with their param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00701","kind":"arxiv","version":8},"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/2405.00701/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":"2405.00701","created_at":"2026-07-05T11:53:40.596907+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.00701v8","created_at":"2026-07-05T11:53:40.596907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00701","created_at":"2026-07-05T11:53:40.596907+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTLESAJP3NDJ","created_at":"2026-07-05T11:53:40.596907+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTLESAJP3NDJAVH7","created_at":"2026-07-05T11:53:40.596907+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTLESAJP","created_at":"2026-07-05T11:53:40.596907+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.02974","citing_title":"Markov Chain Monte Carlo in Tensor Network Representation","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3","json":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3.json","graph_json":"https://pith.science/api/pith-number/XTLESAJP3NDJAVH7BHSSQKPVG3/graph.json","events_json":"https://pith.science/api/pith-number/XTLESAJP3NDJAVH7BHSSQKPVG3/events.json","paper":"https://pith.science/paper/XTLESAJP"},"agent_actions":{"view_html":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3","download_json":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3.json","view_paper":"https://pith.science/paper/XTLESAJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.00701&json=true","fetch_graph":"https://pith.science/api/pith-number/XTLESAJP3NDJAVH7BHSSQKPVG3/graph.json","fetch_events":"https://pith.science/api/pith-number/XTLESAJP3NDJAVH7BHSSQKPVG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3/action/storage_attestation","attest_author":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3/action/author_attestation","sign_citation":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3/action/citation_signature","submit_replication":"https://pith.science/pith/XTLESAJP3NDJAVH7BHSSQKPVG3/action/replication_record"}},"created_at":"2026-07-05T11:53:40.596907+00:00","updated_at":"2026-07-05T11:53:40.596907+00:00"}