Paper Citation Record · LEDGER

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

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

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

pith.paper-citation-record.v1
1908.01956 v1

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T15:14:34.145757Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

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

17 of 17 outbound references displayed

verified exact7
verified fuzzy4
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e9461a69-6fbc-45bf-9725-bfee83c831c7 · outbound

This paper cites Massively Parallel Dynamic Programming on Trees.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Massively Parallel Dynamic Programming on Trees

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-08-14T15:14:34.390684Z

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 a8407946-8845-4eb0-b911-39692d04550e · outbound

This paper cites A new frame- work for distributed submodular maximization.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds A new frame- work for distributed submodular maximization

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:14:34.507830Z

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 9721df87-e289-41bb-8cd6-f2f42ea4e9ae · outbound

This paper cites A Conditional Lower Bound on Graph Connectivity in MapReduce.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds A Conditional Lower Bound on Graph Connectivity in MapReduce

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-08-14T15:14:34.304745Z

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 e458956b-500d-41e2-9a03-0a6b96585b9b · outbound

This paper cites Faster spectral sparsification and numerical algorithms for SDD matrices.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Faster spectral sparsification and numerical algorithms for SDD matrices

Reference 10

Resolution: metadata mismatch; local_arxiv, observed 2026-08-14T15:14:34.281825Z

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 4b11a93a-d9c9-4d2b-898d-fa50fc327236 · outbound

This paper cites A framework for analyzing resparsiﬁcation algorithms.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds A framework for analyzing resparsiﬁcation algorithms

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:14:34.491616Z

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 6ecad373-fc81-4fa9-88b5-b60416d358d5 · outbound

This paper cites Spectral Sparsification of Graphs.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Spectral Sparsification of Graphs

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-14T15:14:34.140894Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bae5a02-6213-45eb-9ec2-11f295d11218 · outbound

This paper cites Connected Components at Scale via Local Contractions.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Connected Components at Scale via Local Contractions

Reference 2009

Resolution: unresolved; no resolver link, observed 2026-08-14T15:14:34.117478Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8d24d54-90ae-4b3d-a7de-f7308275af46 · outbound

This paper cites Distributed submodular maximization: Identifying representative ele ments in massive data.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Distributed submodular maximization: Identifying representative ele ments in massive data

Reference 2010

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:14:34.474458Z

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 0df31541-11f5-40c0-b7b7-bbc10073e0a8 · outbound

This paper cites Graph Sparsification by Effective Resistances.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Graph Sparsification by Effective Resistances

Reference 2011

Resolution: unresolved; no resolver link, observed 2026-08-14T15:14:34.136058Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17bf0929-eaab-4b87-8551-708613209758 · outbound

This paper cites User-friendly tail bounds for sums of random matrices.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds User-friendly tail bounds for sums of random matrices

Reference 2012

Resolution: unresolved; no resolver link, observed 2026-08-14T15:14:34.145757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e00e840f-b6b5-43b6-8f39-7aa39d87a533 · outbound

This paper cites Spielman and N.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Spielman and N

Reference 2013

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:14:34.457440Z

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 38f57bbb-01a4-49ed-b37c-d1ba822e5b49 · outbound

This paper cites Simple Round Compression for Parallel Vertex Cover.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Simple Round Compression for Parallel Vertex Cover

Reference 2014

Resolution: verified exact; local_arxiv, observed 2026-08-14T15:14:34.439694Z

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 79c51ab8-a1d8-41f8-bee9-ba253cb1264a · outbound

This paper cites Dynamic graph connectivity with improved worst case update time and sublinear space.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Dynamic graph connectivity with improved worst case update time and sublinear space

Reference 2015

Resolution: unresolved; no resolver link, observed 2026-08-14T15:14:34.097257Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f781c0a9-fa51-4b0c-8dc4-f5ff57688fdb · outbound

This paper cites Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model

Reference 2016

Resolution: verified exact; local_arxiv, observed 2026-08-14T15:14:34.366428Z

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 dda86800-8af4-4b20-82c0-84ad4400cac3 · outbound

This paper cites Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space

Reference 2017

Resolution: verified exact; local_arxiv, observed 2026-08-14T15:14:34.241062Z

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 9d7f7963-2f19-4227-871f-5b1829c2ea43 · outbound

This paper cites Exponentially Faster Massively Parallel Maximal Matching.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Exponentially Faster Massively Parallel Maximal Matching

Reference 2018

Resolution: verified exact; local_arxiv, observed 2026-08-14T15:14:34.343971Z

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 6bc31b2a-785f-404b-ab4f-f5b5a7036bbd · outbound

This paper cites Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity.

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds Log Diameter Rounds Algorithms for $2$-Vertex and $2$-Edge Connectivity

Reference 2019

Resolution: verified exact; local_arxiv, observed 2026-08-14T15:14:34.416611Z

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.