Paper Citation Record · LEDGER

Approximating the Network Design Problem for Potential-Based Flows

As of 11 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2604.26882.

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

pith.paper-citation-record.v1
2604.26882 v1

Coverage vector

measured 14 of 14 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-07T10:27:06.228815Z

measured 14 of 14 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+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

14 of 14 outbound references displayed

verified exact14
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 314559c6-2771-4f22-81d0-8fbb789409c7 · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 1

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.936561Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation fef61601-e3ae-420b-a781-fcff3fade582 · outbound

This paper cites Börner, M.

Approximating the Network Design Problem for Potential-Based Flows Börner, M

Reference 2

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.929689Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 287c532f-d5e9-47d7-aaf0-c2fdd6cbfc6c · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 3

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.958783Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 3d6ec7c4-c4b3-428d-a54f-93371dc503c4 · outbound

This paper cites Chou and H.

Approximating the Network Design Problem for Potential-Based Flows Chou and H

Reference 4

Resolution: verified exact; arxiv_id, observed 2026-05-09T04:10:06.910334Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2e0e8d64-8825-4537-8304-7290036484a2 · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 5

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.949245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation d815328e-cd61-4e5f-b248-2c8e7fb3ac6b · outbound

This paper cites Minimizing Effective Resistance of a Graph , Volume =.

Approximating the Network Design Problem for Potential-Based Flows Minimizing Effective Resistance of a Graph , Volume =

Reference 6

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.923935Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 3685c4fb-6fb2-4570-acc0-5ff3695c64d7 · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 7

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.946771Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 68f75a01-a793-4f15-94db-b64baec7802a · outbound

This paper cites Improved Approximation Schemes for the Restricted Shortest Path Problem.

Approximating the Network Design Problem for Potential-Based Flows Improved Approximation Schemes for the Restricted Shortest Path Problem

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-05-12T09:36:26.233658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 192874e6-56f8-43f9-91fc-850d4f36afd9 · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 9

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.916008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 3cdd8783-6a68-4d4d-a516-b9d4d56e2316 · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 10

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.939516Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 87b78380-77bd-461a-bca6-690e1ae703a1 · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 11

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.942680Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 896a1760-baa5-4b14-b6c6-2cc6ab4b532a · outbound

This paper cites 24 Network Design for Potential-Based Flows 35 M.

Approximating the Network Design Problem for Potential-Based Flows 24 Network Design for Potential-Based Flows 35 M

Reference 12

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.913323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 070367d5-1c83-4a05-9a48-fe39852e78ff · outbound

This paper cites an unresolved cited work.

Approximating the Network Design Problem for Potential-Based Flows Unresolved cited work

Reference 13

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.926850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 7330434d-ec75-459f-beff-edc22f13255a · outbound

This paper cites Sridhar and R.

Approximating the Network Design Problem for Potential-Based Flows Sridhar and R

Reference 14

Resolution: verified exact; doi, observed 2026-05-09T04:10:06.952135Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Pith citing papers

No inbound Pith citation observations are available.