Paper Citation Record · LEDGER

Fully Dynamic Rooted Spanning Tree on GPU

As of 21 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2607.20211.

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

pith.paper-citation-record.v1
2607.20211 v1

Coverage vector

measured 19 of 19 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T10:33:58.806729Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+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

19 of 19 outbound references displayed

verified exact0
verified fuzzy0
unresolved19
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0e71dd10-58f5-498a-a7d5-04972429b2b5 · outbound

This paper cites The future is big graphs: a community view on graph processing systems,.

Fully Dynamic Rooted Spanning Tree on GPU The future is big graphs: a community view on graph processing systems,

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:56.958692Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad0ff6c9-0a59-4c3f-afe8-4c9b86dcb3ab · outbound

This paper cites A shared-memory algorithm for updating tree-based properties of large dynamic networks,.

Fully Dynamic Rooted Spanning Tree on GPU A shared-memory algorithm for updating tree-based properties of large dynamic networks,

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:57.056899Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 006ec780-e6e9-4e75-9561-5ce27c99a566 · outbound

This paper cites Shared-memory parallel algorithms for fully dynamic maintenance of 2-connected components,.

Fully Dynamic Rooted Spanning Tree on GPU Shared-memory parallel algorithms for fully dynamic maintenance of 2-connected components,

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:57.211796Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 683b29b2-49f5-441d-a41e-63d67b07ff35 · outbound

This paper cites Scalable gpu graph traver- sal,.

Fully Dynamic Rooted Spanning Tree on GPU Scalable gpu graph traver- sal,

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:57.349590Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6e4a3a40-3dd7-4aa6-9adc-7ccddab94615 · outbound

This paper cites Euler meets gpu: practical graph algorithms with theoretical guarantees,.

Fully Dynamic Rooted Spanning Tree on GPU Euler meets gpu: practical graph algorithms with theoretical guarantees,

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:57.486878Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18b248ab-d3df-4098-b439-2df7a917d9c9 · outbound

This paper cites The euler tour technique and parallel rooted spanning tree,.

Fully Dynamic Rooted Spanning Tree on GPU The euler tour technique and parallel rooted spanning tree,

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:57.607805Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e87b9267-30c2-44dc-acaf-de8a5b4c025d · outbound

This paper cites Sparsifica- tion—a technique for speeding up dynamic graph algorithms,.

Fully Dynamic Rooted Spanning Tree on GPU Sparsifica- tion—a technique for speeding up dynamic graph algorithms,

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:57.869153Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a7b9199-6227-4ed6-8e5c-5f0b4e63169a · outbound

This paper cites Application of graph sparsifi- cation in developing parallel algorithms for updating connected compo- nents,.

Fully Dynamic Rooted Spanning Tree on GPU Application of graph sparsifi- cation in developing parallel algorithms for updating connected compo- nents,

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.017652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90b72631-f531-44c1-bc4f-fbf56b6acb2a · outbound

This paper cites A new parallel algorithm for connected components in dynamic graphs,.

Fully Dynamic Rooted Spanning Tree on GPU A new parallel algorithm for connected components in dynamic graphs,

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.142876Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35f9e046-3d0e-4bfb-93e9-118e7cae7b9e · outbound

This paper cites Parallel batch-dynamic graph connectivity,.

Fully Dynamic Rooted Spanning Tree on GPU Parallel batch-dynamic graph connectivity,

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.254738Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2d42f47-5aa6-4db1-a479-249cd7109da9 · outbound

This paper cites Towards scalable and practical batch-dynamic connectivity,.

Fully Dynamic Rooted Spanning Tree on GPU Towards scalable and practical batch-dynamic connectivity,

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.325994Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7e3bfd7-e619-4c33-9a1d-d0758410ed27 · outbound

This paper cites A data structure for dynamic trees,.

Fully Dynamic Rooted Spanning Tree on GPU A data structure for dynamic trees,

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.384379Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a42cefb-45f1-4b72-9b9f-e0657e74dd02 · outbound

This paper cites Data structures for on-line updating of minimum spanning trees,.

Fully Dynamic Rooted Spanning Tree on GPU Data structures for on-line updating of minimum spanning trees,

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.458230Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce4ccfdc-6c13-4948-98f4-4876f3b272e2 · outbound

This paper cites Randomized fully dynamic graph algorithms with polylogarithmic time per operation,.

Fully Dynamic Rooted Spanning Tree on GPU Randomized fully dynamic graph algorithms with polylogarithmic time per operation,

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.541468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f3e1757-5882-483b-8ca5-237e1434399b · outbound

This paper cites Batch-parallel euler tour trees,.

Fully Dynamic Rooted Spanning Tree on GPU Batch-parallel euler tour trees,

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.613486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7588b6ca-e5a1-4ee2-888a-262db96ad1b0 · outbound

This paper cites A fast gpu algorithm for graph connectivity,.

Fully Dynamic Rooted Spanning Tree on GPU A fast gpu algorithm for graph connectivity,

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.671647Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 441752ac-62e6-4de6-bd80-36d586fa5dac · outbound

This paper cites Layered label propaga- tion: A multiresolution coordinate-free ordering for compressing social networks,.

Fully Dynamic Rooted Spanning Tree on GPU Layered label propaga- tion: A multiresolution coordinate-free ordering for compressing social networks,

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.750730Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f1cc54f-2d77-474c-843c-7ebf1efe60a2 · outbound

This paper cites Snap: A general-purpose network analysis and graph-mining library,.

Fully Dynamic Rooted Spanning Tree on GPU Snap: A general-purpose network analysis and graph-mining library,

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:58.806729Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e53f4413-572d-46ff-82f1-6517bb89a97e · outbound

This paper cites an unresolved cited work.

Fully Dynamic Rooted Spanning Tree on GPU Unresolved cited work

Reference 2004

Resolution: unresolved; no resolver link, observed 2026-08-01T10:33:57.723805Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.