Pith. sign in

Paper Citation Record · LEDGER

Computing Optimal Transport Plans via Min-Max Gradient Flows

As of 21 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-20T06:33:59.587034+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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T11:02:24.331966Z digest=sha256:201d8eecf723b7221b252657ad00e2b708d5e2e1647d55dcfbc63f8b1105a835

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T11:02:24.335573Z digest=sha256:103f723ff6560b9eb0cb4132fced18a3d3fafff3dd4330a12c6e1a5960596ca9

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:0af5eb905340098592fd0bc952be3d0e0b3608ddb8db7970a1d4ad6eaf66083e

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T11:02:24.363929Z digest=sha256:3a9965b3c2db203cc16940e9caa2a8cb4701e326e13d271761527d32883d8c9b

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T11:02:24.381477Z digest=sha256:65105a97a067c4182419ed959c71af92eb3011b29e53c35d9a4faa647bae649a

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T11:02:24.384857Z digest=sha256:5c86067bc23ba0e08d7ec17316273d667309ee9028a63d4bc7e9fcf75f724f53

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-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T11:02:24.388699Z digest=sha256:94fe826a866b70c9ccebf38e7a5a026f8518028d6ab547b5c697ce6aa429bf07

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-20T06:33:59.587034+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.