Pith. sign in

REVIEW

Structural Lemmas on Temporal Connectivity

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2606.15606 v2 pith:W76QKOQQ submitted 2026-06-14 cs.DM

Daniele Carnevale , Arnaud Casteigts , David Schindl This is my paper · ORCID
classification cs.DM
keywords temporallemmasconnectivitygraphssettingadaptedavoidingbeyond
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper presents several lemmas on the structure of temporal connectivity in temporal graphs. Some of these lemmas are adapted from the literature on gossip from the 70-90's and reformulated in the context of temporal graph theory. Many others are original. For ease of presentation and for avoiding lengthy case distinctions, we formulate all the lemmas in the setting of simple and proper (a.k.a, happy) temporal graphs, discussing occasionally their generality beyond this setting.

Discussion (0). Continue with ORCID to comment.

Pith tools