Paper Citation Record · LEDGER

Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

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

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

pith.paper-citation-record.v1
2305.14939 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:11:22.380069Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-02T08:06:47.654636Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 94116843-bba6-49b9-a839-192d269fd5bc · inbound

Bias as a Virtue: Rethinking Generalization under Distribution Shifts cites this paper.

Bias as a Virtue: Rethinking Generalization under Distribution Shifts Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T12:11:22.380069Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca50bd44-02a5-4f33-8424-ee4c9125c170 · inbound

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport cites this paper.

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-05-14T22:28:04.031912Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation a507f343-bb2b-4490-b2d5-68b277a4a270 · inbound

Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis cites this paper.

Sharp $O(1/k)$ convergence rate for the Sinkhorn algorithm via a local analysis Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

Reference 64

Resolution: verified exact; arxiv_id, observed 2026-06-30T08:44:27.716153Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

Observation 5e26e19f-d97e-47db-8a41-672dab8ad21e · inbound

Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization cites this paper.

Effective dynamics of the Sinkhorn algorithm in the regime of low entropy regularization Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

Reference 63

Resolution: verified exact; arxiv_id, observed 2026-07-02T08:06:47.655866Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.