Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-10T19:16:12.195488Z
Paper Citation Record · LEDGER
Local Sherman's Algorithm for Multi-commodity Flow
As of 17 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2501.10632.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
21 of 21 outbound references displayed
- verified exact1
- verified fuzzy17
- unresolved3
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation cd2e1d51-6bb5-40e7-9465-1e84bb409304 · outbound
This paper cites Italiano, Veronika Loitzenbauer, and Nikos Parotsidis.
Local Sherman's Algorithm for Multi-commodity Flow Italiano, Veronika Loitzenbauer, and Nikos Parotsidis
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.472722Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f8f77105-74fa-402f-9df3-87bf4a6108ce · outbound
This paper cites Deterministic Expander Routing: Faster and More Versatile.
Local Sherman's Algorithm for Multi-commodity Flow Deterministic Expander Routing: Faster and More Versatile
Reference 2
- Resolution
- verified exact
- local_arxiv, observed 2026-08-10T19:16:12.250332Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 373abb1d-be52-492a-8ae9-08bbac858ac0 · outbound
This paper cites Maximum flow and minimum-cost flow in almost-linear time.
Local Sherman's Algorithm for Multi-commodity Flow Maximum flow and minimum-cost flow in almost-linear time
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.460562Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 923a9786-249e-4f62-bc9a-7d05bbce5d5d · outbound
This paper cites Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.
Local Sherman's Algorithm for Multi-commodity Flow Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.446934Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 70d4fd31-4bab-45f5-9ccf-7f179832c52d · outbound
This paper cites Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal.
Local Sherman's Algorithm for Multi-commodity Flow Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T19:16:12.133454Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bedfb775-7500-4a18-b6e3-3a7eff93acaf · outbound
This paper cites Algorithm for solution of a problem of maximum flow in networks with power estimation.
Local Sherman's Algorithm for Multi-commodity Flow Algorithm for solution of a problem of maximum flow in networks with power estimation
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.434814Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1f48b395-58cb-4905-ae63-599457e5bbb0 · outbound
This paper cites Two-commodity flow is equivalent to linear programming under nearly-linear time reductions.
Local Sherman's Algorithm for Multi-commodity Flow Two-commodity flow is equivalent to linear programming under nearly-linear time reductions
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.423299Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation f32c7b49-0d13-481a-9d44-0214d49f57c1 · outbound
This paper cites Maximal flow through a network.
Local Sherman's Algorithm for Multi-commodity Flow Maximal flow through a network
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.411344Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 0e53532f-885e-4af7-ae0d-789c8c04a188 · outbound
This paper cites Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms.
Local Sherman's Algorithm for Multi-commodity Flow Computing and testing small connectivity in near-linear time and queries via fast local cut algorithms
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.400442Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation bc6f97d7-fc0b-4f37-973c-fe4a6274f312 · outbound
This paper cites Goldberg and Satish Rao.
Local Sherman's Algorithm for Multi-commodity Flow Goldberg and Satish Rao
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T19:16:12.153961Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 519c7a44-174d-49f4-a34d-42101fee4835 · outbound
This paper cites Low-step multi-commodity flow emulators.
Local Sherman's Algorithm for Multi-commodity Flow Low-step multi-commodity flow emulators
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.382423Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1a2b5ebe-a445-4bf0-ace0-dc5b4f47ee6f · outbound
This paper cites Dynamic deterministic constant-approximate distance oracles with n^ worst-case update time.
Local Sherman's Algorithm for Multi-commodity Flow Dynamic deterministic constant-approximate distance oracles with n^ worst-case update time
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.370750Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation efa390f0-ea8e-484f-b585-57a63b4405bb · outbound
This paper cites Local flow partitioning for faster edge connectivity.
Local Sherman's Algorithm for Multi-commodity Flow Local flow partitioning for faster edge connectivity
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.358444Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 97d8e93e-b7da-46a8-89b0-dc5db2485deb · outbound
This paper cites Liu and Aaron Sidford.
Local Sherman's Algorithm for Multi-commodity Flow Liu and Aaron Sidford
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.345968Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b4ac4de7-5b00-4e25-be57-521ef5da23dc · outbound
This paper cites Breaking quadratic time for small vertex connectivity and an approximation scheme.
Local Sherman's Algorithm for Multi-commodity Flow Breaking quadratic time for small vertex connectivity and an approximation scheme
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.332949Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4fa6f60e-231f-45c9-b3b7-85f3ead3a61e · outbound
This paper cites Flow-based algorithms for local graph clustering.
Local Sherman's Algorithm for Multi-commodity Flow Flow-based algorithms for local graph clustering
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.320373Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4a6f798e-0f5b-494c-b848-cbd7abfe68b2 · outbound
This paper cites Nearly maximum flows in nearly linear time.
Local Sherman's Algorithm for Multi-commodity Flow Nearly maximum flows in nearly linear time
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.309096Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 7602f123-7a27-4967-bf95-9a3d6fe49dfb · outbound
This paper cites Area-convexity, l_ regularization, and undirected multicommodity flow.
Local Sherman's Algorithm for Multi-commodity Flow Area-convexity, l_ regularization, and undirected multicommodity flow
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.296700Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3bb341dc-439c-4f28-b8c4-c3ac11a4a3d8 · outbound
This paper cites Expander decomposition and pruning: Faster, stronger, and simpler.
Local Sherman's Algorithm for Multi-commodity Flow Expander decomposition and pruning: Faster, stronger, and simpler
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.284605Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation db86bcfb-4859-4ff3-882e-674ee6b5a238 · outbound
This paper cites A deterministic almost-linear time algorithm for minimum-cost flow.
Local Sherman's Algorithm for Multi-commodity Flow A deterministic almost-linear time algorithm for minimum-cost flow
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T19:16:12.190872Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2d186f25-edaa-473b-8002-e28e8500718f · outbound
This paper cites Faster high accuracy multi-commodity flow from single-commodity techniques.
Local Sherman's Algorithm for Multi-commodity Flow Faster high accuracy multi-commodity flow from single-commodity techniques
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-10T19:16:12.263845Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.