Paper Citation Record · LEDGER

On the sample complexity of entropic optimal transport

As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2206.13472.

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

pith.paper-citation-record.v1
2206.13472 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 8 of 8 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 8 of 8 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T22:40:22.949106Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T19:00:05.197893Z

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 d148b03e-dd44-48cd-b06e-2352b1524d27 · inbound

The ballistic limit of the log-Sobolev constant equals the Polyak-{\L}ojasiewicz constant cites this paper.

The ballistic limit of the log-Sobolev constant equals the Polyak-{\L}ojasiewicz constant On the sample complexity of entropic optimal transport

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-12T18:42:34.033695Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8636d267-cf72-464d-86bc-15e951fc086b · inbound

The entropic optimal (self-)transport problem: Limit distributions for decreasing regularization with application to score function estimation cites this paper.

The entropic optimal (self-)transport problem: Limit distributions for decreasing regularization with application to score function estimation On the sample complexity of entropic optimal transport

Reference 18

Resolution: verified exact; arxiv_id, observed 2026-05-23T06:57:40.336185Z

Source-reported events for the cited work

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

Observation ff7769d2-5357-4bad-8806-73237e4397eb · inbound

Learning from samples: inverse problems over measures cites this paper.

Learning from samples: inverse problems over measures On the sample complexity of entropic optimal transport

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-15T22:40:22.949106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 790c1d88-5a61-468e-9e3a-cd57f048f0c3 · inbound

Distributional Limit Theory for Optimal Transport cites this paper.

Distributional Limit Theory for Optimal Transport On the sample complexity of entropic optimal transport

Reference 100

Resolution: unresolved; no resolver link, observed 2026-08-07T14:27:20.216240Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e102520c-13da-4785-b4bb-a0293b42241f · inbound

Optimal Transport under Group Fairness Constraints cites this paper.

Optimal Transport under Group Fairness Constraints On the sample complexity of entropic optimal transport

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-03T11:18:04.686984Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b6f3ff2c-ba0b-416e-b02d-d3acfa6732d2 · inbound

Curvature of optimal transport with respect to the cost and applications to inverse optimal transport cites this paper.

Curvature of optimal transport with respect to the cost and applications to inverse optimal transport On the sample complexity of entropic optimal transport

Reference 8

Resolution: metadata mismatch; arxiv_id, observed 2026-05-11T19:46:15.614110Z

Source-reported events for the cited work

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

Observation b15cd607-e3f8-49f5-bf73-7d9904ffeefd · inbound

Sample complexity of unbalanced entropic OT cites this paper.

Sample complexity of unbalanced entropic OT On the sample complexity of entropic optimal transport

Reference 19

Resolution: verified exact; arxiv_id, observed 2026-07-04T19:00:05.199253Z

Source-reported events for the cited work

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

Observation 3d2f3075-f2b2-4e7f-9a65-6f1125532e34 · inbound

Computational and Statistical Guarantees of the \textit{c}-Rectified flow cites this paper.

Computational and Statistical Guarantees of the \textit{c}-Rectified flow On the sample complexity of entropic optimal transport

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-04T06:35:56.206526Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.