Pith. sign in

Paper Citation Record · LEDGER

Minimum Cost Flows, MDPs, and $\ell_1$-Regression in Nearly Linear Time for Dense Instances

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

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

pith.paper-citation-record.v1
2101.05719 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-18T06:34:40.430872+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-08T20:29:45.675556Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T19:57:43.856348Z

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 f104f167-496b-4591-872e-7c7fc2cae858 · inbound

Computing and Learning on Combinatorial Data cites this paper.

Computing and Learning on Combinatorial Data Minimum Cost Flows, MDPs, and $\ell_1$-Regression in Nearly Linear Time for Dense Instances

Reference 142

Resolution
unresolved
no resolver link, observed 2026-08-08T20:29:45.675556Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-08T20:29:45.675556Z digest=sha256:f9b4d2ef731c4438efef621a745a3231940f22ba0301dbf39c5afc7ddb74a375

Observation 0696eb8a-29dd-4ab3-8adb-5a626ee15282 · inbound

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities cites this paper.

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities Minimum Cost Flows, MDPs, and $\ell_1$-Regression in Nearly Linear Time for Dense Instances

Reference 18

Resolution
verified exact
local_arxiv, observed 2026-08-06T19:57:43.914073Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-08-06T19:57:37.762790Z digest=sha256:3abee82d6736d23dda5d3d12ea7ab173e7c51e0b6fad21d593dc0337b5c6bbd8