{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UQVT3HZLBAMVGZK2DVS2OB72KV","short_pith_number":"pith:UQVT3HZL","schema_version":"1.0","canonical_sha256":"a42b3d9f2b081953655a1d65a707fa5563211d5eddb51c5c6f9b62b871209890","source":{"kind":"arxiv","id":"1812.11104","version":1},"attestation_state":"computed","paper":{"title":"Entropic approximation for multi-dimensional martingale optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Hadrien De March","submitted_at":"2018-12-28T16:40:22Z","abstract_excerpt":"We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we check that this algorithm performs better through numerical experiments. We also give a simple way to deal with the absence of convex ordering among the marginals. Furthermore, we provide a new universal bound on the error linked to entropy."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1812.11104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-28T16:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"bb6b54c21edbaf9d4028f53a2348d035255e1f07a05584ea88ede4d77a6b169b","abstract_canon_sha256":"ac1bcd721216519044c8da73ac9a6fb2c219fa3c0be77f1c6f86794b62dffcd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:16.322556Z","signature_b64":"+YTaluvvGGQ+guNYSF4/F31YyDs++MHkR09Ck80CxJcvzEfsVzpcvZOsuVGtAd1JapZK9EA4BQZIys8gEMYHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a42b3d9f2b081953655a1d65a707fa5563211d5eddb51c5c6f9b62b871209890","last_reissued_at":"2026-05-17T23:57:16.322199Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:16.322199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropic approximation for multi-dimensional martingale optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Hadrien De March","submitted_at":"2018-12-28T16:40:22Z","abstract_excerpt":"We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we check that this algorithm performs better through numerical experiments. We also give a simple way to deal with the absence of convex ordering among the marginals. Furthermore, we provide a new universal bound on the error linked to entropy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11104","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.11104","created_at":"2026-05-17T23:57:16.322259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.11104v1","created_at":"2026-05-17T23:57:16.322259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11104","created_at":"2026-05-17T23:57:16.322259+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQVT3HZLBAMV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQVT3HZLBAMVGZK2","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQVT3HZL","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09513","citing_title":"Faster Algorithms for Multimarginal Optimal Transport","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV","json":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV.json","graph_json":"https://pith.science/api/pith-number/UQVT3HZLBAMVGZK2DVS2OB72KV/graph.json","events_json":"https://pith.science/api/pith-number/UQVT3HZLBAMVGZK2DVS2OB72KV/events.json","paper":"https://pith.science/paper/UQVT3HZL"},"agent_actions":{"view_html":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV","download_json":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV.json","view_paper":"https://pith.science/paper/UQVT3HZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.11104&json=true","fetch_graph":"https://pith.science/api/pith-number/UQVT3HZLBAMVGZK2DVS2OB72KV/graph.json","fetch_events":"https://pith.science/api/pith-number/UQVT3HZLBAMVGZK2DVS2OB72KV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV/action/storage_attestation","attest_author":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV/action/author_attestation","sign_citation":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV/action/citation_signature","submit_replication":"https://pith.science/pith/UQVT3HZLBAMVGZK2DVS2OB72KV/action/replication_record"}},"created_at":"2026-05-17T23:57:16.322259+00:00","updated_at":"2026-05-17T23:57:16.322259+00:00"}