Pith. sign in

Paper Citation Record · LEDGER

Time-Varying Graphs and Dynamic Networks

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1012.0009.

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

pith.paper-citation-record.v1
1012.0009 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 3 of 3 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T18:09:16.234813Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

16
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 5ddfae1d-54b1-4bd1-a423-d6f1a47c9221 · inbound

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs cites this paper.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Time-Varying Graphs and Dynamic Networks

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-10T18:09:16.234813Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:09:16.234813Z digest=sha256:76962d47aee846e2f7aeb2e9de49ed20c31728311abf6f0175b136762e07d4e3

Observation ae41e669-8a3f-49c2-aa54-d891ddc55e8d · inbound

Optimal Routing for Federated Learning over Dynamic Satellite Networks: Tractable or Not? cites this paper.

Optimal Routing for Federated Learning over Dynamic Satellite Networks: Tractable or Not? Time-Varying Graphs and Dynamic Networks

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-07-04T18:01:47.900848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=pdf_text observed=2026-05-10T03:21:30.310819Z digest=sha256:5bf1dce3d7ff9fb006831d19fb24355349f49a1533b52201dad3c9dd0794751d

Observation c5ed7b9e-b9e0-406d-89c9-0e3f844527ca · inbound

Maximizing Reachability via Shifting of Temporal Paths cites this paper.

Maximizing Reachability via Shifting of Temporal Paths Time-Varying Graphs and Dynamic Networks

Reference 200

Resolution
verified exact
arxiv_id, observed 2026-07-04T18:01:47.900848Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-05-13T05:00:02.957536Z digest=sha256:af1ac16e02bb3e8781f232ffdfbcd015b99f54109bd66328674c51e9a045d601