Pith. sign in

Paper Citation Record · LEDGER

Computing Optimal Transport Plans via Min-Max Gradient Flows

As of 18 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2504.16890.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2504.16890 v2

Coverage vector

measured 22 of 22 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:02:24.392036Z

measured 22 of 22 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

22 of 22 outbound references displayed

  • verified exact1
  • verified fuzzy9
  • unresolved12
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 945aa80f-c799-435c-b241-07f1f45ae3b1 · outbound

This paper cites Altschuler, J.

Computing Optimal Transport Plans via Min-Max Gradient Flows Altschuler, J

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.658474Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.316660Z digest=sha256:eb1f6bc7bf404427e6c10b31192f0a57803b45ddda358a4415e42686a45762d3

Observation 1674fbd8-916d-4b95-b519-be8522e8453c · outbound

This paper cites Ambrosio, N.

Computing Optimal Transport Plans via Min-Max Gradient Flows Ambrosio, N

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.647903Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.320778Z digest=sha256:cf6e9baf52454e237308da2f52156048ad01096acafbf7e49ca1b71a7e6dfdf9

Observation 5f21d23d-810b-4271-8225-1ed93fee884a · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.637259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.324405Z digest=sha256:cba5c345f240710ab403170628834f9d876692d941bb7de081212fb1908b98f0

Observation 14afc683-0662-4f17-9a60-7ae39abb0062 · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.625910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.327852Z digest=sha256:80692dc59b56bc501b86d9754937068963dfc8657be8b459f6c44b3b1c825604

Observation 76cb38c8-09a8-4c83-a583-17cdbe233f55 · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 5

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.614266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.331966Z digest=sha256:50a5d59868afd92cef009791d3bae01c06d83267bbef5710e39bc8dac3b13b29

Observation 48c3c701-d03d-4383-9218-19595ba89719 · outbound

This paper cites Cavagnari, G.

Computing Optimal Transport Plans via Min-Max Gradient Flows Cavagnari, G

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.603275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.335573Z digest=sha256:446593612be18b4cc113c114c51e78f6277d6a54d5d89efe17bea1b00861f1d5

Observation f313388a-2f61-4051-b7ad-6766b1723dbf · outbound

This paper cites Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings.

Computing Optimal Transport Plans via Min-Max Gradient Flows Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-16T11:02:24.339976Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T11:02:24.339976Z digest=sha256:cf0a45d0d47edccc2de4013f109cce42c4c1827bfdb14a51755c77f31d5399dc

Observation 7afcb653-9680-49f0-bf81-cfeb42474734 · outbound

This paper cites Coupled Wasserstein Gradient Flows for Min-Max and Cooperative Games.

Computing Optimal Transport Plans via Min-Max Gradient Flows Coupled Wasserstein Gradient Flows for Min-Max and Cooperative Games

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-16T11:02:24.343706Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T11:02:24.343706Z digest=sha256:5d37f474812cf13299ba13309f5d9a5d3f0cc507618b9c45b10ef16bb9b0269a

Observation e09a167c-58bf-46e1-aa71-61fe2e0dd92e · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.591928Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.347421Z digest=sha256:d3b70c6b41d5bbb80f5dbfdc5bb23ab98f61698b816b8702aef35cf12389bf2b

Observation a2255f66-f05c-4b88-b05e-86991fb1c5e6 · outbound

This paper cites Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm.

Computing Optimal Transport Plans via Min-Max Gradient Flows Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-16T11:02:24.350663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T11:02:24.350663Z digest=sha256:e2b53df316f402af505e9818371dfcb40d356d7810b16eaafc67d160c09a8f64

Observation 2e77e7f9-96de-49d8-a20a-f4d24d224f49 · outbound

This paper cites Feinberg, P.

Computing Optimal Transport Plans via Min-Max Gradient Flows Feinberg, P

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.581358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.354124Z digest=sha256:e5ba098d745806470631de716f8debf949a79a24c6e0754ec2cf5bcb99f323d6

