Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2301.10503.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-10T18:09:16.285344Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-10T18:09:16.377307Z
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 7f6bc768-1c7c-4cc1-bb1b-66b06eb726ae · 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 In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
Reference 18
- Resolution
- verified exact
- local_arxiv, observed 2026-08-10T18:09:16.382422Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.