Pith. sign in

Paper Citation Record · LEDGER

Delay-Robust Routes in Temporal Graphs

As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2201.05390.

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

pith.paper-citation-record.v1
2201.05390 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-09T21:49:00.089623Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation ab3c9a6a-8caa-455d-a3fc-49e07de4da41 · 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 Delay-Robust Routes in Temporal Graphs

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T18:09:16.265791Z digest=sha256:88800e53cd8c4f34b4aec56511f20ec80c4b7227841faeb40130ec2bae7cb72c

Observation c3684bc6-a8ab-4bb7-ad02-b8ca8d09d829 · inbound

Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs cites this paper.

Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs Delay-Robust Routes in Temporal Graphs

Reference 11

Resolution
verified exact
local_arxiv, observed 2026-08-09T21:49:00.093163Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-09T21:48:59.265484Z digest=sha256:78e21237b9d7ab13a4f92e9f45e0e06fd81b13d374937d4293cc00ce7fd6adfe