Pith. sign in

Paper Citation Record · LEDGER

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space

As of 15 August 2026, this Paper Citation Record lists 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:2511.11359.

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

pith.paper-citation-record.v1
2511.11359 v4

Coverage vector

measured 7 of 7 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-17T22:21:39.988265Z

measured 7 of 7 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+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

7 of 7 outbound references displayed

  • verified exact1
  • verified fuzzy5
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d95ae306-25b7-48f5-b214-88870a07f7fc · outbound

This paper cites Semi- Streaming Bipartite Matching in Fewer Passes and Optimal Space.

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space Semi- Streaming Bipartite Matching in Fewer Passes and Optimal Space

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T22:22:09.262662Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T22:21:39.988265Z digest=sha256:4184e813e62c2b7243e51fc84adef202da2c74c5a5301d3b044eba039f85b352

Observation 15fc5a16-136b-474f-b32e-930b949c26b2 · outbound

This paper cites Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions.

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space Flows, Scaling, and Entropy Revisited: a Unified Perspective via Optimizing Joint Distributions

Reference 2

Resolution
verified exact
arxiv_id, observed 2026-05-17T22:22:08.931971Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T22:21:39.988265Z digest=sha256:9c7f27fa6c7562e493d9d7494e5f79103b65a4beb65d5997fdc29feb808f07e9

Observation b0cb2934-bc80-4ba1-8f1c-460e609e4fe3 · outbound

This paper cites Springer Nature Switzerland, Cham.

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space Springer Nature Switzerland, Cham

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T22:22:09.252469Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T22:21:39.988265Z digest=sha256:a96d45fafe958900fb02f9c52f7026bebde41ce5ce37a08374ca3a8dd791c38e

Observation 0facf310-10e6-48d7-8e94-a4c85286bc08 · outbound

This paper cites Fast algorithms for computational optimal transport and Wasserstein barycenter.

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space Fast algorithms for computational optimal transport and Wasserstein barycenter

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T22:22:09.257749Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T22:21:39.988265Z digest=sha256:b3f703b2ed2684ba132d8f421633d5f31540af4ab4e38414f719d49b00536806

Observation ab8ad08c-dc13-4eec-98b2-1ae26e302ff0 · outbound

This paper cites Path finding methods for linear programming: Solving linear programsin ˜O( √ rank) iterations and faster algorithms for maximum flow.

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space Path finding methods for linear programming: Solving linear programsin ˜O( √ rank) iterations and faster algorithms for maximum flow

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T22:22:09.255187Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T22:21:39.988265Z digest=sha256:ab18d132b9fc88e94111132022cd7e391f441b4302a3be0e41345e3184bd72a8

Observation 1b0458b4-0dd1-4e79-952c-564718119a63 · outbound

This paper cites PDOT: a Practical Primal-Dual Algorithm and a GPU-Based Solver for Optimal Transport.

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space PDOT: a Practical Primal-Dual Algorithm and a GPU-Based Solver for Optimal Transport

Reference 6

Resolution
metadata mismatch
arxiv_id, observed 2026-05-17T22:22:08.937495Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T22:21:39.988265Z digest=sha256:abb2d374952e3ae892d52af6c34a18519312938a51b41d3754173bb9d50d9101

Observation ca3916a5-0443-4b08-bbac-7e59d13a4f00 · outbound

This paper cites Area-convexity, l∞regularization, and undirected multicommodity flow.

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space Area-convexity, l∞regularization, and undirected multicommodity flow

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T22:22:09.260217Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-17T22:21:39.988265Z digest=sha256:a0279023b6ee9881d3a7c8bef6479d7c822a77cc8f03f6c7b00675aaab28f472

Pith citing papers

No inbound Pith citation observations are available.