Paper Citation Record · LEDGER

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs

As of 19 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 2 inbound Pith citation observations for arXiv:2312.06260.

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

pith.paper-citation-record.v1
2312.06260 v2

Coverage vector

measured 31 of 31 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-24T05:36:31.843747Z

measured 33 of 33 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 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.230562Z

measured 1 of 1 external citation measurements

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

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

Reference resolution

31 of 31 outbound references displayed

verified exact2
verified fuzzy29
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

0
pith, observed 2026-08-05T02:28:24.338817Z

Outbound references

Observation 928d6bdb-85e6-4940-9b88-9f0152f04379 · outbound

This paper cites Temporal ﬂows in temporal networks.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Temporal ﬂows in temporal networks

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.739394Z

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 130fd964-b9b2-4430-82de-7b227de049b8 · outbound

This paper cites Akrida, Leszek Gasieniec, George B.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Akrida, Leszek Gasieniec, George B

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.732021Z

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 75ffeb01-4040-4cdb-934b-ef75c7d012f9 · outbound

This paper cites On implementing stabilizing leader election with weak assumptions on netwo rk dynamics.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs On implementing stabilizing leader election with weak assumptions on netwo rk dynamics

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.729438Z

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 d84f887b-eb6c-47ba-80b5-47d092e88e3e · outbound

This paper cites On the size and the approximability of minimum temporally connected subgraphs.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs On the size and the approximability of minimum temporally connected subgraphs

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.734454Z

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 ea78b034-85fc-4e2b-aff1-35f9ca09193d · outbound

This paper cites Parsimonious ﬂooding in dynamic graphs.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Parsimonious ﬂooding in dynamic graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.736888Z

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 f7f12fc8-e662-457e-bd55-12acf5b1ad6a · outbound

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

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Complexity of connec ted components in evolving graphs and the computation of multicast trees in dynamic networks

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.724326Z

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 caecc784-c5e6-4c9f-8a83-2ab472bbb079 · outbound

This paper cites Blackout-tolerant temporal spanners.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Blackout-tolerant temporal spanners

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.721797Z

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 d0176aba-1f25-4596-b08c-8ae016376324 · outbound

This paper cites Sparse tempo- ral spanners with low stretch.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Sparse tempo- ral spanners with low stretch

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.726630Z

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 6e798684-21d8-41b1-8ee8-32c6bd4fc7d7 · outbound

This paper cites The complexity of d ata aggregation in static and dynamic wireless sensor networks.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs The complexity of d ata aggregation in static and dynamic wireless sensor networks

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.719595Z

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 0fea201f-23c0-4b41-b319-728ba732aaed · outbound

This paper cites A dynamic data structure for temporal reachability with unsorted contact insertions.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs A dynamic data structure for temporal reachability with unsorted contact insertions

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.716951Z

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 e56d7a03-67f9-4834-acb3-1e1b041244f0 · outbound

This paper cites On computing pareto opti- mal paths in weighted time-dependent networks.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs On computing pareto opti- mal paths in weighted time-dependent networks

Reference 11

Resolution: verified exact; arxiv_id, observed 2026-05-24T05:38:55.594855Z

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 41fb2925-4ab4-4361-bbd7-6517dcebf293 · outbound

This paper cites Maximizing reachability in a temporal graph obtained by assigning starting times to a collection o f walks.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Maximizing reachability in a temporal graph obtained by assigning starting times to a collection o f walks

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.709395Z

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 f8630012-b810-4637-b178-97ae9b49acaa · outbound

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

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Bui-Xuan, Afonso Ferreira, and Aubin Jarry

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.714517Z

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 1fa82707-8f72-4e42-998e-9993ccb01417 · outbound

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

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Simple, strict, proper, happy: A study of reachability in temporal graphs

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.741762Z

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 99853137-1316-4ac6-8bd9-26aa8930fc3a · outbound

