Pith. sign in

Paper Citation Record · LEDGER

Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients

As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2307.08507.

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

pith.paper-citation-record.v1
2307.08507 v4

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T17:04:35.107120Z

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.616027Z

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 930f020b-8c55-4ce3-a227-d8ac2c99e4af · inbound

An efficient algorithm for entropic optimal transport under martingale-type constraints cites this paper.

An efficient algorithm for entropic optimal transport under martingale-type constraints Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-15T17:04:35.107120Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-15T17:04:35.107120Z digest=sha256:242672ca6295188c4b7d6a1407365d71fa532a31d772e80a642537925e8a80d3

Observation 15d560c9-4570-484e-ac85-075a1a73b183 · 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 Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients

Reference 47

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

Source-reported events for the cited work

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

source=arxiv_source observed=2026-06-30T08:38:03.985543Z digest=sha256:868e8f2eae1b05561cb3f33d742671e2e2197b8b56d296f736b8168ab41982be

Observation 1390d9cb-82a9-4669-8126-f53ab1eba961 · 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 Efficient and Accurate Optimal Transport with Mirror Descent and Conjugate Gradients

Reference 46

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

Source-reported events for the cited work

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

source=arxiv_source observed=2026-07-02T08:05:55.418491Z digest=sha256:51c2de21a6645534b2c7895bcee21847982c0a72d00c94e02fd0f4c31167c613