{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:KBA6T3PTNPMUEKRHXBCBM7IN66","short_pith_number":"pith:KBA6T3PT","canonical_record":{"source":{"id":"math/0302243","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2003-02-19T22:13:08Z","cross_cats_sorted":["math.PR","q-fin.ST"],"title_canon_sha256":"7da7643cdaaa7d190b79383fb61128db793fa05cc76403026b9e79fc2dabb4c2","abstract_canon_sha256":"0d81a117a6dc3db0727b253c58b99841f27df90939e8a3bf78e9ae9541a7bac5"},"schema_version":"1.0"},"canonical_sha256":"5041e9edf36bd9422a27b844167d0df7b6f823f0906b177d54dd657ed1074d74","source":{"kind":"arxiv","id":"math/0302243","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0302243","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"math/0302243v2","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0302243","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"KBA6T3PTNPMU","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"pith_short_16","alias_value":"KBA6T3PTNPMUEKRH","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"pith_short_8","alias_value":"KBA6T3PT","created_at":"2026-07-04T15:33:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:KBA6T3PTNPMUEKRHXBCBM7IN66","target":"record","payload":{"canonical_record":{"source":{"id":"math/0302243","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2003-02-19T22:13:08Z","cross_cats_sorted":["math.PR","q-fin.ST"],"title_canon_sha256":"7da7643cdaaa7d190b79383fb61128db793fa05cc76403026b9e79fc2dabb4c2","abstract_canon_sha256":"0d81a117a6dc3db0727b253c58b99841f27df90939e8a3bf78e9ae9541a7bac5"},"schema_version":"1.0"},"canonical_sha256":"5041e9edf36bd9422a27b844167d0df7b6f823f0906b177d54dd657ed1074d74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:33:34.169711Z","signature_b64":"Bg0j5nJYvkvcgVTugeqT0JVJuES663C9wtDsANcLRUfgzooYksCYxyxAIQ/YaSfj6q6ODL5qGBmwL5jM000LDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5041e9edf36bd9422a27b844167d0df7b6f823f0906b177d54dd657ed1074d74","last_reissued_at":"2026-07-04T15:33:34.169345Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:33:34.169345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0302243","source_version":2,"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-04T15:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eod/Pi9y98vI+LM9m0J+JrAN2QDjBjymhR6DAwvhbD3qjr4ofgNJFsAWWSmRzUmeTpHh3ZPJATyxGoQYKWtZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:58:13.513502Z"},"content_sha256":"683e94b2622bd39d2ac124f7d66abc67cc34eb5e71916986757a487550a58ff1","schema_version":"1.0","event_id":"sha256:683e94b2622bd39d2ac124f7d66abc67cc34eb5e71916986757a487550a58ff1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:KBA6T3PTNPMUEKRHXBCBM7IN66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Static Arbitrage Bounds on Basket Option Prices","license":"","headline":"","cross_cats":["math.PR","q-fin.ST"],"primary_cat":"math.OC","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui","submitted_at":"2003-02-19T22:13:08Z","abstract_excerpt":"We consider the problem of computing upper and lower bounds on the price of a European basket call option, given prices on other similar baskets. Although this problem is very hard to solve exactly in the general case, we show that in some instances the upper and lower bounds can be computed via simple closed-form expressions, or linear programs. We also introduce an efficient linear programming relaxation of the general problem based on an integral transform interpretation of the call price function. We show that this relaxation is tight in some of the special cases examined before."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0302243","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0302243/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-04T15:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PUGpKiPcZow6L/Oi2BuUuQ1FomvXOYa8rQZmdrYFDyjjKCDfdXp8BKhN26y3XU/Yeb7k+NxDIfDw+PYJ2nSJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:58:13.514044Z"},"content_sha256":"96f16d8cbd5b195f7ee51be651cb2802196ec8064c25c31b1e2da00ef4002d2f","schema_version":"1.0","event_id":"sha256:96f16d8cbd5b195f7ee51be651cb2802196ec8064c25c31b1e2da00ef4002d2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBA6T3PTNPMUEKRHXBCBM7IN66/bundle.json","state_url":"https://pith.science/pith/KBA6T3PTNPMUEKRHXBCBM7IN66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBA6T3PTNPMUEKRHXBCBM7IN66/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-06T01:58:13Z","links":{"resolver":"https://pith.science/pith/KBA6T3PTNPMUEKRHXBCBM7IN66","bundle":"https://pith.science/pith/KBA6T3PTNPMUEKRHXBCBM7IN66/bundle.json","state":"https://pith.science/pith/KBA6T3PTNPMUEKRHXBCBM7IN66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBA6T3PTNPMUEKRHXBCBM7IN66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:KBA6T3PTNPMUEKRHXBCBM7IN66","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":"0d81a117a6dc3db0727b253c58b99841f27df90939e8a3bf78e9ae9541a7bac5","cross_cats_sorted":["math.PR","q-fin.ST"],"license":"","primary_cat":"math.OC","submitted_at":"2003-02-19T22:13:08Z","title_canon_sha256":"7da7643cdaaa7d190b79383fb61128db793fa05cc76403026b9e79fc2dabb4c2"},"schema_version":"1.0","source":{"id":"math/0302243","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0302243","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"math/0302243v2","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0302243","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"KBA6T3PTNPMU","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"pith_short_16","alias_value":"KBA6T3PTNPMUEKRH","created_at":"2026-07-04T15:33:34Z"},{"alias_kind":"pith_short_8","alias_value":"KBA6T3PT","created_at":"2026-07-04T15:33:34Z"}],"graph_snapshots":[{"event_id":"sha256:96f16d8cbd5b195f7ee51be651cb2802196ec8064c25c31b1e2da00ef4002d2f","target":"graph","created_at":"2026-07-04T15:33:34Z","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/math/0302243/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of computing upper and lower bounds on the price of a European basket call option, given prices on other similar baskets. Although this problem is very hard to solve exactly in the general case, we show that in some instances the upper and lower bounds can be computed via simple closed-form expressions, or linear programs. We also introduce an efficient linear programming relaxation of the general problem based on an integral transform interpretation of the call price function. We show that this relaxation is tight in some of the special cases examined before.","authors_text":"Alexandre d'Aspremont, Laurent El Ghaoui","cross_cats":["math.PR","q-fin.ST"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2003-02-19T22:13:08Z","title":"Static Arbitrage Bounds on Basket Option Prices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0302243","kind":"arxiv","version":2},"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:683e94b2622bd39d2ac124f7d66abc67cc34eb5e71916986757a487550a58ff1","target":"record","created_at":"2026-07-04T15:33:34Z","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":"0d81a117a6dc3db0727b253c58b99841f27df90939e8a3bf78e9ae9541a7bac5","cross_cats_sorted":["math.PR","q-fin.ST"],"license":"","primary_cat":"math.OC","submitted_at":"2003-02-19T22:13:08Z","title_canon_sha256":"7da7643cdaaa7d190b79383fb61128db793fa05cc76403026b9e79fc2dabb4c2"},"schema_version":"1.0","source":{"id":"math/0302243","kind":"arxiv","version":2}},"canonical_sha256":"5041e9edf36bd9422a27b844167d0df7b6f823f0906b177d54dd657ed1074d74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5041e9edf36bd9422a27b844167d0df7b6f823f0906b177d54dd657ed1074d74","first_computed_at":"2026-07-04T15:33:34.169345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:33:34.169345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bg0j5nJYvkvcgVTugeqT0JVJuES663C9wtDsANcLRUfgzooYksCYxyxAIQ/YaSfj6q6ODL5qGBmwL5jM000LDw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:33:34.169711Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0302243","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:683e94b2622bd39d2ac124f7d66abc67cc34eb5e71916986757a487550a58ff1","sha256:96f16d8cbd5b195f7ee51be651cb2802196ec8064c25c31b1e2da00ef4002d2f"],"state_sha256":"05bee170010e6ad3c6b5f4c24a6de21932f0fd5881a64cba820ab583b97153c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPTDfj5KWx06SHA48T2XaiHQbjG/+R6vqpWa/JRsgQqkBDMlAtz8kKh/z9TuRE+wbjg6RyIcgKH6UBkpa1anAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:58:13.526777Z","bundle_sha256":"6622e6be89eb8fb8f526088a17a17c64dd57b76f678fe4b7f5639d4b64121324"}}