Observation e78e4897-6d9b-460d-90f6-9f3e37af938f · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 12

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.569277Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.357018Z digest=sha256:0f53e24c62a50aea56d865440b4b30fd5f1f461e15897aa25489867897b7a9d8

Observation b06dbf51-a307-4bc4-87e2-f0f58dea2f6a · outbound

This paper cites Korotin, V.

Computing Optimal Transport Plans via Min-Max Gradient Flows Korotin, V

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.558812Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.360532Z digest=sha256:5c900d67e8701d2c1ac9a4b025989349eda7ada135febc17115fd81cc7115a68

Observation 2cf70743-8e2f-496f-829f-ac3824ed9d93 · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 14

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.549013Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.363929Z digest=sha256:5e22c1321fa86bcd4022306000a84bc96ec9ea9d98eb48238914c535540e1902

Observation 12b072a4-3a53-4fc2-8f7b-51a8d0f2e8e1 · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 15

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.536611Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.367440Z digest=sha256:91f5dc7e18ba9bbd54a61e6bedc3dd56ca0dce6e00e66e41c284da8fcafadd60

Observation 3589b455-68dc-45fb-bacf-5ba7caee8703 · outbound

This paper cites Approximating the Optimal Transport Plan via Particle-Evolving Method.

Computing Optimal Transport Plans via Min-Max Gradient Flows Approximating the Optimal Transport Plan via Particle-Evolving Method

Reference 16

Resolution
verified exact
local_arxiv, observed 2026-08-16T11:02:24.428093Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.370728Z digest=sha256:cb89e2a9da9d6271058d28defb65d57499d692cd65e39d32ad2f9811e6ecb35c

Observation 4b3ce72e-5211-4a9a-9424-cdb3a5541049 · outbound

This paper cites Pandolfi, L.

Computing Optimal Transport Plans via Min-Max Gradient Flows Pandolfi, L

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.524368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.374414Z digest=sha256:27bdf0ee48daf3ba15a036ab600ed146091729e1c51bbc86b9cdc62e194de386

Observation 9edb1b83-539d-420a-80d6-654f175acb93 · outbound

This paper cites SIAM Journal on Imaging Sciences, 7(1):212–238, Jan.

Computing Optimal Transport Plans via Min-Max Gradient Flows SIAM Journal on Imaging Sciences, 7(1):212–238, Jan

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.512929Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.377716Z digest=sha256:0f4e87d29e6ad576d7ee649e8998e34e546b2e3219ba3a90b36aead5fbd39bad

Observation 09db6444-1f50-48cd-9bf1-701df4bfd682 · outbound

This paper cites Sanz-Alonso, A.

Computing Optimal Transport Plans via Min-Max Gradient Flows Sanz-Alonso, A

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.501677Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.381477Z digest=sha256:1ceb337055332bee359026a65b116402510220abefd4a47eda41cbe9c62a0f03

Observation 22482745-59f8-4bc6-8014-fc11498addf5 · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 20

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.490326Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.384857Z digest=sha256:4acb5263f4b4854147b961939422c04571b49d1e24b312a943621f5f111b7e22

Observation e642d11b-6005-4468-a186-2ff8a59f1918 · outbound

This paper cites Seguy, B.

Computing Optimal Transport Plans via Min-Max Gradient Flows Seguy, B

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-16T11:02:24.479307Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.388699Z digest=sha256:318a8e6810581cc31594d9527dbf0ea99b0d5c3ca18f659bdf27ba9e17c82fd7

Observation 58e2bbcf-016e-4b4e-b4d7-54e5f58c798b · outbound

This paper cites an unresolved cited work.

Computing Optimal Transport Plans via Min-Max Gradient Flows Unresolved cited work

Reference 22

Resolution
unresolved
raw_fallback, observed 2026-08-16T11:02:24.469379Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-16T11:02:24.392036Z digest=sha256:9e7d82593ac421054328b61678c5c109004e2c440e72aec0538395543b888e1f

Pith citing papers

No inbound Pith citation observations are available.