{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JZLPGTFIT52MXV4RVHMW5TIBU5","short_pith_number":"pith:JZLPGTFI","canonical_record":{"source":{"id":"2607.28435","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T16:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"2e700e6b36db7519a6af3f96b0f7a49d86edb7d8d60d5348201b15685aae0045","abstract_canon_sha256":"9cc67eb84b143e5ccc205b2e162ea413e37364ee7358749ce2c0ba654a37ef9c"},"schema_version":"1.0"},"canonical_sha256":"4e56f34ca89f74cbd791a9d96ecd01a74085d012f2f052e638e95a8d40d05cbc","source":{"kind":"arxiv","id":"2607.28435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28435","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28435v1","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28435","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"JZLPGTFIT52M","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"pith_short_16","alias_value":"JZLPGTFIT52MXV4R","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"pith_short_8","alias_value":"JZLPGTFI","created_at":"2026-07-31T01:37:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JZLPGTFIT52MXV4RVHMW5TIBU5","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28435","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T16:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"2e700e6b36db7519a6af3f96b0f7a49d86edb7d8d60d5348201b15685aae0045","abstract_canon_sha256":"9cc67eb84b143e5ccc205b2e162ea413e37364ee7358749ce2c0ba654a37ef9c"},"schema_version":"1.0"},"canonical_sha256":"4e56f34ca89f74cbd791a9d96ecd01a74085d012f2f052e638e95a8d40d05cbc","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e56f34ca89f74cbd791a9d96ecd01a74085d012f2f052e638e95a8d40d05cbc","last_reissued_at":"2026-07-31T01:37:37.864202Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:37:37.864202Z"},"source_kind":"arxiv","source_id":"2607.28435","source_version":1,"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-07-31T01:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cKJyAGb4OXi1tt3N6NmaIIZSi8boy+ialrdMHQxUb4qbKHVPqoPp3nqOAZ4zOfT+g0E9/TjqbcZByCCvxLcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:38:49.167217Z"},"content_sha256":"fb00234026df6457434e09e9f8e4d9ddb4b0ab38c649628e177419a05dc0b6e8","schema_version":"1.0","event_id":"sha256:fb00234026df6457434e09e9f8e4d9ddb4b0ab38c649628e177419a05dc0b6e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JZLPGTFIT52MXV4RVHMW5TIBU5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classical Tensor Network and Quantum Fourier Transform Approaches for Large-Scale Carr-Madan Option Pricing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ivica Turkalj, Sascha Hauck","submitted_at":"2026-07-30T16:12:44Z","abstract_excerpt":"Fourier-based methods are among the most widely used techniques for pricing European options when the characteristic function of the underlying asset process is available. Their applicability to increasingly fine discretizations, however, is limited by the rapidly growing memory requirements of classical Fourier transforms, which become a computational bottleneck for large-scale pricing problems.\n  In this work, we overcome this limitation by reformulating the Carr-Madan pricing framework using tensor networks. Specifically, we employ the Superfast Fourier Transform (SFFT), a compressed Tensor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28435","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/2607.28435/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"},"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-07-31T01:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSsqpcw6zY6e36hvI+0RC2cPPGivfbEA4Q3s57R3C8xIaYIQzUm7kQMLYwyy8KKVmNzR4R86c4k4I0jvbkGWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:38:49.167602Z"},"content_sha256":"1f6b1c4002ebd1b67332983cdcff4e3d4303b23c70ef1f034e69a58fae871c71","schema_version":"1.0","event_id":"sha256:1f6b1c4002ebd1b67332983cdcff4e3d4303b23c70ef1f034e69a58fae871c71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZLPGTFIT52MXV4RVHMW5TIBU5/bundle.json","state_url":"https://pith.science/pith/JZLPGTFIT52MXV4RVHMW5TIBU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZLPGTFIT52MXV4RVHMW5TIBU5/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-08-11T03:38:49Z","links":{"resolver":"https://pith.science/pith/JZLPGTFIT52MXV4RVHMW5TIBU5","bundle":"https://pith.science/pith/JZLPGTFIT52MXV4RVHMW5TIBU5/bundle.json","state":"https://pith.science/pith/JZLPGTFIT52MXV4RVHMW5TIBU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZLPGTFIT52MXV4RVHMW5TIBU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JZLPGTFIT52MXV4RVHMW5TIBU5","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":"9cc67eb84b143e5ccc205b2e162ea413e37364ee7358749ce2c0ba654a37ef9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T16:12:44Z","title_canon_sha256":"2e700e6b36db7519a6af3f96b0f7a49d86edb7d8d60d5348201b15685aae0045"},"schema_version":"1.0","source":{"id":"2607.28435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28435","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28435v1","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28435","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"JZLPGTFIT52M","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"pith_short_16","alias_value":"JZLPGTFIT52MXV4R","created_at":"2026-07-31T01:37:37Z"},{"alias_kind":"pith_short_8","alias_value":"JZLPGTFI","created_at":"2026-07-31T01:37:37Z"}],"graph_snapshots":[{"event_id":"sha256:1f6b1c4002ebd1b67332983cdcff4e3d4303b23c70ef1f034e69a58fae871c71","target":"graph","created_at":"2026-07-31T01:37:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.28435/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fourier-based methods are among the most widely used techniques for pricing European options when the characteristic function of the underlying asset process is available. Their applicability to increasingly fine discretizations, however, is limited by the rapidly growing memory requirements of classical Fourier transforms, which become a computational bottleneck for large-scale pricing problems.\n  In this work, we overcome this limitation by reformulating the Carr-Madan pricing framework using tensor networks. Specifically, we employ the Superfast Fourier Transform (SFFT), a compressed Tensor","authors_text":"Ivica Turkalj, Sascha Hauck","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T16:12:44Z","title":"Classical Tensor Network and Quantum Fourier Transform Approaches for Large-Scale Carr-Madan Option Pricing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28435","kind":"arxiv","version":1},"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:fb00234026df6457434e09e9f8e4d9ddb4b0ab38c649628e177419a05dc0b6e8","target":"record","created_at":"2026-07-31T01:37:37Z","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":"9cc67eb84b143e5ccc205b2e162ea413e37364ee7358749ce2c0ba654a37ef9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T16:12:44Z","title_canon_sha256":"2e700e6b36db7519a6af3f96b0f7a49d86edb7d8d60d5348201b15685aae0045"},"schema_version":"1.0","source":{"id":"2607.28435","kind":"arxiv","version":1}},"canonical_sha256":"4e56f34ca89f74cbd791a9d96ecd01a74085d012f2f052e638e95a8d40d05cbc","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e56f34ca89f74cbd791a9d96ecd01a74085d012f2f052e638e95a8d40d05cbc","first_computed_at":"2026-07-31T01:37:37.864202Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:37:37.864202Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb00234026df6457434e09e9f8e4d9ddb4b0ab38c649628e177419a05dc0b6e8","sha256:1f6b1c4002ebd1b67332983cdcff4e3d4303b23c70ef1f034e69a58fae871c71"],"state_sha256":"ff2dd4e760105238c3d0b1d26a1900bc354e0c167919c795ad3ca072f2960c19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21XfPBtEvcUz0kLjyckKJLgBXBslrCnlFAZePcigqRg+qPQMta/Bl6bcZt55AA8hlgbVfQr4cW0JlS0c1C2gDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:38:49.170017Z","bundle_sha256":"1a094c15d4016faae09e1a3307c8058e10a329e9942c1d2080ff80210681fc89"}}