Paper Citation Record · LEDGER

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs

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

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

pith.paper-citation-record.v1
2501.11697 v1

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

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

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+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

21 of 21 outbound references displayed

verified exact2
verified fuzzy7
unresolved9
parse uncertain0
malformed identifier1
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5377a607-b393-43ab-b8b3-3c02ccaef03e · outbound

This paper cites Vulnerability of scheduled networks and a generalization of menger's theorem.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Vulnerability of scheduled networks and a generalization of menger's theorem

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T18:09:16.868582Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 17e064e4-a67d-4611-a171-a9800fd6132e · outbound

This paper cites Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T18:09:16.857964Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2932f1e4-ec47-4929-a027-cef0f1b52e14 · outbound

This paper cites A problem with telephones.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs A problem with telephones

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T18:09:16.845406Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 95d73971-e5ab-4c9d-b977-d5bf9dee090e · outbound

This paper cites In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs

Reference 4

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

This paper cites Time-Varying Graphs and Dynamic Networks.

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.

Observation 556567ed-f1ca-40ff-bbf4-7ba327e212a1 · outbound

This paper cites Sharp Thresholds in Random Simple Temporal Graphs.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Sharp Thresholds in Random Simple Temporal Graphs

Reference 6

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c85ee7d-2062-4597-bf9d-ddc46f7bad1e · outbound

This paper cites Simple, strict, proper, happy: A study of reachability in temporal graphs.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Simple, strict, proper, happy: A study of reachability in temporal graphs

Reference 7

Resolution: metadata mismatch; raw_fallback, observed 2026-08-10T18:09:16.697737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 1350b7f5-6439-471d-bee5-95735e7a650a · outbound

This paper cites Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs

Reference 8

Resolution: malformed identifier; no resolver link, observed 2026-08-10T18:09:16.246655Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec1246bf-34bf-4541-85c7-e09224c7271e · outbound

This paper cites On Inefficiently Connecting Temporal Networks.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs On Inefficiently Connecting Temporal Networks

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e3f7dc3-0692-47c7-975f-578f1daf9834 · outbound

This paper cites On computing large temporal (unilateral) connected components.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs On computing large temporal (unilateral) connected components

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T18:09:16.834083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d0ce515b-d411-49f2-b0e2-e97793947ac1 · outbound

This paper cites Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source

Reference 11

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27beb972-11d6-41e9-a669-c6b6371d1d6c · outbound

This paper cites Temporal graph classes: A view through temporal separators.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Temporal graph classes: A view through temporal separators

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T18:09:16.822810Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ab3c9a6a-8caa-455d-a3fc-49e07de4da41 · outbound

This paper cites Delay-Robust Routes in Temporal Graphs.

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.

Observation 3c6886d4-3c75-462b-9a0f-c4fdbd2af623 · outbound

This paper cites Minimal strong digraphs.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Minimal strong digraphs

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T18:09:16.812540Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 427c5e3e-f1a6-46f5-ac7d-42f98c5eebd9 · outbound

This paper cites Göbel, J.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Göbel, J

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08479155-8355-4884-b47b-c50b91600927 · outbound

This paper cites Connectivity and Inference Problems for Temporal Networks.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Connectivity and Inference Problems for Temporal Networks

Reference 16

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a595b0c9-0967-4010-b732-6d9795bcd2ea · outbound

This paper cites Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f6bc768-1c7c-4cc1-bb1b-66b06eb726ae · outbound

This paper cites In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?.

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-19T06:32:44.657259+00:00.

Observation 18cac620-1d99-4458-b9fd-d693cbbe319b · outbound

This paper cites The Complexity of Transitively Orienting Temporal Graphs.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs The Complexity of Transitively Orienting Temporal Graphs

Reference 19

Resolution: metadata mismatch; local_arxiv, observed 2026-08-10T18:09:16.365671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2ef60e59-d325-44a6-a7b8-bbf2d823d001 · outbound

This paper cites A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs

Reference 20

Resolution: verified exact; doi, observed 2026-08-10T18:09:16.329319Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d66f406d-a0f6-4e1d-8a79-0f517d6db073 · outbound

This paper cites Xuan, Afonso Ferreira, and Aubin Jarry.

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs Xuan, Afonso Ferreira, and Aubin Jarry

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T18:09:16.801957Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Pith citing papers

No inbound Pith citation observations are available.