Paper Citation Record · LEDGER

An Online Sparsification Algorithm from the Book

As of 17 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2607.23098.

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

pith.paper-citation-record.v1
2607.23098 v1

Coverage vector

measured 35 of 35 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T03:55:26.803066Z

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+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

35 of 35 outbound references displayed

verified exact4
verified fuzzy0
unresolved30
parse uncertain1
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 10f23175-1f96-46d0-a11a-c74822adcc40 · outbound

This paper cites and Musco, Cameron and Pachocki, Jakub , title =.

An Online Sparsification Algorithm from the Book and Musco, Cameron and Pachocki, Jakub , title =

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.705994Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad6192a3-6bb9-44f3-a490-8d2428eba44f · outbound

This paper cites and Yasuda, Taisuke , booktitle=.

An Online Sparsification Algorithm from the Book and Yasuda, Taisuke , booktitle=

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.709537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d558ec7-cb68-412f-bef4-78a02a587b2a · outbound

This paper cites All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time , year=.

An Online Sparsification Algorithm from the Book All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time , year=

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.713375Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce05ca54-afaa-43f7-848b-397b69187d5c · outbound

This paper cites Deterministic Almost-Linear-Time Gomory-Hu Trees.

An Online Sparsification Algorithm from the Book Deterministic Almost-Linear-Time Gomory-Hu Trees

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.716428Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a05dc035-c1d8-4dd8-8e29-546c1b5a751b · outbound

This paper cites Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =.

An Online Sparsification Algorithm from the Book Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =

Reference 5

Resolution: verified exact; doi, observed 2026-08-01T03:58:33.268588Z

Source-reported events for the cited work

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

Observation 4b4fd7b6-684b-4fde-a111-a8c9289996a0 · outbound

This paper cites Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time , year=.

An Online Sparsification Algorithm from the Book Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time , year=

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.722573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 38837580-5287-4e9c-b306-bb24eccc8a4b · outbound

This paper cites Journal of the Society for Industrial and Applied Mathematics , volume=.

An Online Sparsification Algorithm from the Book Journal of the Society for Industrial and Applied Mathematics , volume=

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.725389Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48eff9b0-effb-4546-b754-448f76b6b28b · outbound

This paper cites On Fully Dynamic Graph Sparsifiers , year=.

An Online Sparsification Algorithm from the Book On Fully Dynamic Graph Sparsifiers , year=

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.728395Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation debe94af-bec5-4162-9e3a-c4bf8ca993c3 · outbound

This paper cites 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , pages =.

An Online Sparsification Algorithm from the Book 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , pages =

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.731499Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14ab5b73-dcb3-4f99-93cb-8aeb67c8b285 · outbound

This paper cites 2019 , isbn =.

An Online Sparsification Algorithm from the Book 2019 , isbn =

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.734286Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b6ee0f5e-dbff-41e1-b9b9-fad025a57085 · outbound

This paper cites Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers , year=.

An Online Sparsification Algorithm from the Book Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers , year=

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.737235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 865f8379-3c83-4630-b1c6-d03545d7b543 · outbound

This paper cites and Peng, Richard and Sidford, Aaron , title =.

An Online Sparsification Algorithm from the Book and Peng, Richard and Sidford, Aaron , title =

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.740134Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89025d9b-72e7-40ca-ba41-24eff04577be · outbound

This paper cites SIAM Journal on Computing , pages =.

An Online Sparsification Algorithm from the Book SIAM Journal on Computing , pages =

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.743074Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af936e73-4e1f-4c18-b383-4e2642c1783b · outbound

This paper cites Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs.

An Online Sparsification Algorithm from the Book Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.745762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d5c8f35-d87b-4d50-913f-8811590ea6b9 · outbound

This paper cites SIAM Journal on Computing , volume =.

An Online Sparsification Algorithm from the Book SIAM Journal on Computing , volume =

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.748534Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0ec4d6a-3eaa-47a5-a5ad-1c6b81f11efd · outbound

This paper cites 2015 , issue_date =.

An Online Sparsification Algorithm from the Book 2015 , issue_date =

Reference 16

Resolution: verified exact; doi, observed 2026-08-01T03:58:33.081788Z

Source-reported events for the cited work

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

Observation 0b3563fd-b9e4-42dc-be8c-804f465f4814 · outbound

This paper cites Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions , year=.

