{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4TIRLT65RADFDDRNKNB334NBTA","short_pith_number":"pith:4TIRLT65","schema_version":"1.0","canonical_sha256":"e4d115cfdd8806518e2d5343bdf1a198365cf47e82205626fc69c6405cbfa41c","source":{"kind":"arxiv","id":"2508.17641","version":1},"attestation_state":"computed","paper":{"title":"An efficient algorithm for entropic optimal transport under martingale-type constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Holakou Rahmanian, Lexing Ying, Michael Shavlovsky, Tesi Xiao, Xun Tang","submitted_at":"2025-08-25T04:07:40Z","abstract_excerpt":"This work introduces novel computational methods for entropic optimal transport (OT) problems under martingale-type conditions. The considered problems include the discrete martingale optimal transport (MOT) problem. Moreover, as the (super-)martingale conditions are equivalent to row-wise (in-)equality constraints on the coupling matrix, our work applies to a prevalent class of OT problems with structural constraints. Inspired by the recent empirical success of Sinkhorn-type algorithms, we propose an entropic formulation for the MOT problem and introduce Sinkhorn-type algorithms with sparse N"},"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":"2508.17641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-08-25T04:07:40Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"db035fc436956745d5eb17ff5b39cebe88094e4bf3838d031546c3657eb6e0a2","abstract_canon_sha256":"228f155aab6ea078c8651b9e0ef160feeacaf69b8256e7f4dbc752214208cefd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:45.074916Z","signature_b64":"kxb3KhRhMo/mi1oqnPYG//obNVdQgrGpvH6OtL9RQSlb2kxApPEi8wxHIrPLJHj/OOzvcizZ0Egsog3vW5RGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d115cfdd8806518e2d5343bdf1a198365cf47e82205626fc69c6405cbfa41c","last_reissued_at":"2026-07-05T11:58:45.074441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:45.074441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient algorithm for entropic optimal transport under martingale-type constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Holakou Rahmanian, Lexing Ying, Michael Shavlovsky, Tesi Xiao, Xun Tang","submitted_at":"2025-08-25T04:07:40Z","abstract_excerpt":"This work introduces novel computational methods for entropic optimal transport (OT) problems under martingale-type conditions. The considered problems include the discrete martingale optimal transport (MOT) problem. Moreover, as the (super-)martingale conditions are equivalent to row-wise (in-)equality constraints on the coupling matrix, our work applies to a prevalent class of OT problems with structural constraints. Inspired by the recent empirical success of Sinkhorn-type algorithms, we propose an entropic formulation for the MOT problem and introduce Sinkhorn-type algorithms with sparse N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.17641","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.17641/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.17641","created_at":"2026-07-05T11:58:45.074486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.17641v1","created_at":"2026-07-05T11:58:45.074486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.17641","created_at":"2026-07-05T11:58:45.074486+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TIRLT65RADF","created_at":"2026-07-05T11:58:45.074486+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TIRLT65RADFDDRN","created_at":"2026-07-05T11:58:45.074486+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TIRLT65","created_at":"2026-07-05T11:58:45.074486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA","json":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA.json","graph_json":"https://pith.science/api/pith-number/4TIRLT65RADFDDRNKNB334NBTA/graph.json","events_json":"https://pith.science/api/pith-number/4TIRLT65RADFDDRNKNB334NBTA/events.json","paper":"https://pith.science/paper/4TIRLT65"},"agent_actions":{"view_html":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA","download_json":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA.json","view_paper":"https://pith.science/paper/4TIRLT65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.17641&json=true","fetch_graph":"https://pith.science/api/pith-number/4TIRLT65RADFDDRNKNB334NBTA/graph.json","fetch_events":"https://pith.science/api/pith-number/4TIRLT65RADFDDRNKNB334NBTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA/action/storage_attestation","attest_author":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA/action/author_attestation","sign_citation":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA/action/citation_signature","submit_replication":"https://pith.science/pith/4TIRLT65RADFDDRNKNB334NBTA/action/replication_record"}},"created_at":"2026-07-05T11:58:45.074486+00:00","updated_at":"2026-07-05T11:58:45.074486+00:00"}