{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OX7JP5KZ52ZSQU7WB5DZKVHKIK","short_pith_number":"pith:OX7JP5KZ","canonical_record":{"source":{"id":"1802.08539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-23T14:19:51Z","cross_cats_sorted":["q-fin.MF","stat.ML"],"title_canon_sha256":"2caefa4b8c512a1a34d369cb5b9f62d7200069c6ee89a3fbdd226054cd8b9ee1","abstract_canon_sha256":"654f41ff3debe316e50254fe0bab1d49eea9151401702339d9920693df6ff1be"},"schema_version":"1.0"},"canonical_sha256":"75fe97f559eeb32853f60f479554ea4298e0a9cf7cabce46bbcbf9437e12e5c2","source":{"kind":"arxiv","id":"1802.08539","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08539","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08539v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08539","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"OX7JP5KZ52ZS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OX7JP5KZ52ZSQU7W","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OX7JP5KZ","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OX7JP5KZ52ZSQU7WB5DZKVHKIK","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-23T14:19:51Z","cross_cats_sorted":["q-fin.MF","stat.ML"],"title_canon_sha256":"2caefa4b8c512a1a34d369cb5b9f62d7200069c6ee89a3fbdd226054cd8b9ee1","abstract_canon_sha256":"654f41ff3debe316e50254fe0bab1d49eea9151401702339d9920693df6ff1be"},"schema_version":"1.0"},"canonical_sha256":"75fe97f559eeb32853f60f479554ea4298e0a9cf7cabce46bbcbf9437e12e5c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.551264Z","signature_b64":"rf3ewC5/58lqZ6ofQsO9ohm+qko0m0GM/qUdVKRsy7CA1Kyl/Mv6pLHy/qfEKD+6hDQg/egRtL9fOf8IhdJUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75fe97f559eeb32853f60f479554ea4298e0a9cf7cabce46bbcbf9437e12e5c2","last_reissued_at":"2026-05-17T23:55:34.550669Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.550669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08539","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-05-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUlgIPdFpAU3eFJZeiDuB5ckql2ecQgyqLlFVB6fFsqYa4yJsFeb3hRUAaFHesHTNc7P2jhfOPcCjqAl6JEKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:56:04.608946Z"},"content_sha256":"a5b8c5bb58053ee40a7baaec6c33a451e02fbc41ed5239f5f41e7cb31dd83dfe","schema_version":"1.0","event_id":"sha256:a5b8c5bb58053ee40a7baaec6c33a451e02fbc41ed5239f5f41e7cb31dd83dfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OX7JP5KZ52ZSQU7WB5DZKVHKIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation of optimal transport and related hedging problems via penalization and neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.MF","stat.ML"],"primary_cat":"math.OC","authors_text":"Michael Kupper, Stephan Eckstein","submitted_at":"2018-02-23T14:19:51Z","abstract_excerpt":"This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it to a finite dimensional one which corresponds to optimizing a neural network with smooth objective function. We present numerical examples from optimal transport, martingale optimal transport, portfolio optimization under uncertainty and generative adversarial networks that showcase the generality and effectiveness of the approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08539","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":""},"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-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N761DixPCzMvPQVHiJNvusWzJ1FjOtryaZxhMbtkUjB8mqDTfuQDnPz+97X5bORVuWf9FB6IOxZWD4HL+JBmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:56:04.609615Z"},"content_sha256":"ebe4ec5cd3f30c7c1a7ab30b5a9911dc1bf540dfec3faa80c6c53a59a04d2284","schema_version":"1.0","event_id":"sha256:ebe4ec5cd3f30c7c1a7ab30b5a9911dc1bf540dfec3faa80c6c53a59a04d2284"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OX7JP5KZ52ZSQU7WB5DZKVHKIK/bundle.json","state_url":"https://pith.science/pith/OX7JP5KZ52ZSQU7WB5DZKVHKIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OX7JP5KZ52ZSQU7WB5DZKVHKIK/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-11T23:56:04Z","links":{"resolver":"https://pith.science/pith/OX7JP5KZ52ZSQU7WB5DZKVHKIK","bundle":"https://pith.science/pith/OX7JP5KZ52ZSQU7WB5DZKVHKIK/bundle.json","state":"https://pith.science/pith/OX7JP5KZ52ZSQU7WB5DZKVHKIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OX7JP5KZ52ZSQU7WB5DZKVHKIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OX7JP5KZ52ZSQU7WB5DZKVHKIK","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":"654f41ff3debe316e50254fe0bab1d49eea9151401702339d9920693df6ff1be","cross_cats_sorted":["q-fin.MF","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-23T14:19:51Z","title_canon_sha256":"2caefa4b8c512a1a34d369cb5b9f62d7200069c6ee89a3fbdd226054cd8b9ee1"},"schema_version":"1.0","source":{"id":"1802.08539","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08539","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08539v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08539","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"OX7JP5KZ52ZS","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OX7JP5KZ52ZSQU7W","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OX7JP5KZ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:ebe4ec5cd3f30c7c1a7ab30b5a9911dc1bf540dfec3faa80c6c53a59a04d2284","target":"graph","created_at":"2026-05-17T23:55: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"},"paper":{"abstract_excerpt":"This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it to a finite dimensional one which corresponds to optimizing a neural network with smooth objective function. We present numerical examples from optimal transport, martingale optimal transport, portfolio optimization under uncertainty and generative adversarial networks that showcase the generality and effectiveness of the approach.","authors_text":"Michael Kupper, Stephan Eckstein","cross_cats":["q-fin.MF","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-23T14:19:51Z","title":"Computation of optimal transport and related hedging problems via penalization and neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08539","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:a5b8c5bb58053ee40a7baaec6c33a451e02fbc41ed5239f5f41e7cb31dd83dfe","target":"record","created_at":"2026-05-17T23:55: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":"654f41ff3debe316e50254fe0bab1d49eea9151401702339d9920693df6ff1be","cross_cats_sorted":["q-fin.MF","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-23T14:19:51Z","title_canon_sha256":"2caefa4b8c512a1a34d369cb5b9f62d7200069c6ee89a3fbdd226054cd8b9ee1"},"schema_version":"1.0","source":{"id":"1802.08539","kind":"arxiv","version":2}},"canonical_sha256":"75fe97f559eeb32853f60f479554ea4298e0a9cf7cabce46bbcbf9437e12e5c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75fe97f559eeb32853f60f479554ea4298e0a9cf7cabce46bbcbf9437e12e5c2","first_computed_at":"2026-05-17T23:55:34.550669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:34.550669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rf3ewC5/58lqZ6ofQsO9ohm+qko0m0GM/qUdVKRsy7CA1Kyl/Mv6pLHy/qfEKD+6hDQg/egRtL9fOf8IhdJUCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:34.551264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08539","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5b8c5bb58053ee40a7baaec6c33a451e02fbc41ed5239f5f41e7cb31dd83dfe","sha256:ebe4ec5cd3f30c7c1a7ab30b5a9911dc1bf540dfec3faa80c6c53a59a04d2284"],"state_sha256":"2eac34b6d246d25d41aa1f14a0c5e2dbe57c7b279f0107a0a9da41242d4a962c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qh5OKaVqZ1qn4reAdtQzna+SCcEBuSLByEa98crzGHqE+QJrJRIZtOhN2AhnUfH0eGi03MsGV9v/AxefnxkiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:56:04.613661Z","bundle_sha256":"3c66240f0cd4badbccf80455ca0ac1fc372937a51de0e8d624961765e5045c84"}}