Pith. sign in

Paper Citation Record · LEDGER

Scalable Approximate Algorithms for Optimal Transport Linear Models

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

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

pith.paper-citation-record.v1
2504.04609 v1

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-23T06:30:58.430688+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-06-30T22:26:56.725953Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-01T14:05:45.918801Z

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 91937953-c398-4321-9fa4-6953f8f6e489 · inbound

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs cites this paper.

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs Scalable Approximate Algorithms for Optimal Transport Linear Models

Reference 21

Resolution
verified exact
arxiv_id, observed 2026-05-12T07:26:26.687884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-05-12T03:11:33.689342Z digest=sha256:0e16209f3f9f3b54796feb9a9c78929a7e88bc23ccd839571bd52b3bebd1eb64

Observation e3986947-9108-48d2-ba7b-340558f68181 · inbound

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs cites this paper.

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs Scalable Approximate Algorithms for Optimal Transport Linear Models

Reference 21

Resolution
verified exact
arxiv_id, observed 2026-05-20T22:49:10.909524Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-05-20T22:44:53.213829Z digest=sha256:90fd2e801af7bfeeb502c7342be02d84b40a05ae469ea58d8e106d6397f33fe1

Observation 3bf1d041-ca4f-4a57-9f93-d24f070b3d3b · inbound

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs cites this paper.

Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs Scalable Approximate Algorithms for Optimal Transport Linear Models

Reference 21

Resolution
verified exact
arxiv_id, observed 2026-07-01T14:05:45.920728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-06-30T22:26:56.725953Z digest=sha256:a7cc9f1f835fddfc9755bf2e58a4a3945b230741bed62526540d70dab658cad0