{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ESBLIE6WBRGCDRJCD5FY3PWP7V","short_pith_number":"pith:ESBLIE6W","canonical_record":{"source":{"id":"1710.07911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-22T09:07:51Z","cross_cats_sorted":["math.OC","q-fin.CP"],"title_canon_sha256":"ee7239693351195dd01dbb927f808c9b9315cfcb76b45c5ef5b8ba5c68433672","abstract_canon_sha256":"87c46b2a2e2b97f9e02145aaa5d871a05a3f9d1adf281edd9b05744905f7b272"},"schema_version":"1.0"},"canonical_sha256":"2482b413d60c4c21c5221f4b8dbecffd5e4ed0e627531f29c6ab5da0f248e4b9","source":{"kind":"arxiv","id":"1710.07911","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07911","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07911v2","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07911","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"ESBLIE6WBRGC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ESBLIE6WBRGCDRJC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ESBLIE6W","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ESBLIE6WBRGCDRJCD5FY3PWP7V","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-22T09:07:51Z","cross_cats_sorted":["math.OC","q-fin.CP"],"title_canon_sha256":"ee7239693351195dd01dbb927f808c9b9315cfcb76b45c5ef5b8ba5c68433672","abstract_canon_sha256":"87c46b2a2e2b97f9e02145aaa5d871a05a3f9d1adf281edd9b05744905f7b272"},"schema_version":"1.0"},"canonical_sha256":"2482b413d60c4c21c5221f4b8dbecffd5e4ed0e627531f29c6ab5da0f248e4b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.700069Z","signature_b64":"jI+Ys/Zm6PcV8lTAOXw3lmJVQ1AgVZ1TaXRZRtWNKaNEEykqrk/wYVe5QLJ67PU/YrnmTg2udSUk7NxxksEmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2482b413d60c4c21c5221f4b8dbecffd5e4ed0e627531f29c6ab5da0f248e4b9","last_reissued_at":"2026-05-17T23:49:22.699526Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.699526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07911","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:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ndY3ZDX2FIA046zRpZ6HRkmDZWhriT3lXRf8y5NgOlU0uFaFLYqRIbvtseQ8kcmHwYNKeyniiOu6bxYPKnyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:40:19.400289Z"},"content_sha256":"11644e00118cab8c279cd4d1bb064b9d627cb30302256c2b283f95a3931a4c41","schema_version":"1.0","event_id":"sha256:11644e00118cab8c279cd4d1bb064b9d627cb30302256c2b283f95a3931a4c41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ESBLIE6WBRGCDRJCD5FY3PWP7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Methods for Martingale Optimal Transport problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","q-fin.CP"],"primary_cat":"math.PR","authors_text":"Gaoyue Guo, Jan Obloj","submitted_at":"2017-10-22T09:07:51Z","abstract_excerpt":"We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be approximated using linear programming (LP) problems which result from a discretisation of the marginal distributions combined with a suitable relaxation of the martingale constraint. Specialising to dimension one, we provide bounds on the convergence rate of the above scheme. We also show a stability result under only partial specification of the marginal dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07911","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:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1NYW69f12Ky7j11TSoKm5Qu7uJ4FP+2hKoHt7bfJoFI7GuDBEM7mdQNBf7eSYmqdF1vZLYRZFbwkjAytWajaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:40:19.401009Z"},"content_sha256":"668a3c00f17ed57a53e821a55502fc72d29f2b8d1115cf746b13cd4cbb8cd2cb","schema_version":"1.0","event_id":"sha256:668a3c00f17ed57a53e821a55502fc72d29f2b8d1115cf746b13cd4cbb8cd2cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESBLIE6WBRGCDRJCD5FY3PWP7V/bundle.json","state_url":"https://pith.science/pith/ESBLIE6WBRGCDRJCD5FY3PWP7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESBLIE6WBRGCDRJCD5FY3PWP7V/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-05-30T02:40:19Z","links":{"resolver":"https://pith.science/pith/ESBLIE6WBRGCDRJCD5FY3PWP7V","bundle":"https://pith.science/pith/ESBLIE6WBRGCDRJCD5FY3PWP7V/bundle.json","state":"https://pith.science/pith/ESBLIE6WBRGCDRJCD5FY3PWP7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESBLIE6WBRGCDRJCD5FY3PWP7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ESBLIE6WBRGCDRJCD5FY3PWP7V","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":"87c46b2a2e2b97f9e02145aaa5d871a05a3f9d1adf281edd9b05744905f7b272","cross_cats_sorted":["math.OC","q-fin.CP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-22T09:07:51Z","title_canon_sha256":"ee7239693351195dd01dbb927f808c9b9315cfcb76b45c5ef5b8ba5c68433672"},"schema_version":"1.0","source":{"id":"1710.07911","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07911","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07911v2","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07911","created_at":"2026-05-17T23:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"ESBLIE6WBRGC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ESBLIE6WBRGCDRJC","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ESBLIE6W","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:668a3c00f17ed57a53e821a55502fc72d29f2b8d1115cf746b13cd4cbb8cd2cb","target":"graph","created_at":"2026-05-17T23:49:22Z","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 establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be approximated using linear programming (LP) problems which result from a discretisation of the marginal distributions combined with a suitable relaxation of the martingale constraint. Specialising to dimension one, we provide bounds on the convergence rate of the above scheme. We also show a stability result under only partial specification of the marginal dist","authors_text":"Gaoyue Guo, Jan Obloj","cross_cats":["math.OC","q-fin.CP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-22T09:07:51Z","title":"Computational Methods for Martingale Optimal Transport problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07911","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:11644e00118cab8c279cd4d1bb064b9d627cb30302256c2b283f95a3931a4c41","target":"record","created_at":"2026-05-17T23:49:22Z","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":"87c46b2a2e2b97f9e02145aaa5d871a05a3f9d1adf281edd9b05744905f7b272","cross_cats_sorted":["math.OC","q-fin.CP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-22T09:07:51Z","title_canon_sha256":"ee7239693351195dd01dbb927f808c9b9315cfcb76b45c5ef5b8ba5c68433672"},"schema_version":"1.0","source":{"id":"1710.07911","kind":"arxiv","version":2}},"canonical_sha256":"2482b413d60c4c21c5221f4b8dbecffd5e4ed0e627531f29c6ab5da0f248e4b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2482b413d60c4c21c5221f4b8dbecffd5e4ed0e627531f29c6ab5da0f248e4b9","first_computed_at":"2026-05-17T23:49:22.699526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:22.699526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jI+Ys/Zm6PcV8lTAOXw3lmJVQ1AgVZ1TaXRZRtWNKaNEEykqrk/wYVe5QLJ67PU/YrnmTg2udSUk7NxxksEmDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:22.700069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07911","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11644e00118cab8c279cd4d1bb064b9d627cb30302256c2b283f95a3931a4c41","sha256:668a3c00f17ed57a53e821a55502fc72d29f2b8d1115cf746b13cd4cbb8cd2cb"],"state_sha256":"a3125177cfa49ceff6f8e6dc5dbee538ed4000db94b5b32c0a2a35f95aba8ecc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RnGKcfDKm4vyL7Msy5M3vAwWZqOG7EWwXOfUlpDrKJ2H45QiDhyxZsiptBY00E1VF56+PhYWsdh+DR+SYZEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:40:19.404666Z","bundle_sha256":"c3c9cf1419dc55b3aa75b1af2eebc007f63053853cd5f9bbf9559d1330c3e51d"}}