An Online Sparsification Algorithm from the Book Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions , year=

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.753573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 22844842-ca4b-496d-9de9-bdf6d52081f1 · outbound

This paper cites Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =.

An Online Sparsification Algorithm from the Book Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =

Reference 18

Resolution: verified exact; doi, observed 2026-08-01T03:58:32.953697Z

Source-reported events for the cited work

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

Observation c4aeaba0-5344-4287-86d2-37ad5adc19a8 · outbound

This paper cites Towards Optimal Effective Resistance Estimation , url =.

An Online Sparsification Algorithm from the Book Towards Optimal Effective Resistance Estimation , url =

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.759149Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 166071ec-cde1-44ae-957c-236decfab423 · outbound

This paper cites Proceedings of the 35th International Conference on Neural Information Processing Systems , articleno =.

An Online Sparsification Algorithm from the Book Proceedings of the 35th International Conference on Neural Information Processing Systems , articleno =

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.761931Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a315953-c960-4057-aa16-bfeb65bba41c · outbound

This paper cites The Complexity of Dynamic Least-Squares Regression , year=.

An Online Sparsification Algorithm from the Book The Complexity of Dynamic Least-Squares Regression , year=

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.764592Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5189c1e5-2ded-4db0-b0b4-6216b3b5cefd · outbound

This paper cites 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

An Online Sparsification Algorithm from the Book 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.767035Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 859adbf9-1da5-4b8d-a89a-4fa7fc43f5ce · outbound

This paper cites 2025 , eprint=.

An Online Sparsification Algorithm from the Book 2025 , eprint=

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.769413Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef188fa3-170f-49bc-b95b-a5f5e501d818 · outbound

This paper cites Foundations and trends.

An Online Sparsification Algorithm from the Book Foundations and trends

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.772073Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5885da8d-a579-474a-9291-b5c9365c989d · outbound

This paper cites Freedman , title =.

An Online Sparsification Algorithm from the Book Freedman , title =

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.774830Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b361542-8925-44aa-88fd-00de7a0ef3fc · outbound

This paper cites an unresolved cited work.

An Online Sparsification Algorithm from the Book Unresolved cited work

Reference 26

Resolution: parse uncertain; no resolver link, observed 2026-08-01T03:55:26.777388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4fb80df-d5d6-4717-b317-8080577f73f8 · outbound

This paper cites 2016 , issue_date =.

An Online Sparsification Algorithm from the Book 2016 , issue_date =

Reference 27

Resolution: verified exact; doi, observed 2026-08-01T03:58:32.866563Z

Source-reported events for the cited work

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

Observation db75dbfa-b16b-4b6c-84b8-dbf31ddb3d8f · outbound

This paper cites Discrete & Computational Geometry , volume=.

An Online Sparsification Algorithm from the Book Discrete & Computational Geometry , volume=

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.783559Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27fe2b13-f476-42ed-a967-2368bab7ebf1 · outbound

This paper cites 30th Annual European Symposium on Algorithms (ESA 2022) , pages =.

An Online Sparsification Algorithm from the Book 30th Annual European Symposium on Algorithms (ESA 2022) , pages =

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.786411Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a3eacaa1-776a-4035-a1f7-f2827f7c6a56 · outbound

This paper cites Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =.

An Online Sparsification Algorithm from the Book Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages =

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.789153Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c6c0cc9c-6b05-43f5-b2da-21e748e1e912 · outbound

This paper cites 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) , pages=.

An Online Sparsification Algorithm from the Book 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) , pages=

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.791829Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 32c2700b-eaaf-4afc-8285-5c39dd9d2cb2 · outbound

This paper cites Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.

An Online Sparsification Algorithm from the Book Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.794812Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 280876d2-945c-41f5-81c4-ff25989fa24b · outbound

This paper cites Howard and Aaditya Ramdas and Jon McAuliffe and Jasjeet Sekhon , title =.

An Online Sparsification Algorithm from the Book Howard and Aaditya Ramdas and Jon McAuliffe and Jasjeet Sekhon , title =

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.797708Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 172c9642-a9b0-4ee3-b01a-a23e60d1b565 · outbound

This paper cites 2025 , eprint=.

An Online Sparsification Algorithm from the Book 2025 , eprint=

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.800282Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20a0552d-61dc-4bd1-a6c8-4df5569d6b19 · outbound

This paper cites Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =.

An Online Sparsification Algorithm from the Book Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-01T03:55:26.803066Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.