{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K5W4XDESZ6IHJMJIEDT4JKZI2Y","short_pith_number":"pith:K5W4XDES","schema_version":"1.0","canonical_sha256":"576dcb8c92cf9074b12820e7c4ab28d61c15ac8a8bf13a44725097fa22ff0f88","source":{"kind":"arxiv","id":"2504.16890","version":2},"attestation_state":"computed","paper":{"title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Eric Mazumdar, Franca Hoffmann, Lauren Conger, Ricardo Baptista","submitted_at":"2025-04-23T17:11:34Z","abstract_excerpt":"We pose the Kantorovich optimal transport problem as a min-max problem with a Nash equilibrium that can be obtained dynamically via a two-player game, providing a framework for approximating optimal couplings. We prove convergence of the timescale-separated gradient descent dynamics to the optimal transport plan, and implement the gradient descent algorithm with a particle method, where the marginal constraints are enforced weakly using the KL divergence, automatically selecting a dynamical adaptation of the regularizer. The numerical results highlight the different advantages of using the sta"},"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":"2504.16890","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-04-23T17:11:34Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"12621c68c9a0e7c040bbf65db5d33d3571f88c9fccf20fb698bc0d482db02cc8","abstract_canon_sha256":"50725088dc95b3b974df99375e1d1e5d50208c76e5eb6f0642a57e87403f0e6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:37.659308Z","signature_b64":"gbOxqOBhva9U+fbNVi3prv+kSQA4QIDmwwHnKbhGZQNIo4oj+Ek0ky64trDNV0kdqUEEvt+AvHN181zVwLHKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"576dcb8c92cf9074b12820e7c4ab28d61c15ac8a8bf13a44725097fa22ff0f88","last_reissued_at":"2026-07-05T11:10:37.658825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:37.658825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Optimal Transport Plans via Min-Max Gradient Flows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Eric Mazumdar, Franca Hoffmann, Lauren Conger, Ricardo Baptista","submitted_at":"2025-04-23T17:11:34Z","abstract_excerpt":"We pose the Kantorovich optimal transport problem as a min-max problem with a Nash equilibrium that can be obtained dynamically via a two-player game, providing a framework for approximating optimal couplings. We prove convergence of the timescale-separated gradient descent dynamics to the optimal transport plan, and implement the gradient descent algorithm with a particle method, where the marginal constraints are enforced weakly using the KL divergence, automatically selecting a dynamical adaptation of the regularizer. The numerical results highlight the different advantages of using the sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16890","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/2504.16890/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":"2504.16890","created_at":"2026-07-05T11:10:37.658882+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16890v2","created_at":"2026-07-05T11:10:37.658882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16890","created_at":"2026-07-05T11:10:37.658882+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5W4XDESZ6IH","created_at":"2026-07-05T11:10:37.658882+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5W4XDESZ6IHJMJI","created_at":"2026-07-05T11:10:37.658882+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5W4XDES","created_at":"2026-07-05T11:10:37.658882+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/K5W4XDESZ6IHJMJIEDT4JKZI2Y","json":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y.json","graph_json":"https://pith.science/api/pith-number/K5W4XDESZ6IHJMJIEDT4JKZI2Y/graph.json","events_json":"https://pith.science/api/pith-number/K5W4XDESZ6IHJMJIEDT4JKZI2Y/events.json","paper":"https://pith.science/paper/K5W4XDES"},"agent_actions":{"view_html":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y","download_json":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y.json","view_paper":"https://pith.science/paper/K5W4XDES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16890&json=true","fetch_graph":"https://pith.science/api/pith-number/K5W4XDESZ6IHJMJIEDT4JKZI2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/K5W4XDESZ6IHJMJIEDT4JKZI2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y/action/storage_attestation","attest_author":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y/action/author_attestation","sign_citation":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y/action/citation_signature","submit_replication":"https://pith.science/pith/K5W4XDESZ6IHJMJIEDT4JKZI2Y/action/replication_record"}},"created_at":"2026-07-05T11:10:37.658882+00:00","updated_at":"2026-07-05T11:10:37.658882+00:00"}