Pith. sign in

Paper Citation Record · LEDGER

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations

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

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

pith.paper-citation-record.v1
1304.2338 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 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 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T15:36:03.743374Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-05-25T16:41:02.552338Z

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 bbbb5e7a-fb90-4e05-a4cb-5a0cada8cc11 · inbound

Flows in Almost Linear Time via Adaptive Preconditioning cites this paper.

Flows in Almost Linear Time via Adaptive Preconditioning An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations

Reference 28

Resolution
metadata mismatch
local_arxiv, observed 2026-05-25T16:41:02.554918Z

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-05-25T16:38:49.689477Z digest=sha256:927ebbdfd2430d280488a1ff518a38e27663f39552a9789c18c699da753daca6

Observation a9b14478-e5c1-43f4-988b-3c007f4a4e73 · inbound

Distributed Sparsest Cut via Eigenvalue Estimation cites this paper.

Distributed Sparsest Cut via Eigenvalue Estimation An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations

Reference 226

Resolution
unresolved
no resolver link, observed 2026-08-05T15:36:03.743374Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T15:36:03.743374Z digest=sha256:3340352334bca0308bc8c405c42d6a4fd06ccbaba7fc8c1222643fc09d3d853e