{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YQRD75O467HNRLG2FRVYIUM62J","short_pith_number":"pith:YQRD75O4","canonical_record":{"source":{"id":"1110.2477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-11T19:43:40Z","cross_cats_sorted":["q-fin.CP"],"title_canon_sha256":"1ccc7c171438d33e5c138139ab0ae88d0ca6ed52354625fe64a7d1262224fa4a","abstract_canon_sha256":"3ae096a1623048f7faaf74ca7d4be7b83da3d5db1a9a07065a328c14d1af53e6"},"schema_version":"1.0"},"canonical_sha256":"c4223ff5dcf7ced8acda2c6b84519ed247013ae8d084b53434c61a4ee59ad927","source":{"kind":"arxiv","id":"1110.2477","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2477","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2477v1","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2477","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"YQRD75O467HN","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YQRD75O467HNRLG2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YQRD75O4","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YQRD75O467HNRLG2FRVYIUM62J","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-11T19:43:40Z","cross_cats_sorted":["q-fin.CP"],"title_canon_sha256":"1ccc7c171438d33e5c138139ab0ae88d0ca6ed52354625fe64a7d1262224fa4a","abstract_canon_sha256":"3ae096a1623048f7faaf74ca7d4be7b83da3d5db1a9a07065a328c14d1af53e6"},"schema_version":"1.0"},"canonical_sha256":"c4223ff5dcf7ced8acda2c6b84519ed247013ae8d084b53434c61a4ee59ad927","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:08.962243Z","signature_b64":"EYxxeDMDEx3TWMGNJXeeIWqYlS2jvc2b4BPeYBsdss3SUjX4CaV04B5herxe1JdFnvVDp0p2aNVMPRVjPGR4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4223ff5dcf7ced8acda2c6b84519ed247013ae8d084b53434c61a4ee59ad927","last_reissued_at":"2026-05-18T04:11:08.961620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:08.961620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2477","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-05-18T04:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HzcwX21JoUOOSEBO/Ik6xg3TNdB1m9X+mUyKFVxkP2XHc4ELW5ksSvZD6kgOoKTmuaIrc3G63L0vTpU9+HHrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:22:00.261766Z"},"content_sha256":"c8806016c8a25f87d49f759282f32a8d1d736aca6512838985091fd40a36bb0c","schema_version":"1.0","event_id":"sha256:c8806016c8a25f87d49f759282f32a8d1d736aca6512838985091fd40a36bb0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YQRD75O467HNRLG2FRVYIUM62J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Binomial American Option Pricing with (and without) Transaction Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.CP"],"primary_cat":"cs.DC","authors_text":"Alet Roux, Nan Zhang, Tomasz Zastawniak","submitted_at":"2011-10-11T19:43:40Z","abstract_excerpt":"We present a parallel algorithm that computes the ask and bid prices of an American option when proportional transaction costs apply to the trading of the underlying asset. The algorithm computes the prices on recombining binomial trees, and is designed for modern multi-core processors. Although parallel option pricing has been well studied, none of the existing approaches takes transaction costs into consideration. The algorithm that we propose partitions a binomial tree into blocks. In any round of computation a block is further partitioned into regions which are assigned to distinct process"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2477","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":""},"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-18T04:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCFUm3dB9Nj2vfnCIAvqY51LrLzOmJbhk6rlVb0vbLwTd5akanZRjvR5VmcV8Mv5rdhVHNO4k21fRZuYbyOFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:22:00.262450Z"},"content_sha256":"4a21ea43c4e28e44a966adf226b02789027b5bf0297fd0c2ec7e0b5ee8376486","schema_version":"1.0","event_id":"sha256:4a21ea43c4e28e44a966adf226b02789027b5bf0297fd0c2ec7e0b5ee8376486"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQRD75O467HNRLG2FRVYIUM62J/bundle.json","state_url":"https://pith.science/pith/YQRD75O467HNRLG2FRVYIUM62J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQRD75O467HNRLG2FRVYIUM62J/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-11T07:22:00Z","links":{"resolver":"https://pith.science/pith/YQRD75O467HNRLG2FRVYIUM62J","bundle":"https://pith.science/pith/YQRD75O467HNRLG2FRVYIUM62J/bundle.json","state":"https://pith.science/pith/YQRD75O467HNRLG2FRVYIUM62J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQRD75O467HNRLG2FRVYIUM62J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YQRD75O467HNRLG2FRVYIUM62J","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":"3ae096a1623048f7faaf74ca7d4be7b83da3d5db1a9a07065a328c14d1af53e6","cross_cats_sorted":["q-fin.CP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-11T19:43:40Z","title_canon_sha256":"1ccc7c171438d33e5c138139ab0ae88d0ca6ed52354625fe64a7d1262224fa4a"},"schema_version":"1.0","source":{"id":"1110.2477","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2477","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2477v1","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2477","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"YQRD75O467HN","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YQRD75O467HNRLG2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YQRD75O4","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:4a21ea43c4e28e44a966adf226b02789027b5bf0297fd0c2ec7e0b5ee8376486","target":"graph","created_at":"2026-05-18T04:11:08Z","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 present a parallel algorithm that computes the ask and bid prices of an American option when proportional transaction costs apply to the trading of the underlying asset. The algorithm computes the prices on recombining binomial trees, and is designed for modern multi-core processors. Although parallel option pricing has been well studied, none of the existing approaches takes transaction costs into consideration. The algorithm that we propose partitions a binomial tree into blocks. In any round of computation a block is further partitioned into regions which are assigned to distinct process","authors_text":"Alet Roux, Nan Zhang, Tomasz Zastawniak","cross_cats":["q-fin.CP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-11T19:43:40Z","title":"Parallel Binomial American Option Pricing with (and without) Transaction Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2477","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:c8806016c8a25f87d49f759282f32a8d1d736aca6512838985091fd40a36bb0c","target":"record","created_at":"2026-05-18T04:11:08Z","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":"3ae096a1623048f7faaf74ca7d4be7b83da3d5db1a9a07065a328c14d1af53e6","cross_cats_sorted":["q-fin.CP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-11T19:43:40Z","title_canon_sha256":"1ccc7c171438d33e5c138139ab0ae88d0ca6ed52354625fe64a7d1262224fa4a"},"schema_version":"1.0","source":{"id":"1110.2477","kind":"arxiv","version":1}},"canonical_sha256":"c4223ff5dcf7ced8acda2c6b84519ed247013ae8d084b53434c61a4ee59ad927","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4223ff5dcf7ced8acda2c6b84519ed247013ae8d084b53434c61a4ee59ad927","first_computed_at":"2026-05-18T04:11:08.961620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:08.961620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EYxxeDMDEx3TWMGNJXeeIWqYlS2jvc2b4BPeYBsdss3SUjX4CaV04B5herxe1JdFnvVDp0p2aNVMPRVjPGR4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:08.962243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2477","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8806016c8a25f87d49f759282f32a8d1d736aca6512838985091fd40a36bb0c","sha256:4a21ea43c4e28e44a966adf226b02789027b5bf0297fd0c2ec7e0b5ee8376486"],"state_sha256":"b28a0c377afc615b2773a513ad0dd783b788354501cbcb0f45cdb305c08c9aa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HE4IeVAGZnGlTsxN/3nau0TwZojfS7bfTm4wYB+XHfJ6WsQthMi+FYw0tHd/tWp3t5Pccj+vmAeWbTNOu2UfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:22:00.266663Z","bundle_sha256":"ec650bf03c70b63674a92c9edb72277d3cec16a4f20ad2d31511f35700e4b77e"}}