This paper cites Time-varying graphs and dynamic networks.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Time-varying graphs and dynamic networks

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.694648Z

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 df571f68-98d6-4985-a36c-a9bffa2495fc · outbound

This paper cites Finding temporal paths under waiting time constraints.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Finding temporal paths under waiting time constraints

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.696777Z

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 28d01970-b17b-446e-a853-a040407ede4a · outbound

This paper cites Peters, and Jason Schoeters.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Peters, and Jason Schoeters

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.744575Z

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 b1fc7ddf-786a-496c-a46b-fb9a1eb02973 · outbound

This paper cites Sharp thresholds in random simple temporal graphs.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Sharp thresholds in random simple temporal graphs

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.692172Z

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 a9324b9c-89ef-43c1-ac8d-c5513ee8b4d0 · outbound

This paper cites Enumeration of sd separators in dags with application to reliability analysis in temporal g raphs.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Enumeration of sd separators in dags with application to reliability analysis in temporal g raphs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.699287Z

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 dc54b188-153d-420c-87e7-0e1c937c4e29 · outbound

This paper cites Distributed exploration of dynamic rings.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Distributed exploration of dynamic rings

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.701430Z

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 9f1c9e68-9fa5-4e06-a880-82521389a5a4 · outbound

This paper cites Deleting edges to restrict the size of an epidemic in temporal networks.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Deleting edges to restrict the size of an epidemic in temporal networks

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.686957Z

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 07fc4e65-acc2-4ad1-8445-5e7b10a2f44f · outbound

This paper cites Counting Temporal Paths.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Counting Temporal Paths

Reference 22

Resolution: verified exact; arxiv_id, observed 2026-05-24T05:38:56.019811Z

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 760a6f5a-ec44-4faf-9172-9c28105aea9d · outbound

This paper cites Parameterized temp oral exploration problems.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Parameterized temp oral exploration problems

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.712007Z

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 312324b0-a515-4eb2-aa7b-0a405b41df51 · outbound

This paper cites On th e exploration of time-varying networks.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs On th e exploration of time-varying networks

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.682004Z

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 a2efdfcc-b841-49ee-b19a-71f36ee6a03e · outbound

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

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Temporal graph classes: A view through temporal separators

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.684659Z

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 ce0819eb-7c94-4718-a8da-85416733b6ce · outbound

This paper cites A connectivity model for agreement in dynamic systems.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs A connectivity model for agreement in dynamic systems

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.677058Z

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 53890fce-b7dd-4788-987e-3f298887d322 · outbound

This paper cites Exploration of constantly connected dynamic graphs based on cactuses.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Exploration of constantly connected dynamic graphs based on cactuses

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.706588Z

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 3864351b-2840-4832-b09c-7a6b8a30c399 · outbound

This paper cites Kempe, J.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Kempe, J

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.704036Z

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 a94b6ead-c666-4a1c-b0e4-24ae23a6c071 · outbound

This paper cites Stro ngly connected components in stream graphs: Computation and experimentations.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Stro ngly connected components in stream graphs: Computation and experimentations

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.674862Z

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 3651c811-7a32-4921-9957-76eb32d0aead · outbound

This paper cites A theoretical and experimental study of a new algorithm for minimum cost ﬂow in dynamic graph s.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs A theoretical and experimental study of a new algorithm for minimum cost ﬂow in dynamic graph s

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.679632Z

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 156cad6d-16e4-48b6-a3fd-0b3567fdc7b8 · outbound

This paper cites Temporal reach- ability graphs.

In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs Temporal reach- ability graphs

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-05-24T05:38:56.689871Z

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

Observation 95d73971-e5ab-4c9d-b977-d5bf9dee090e · 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 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 7a0879f9-7290-4415-97cf-460d094a1333 · inbound

Maximizing Reachability via Shifting of Temporal Paths cites this paper.

Maximizing Reachability via Shifting of Temporal Paths In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs

Reference 196

Resolution: verified exact; local_arxiv, observed 2026-05-13T05:02:16.848790Z

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.