{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UZNQLA7LV2TIQEZFPU46BEMUKL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2445f08126b0484d23eccc16d7a8b977850f3483147cb795e921b7cc9d00f670","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T08:53:27Z","title_canon_sha256":"a3254fe2fe6ceaacc27e5884a4476e5af4f3ebb2b6cc3a7dec097eee809f0fae"},"schema_version":"1.0","source":{"id":"1404.7634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7634","created_at":"2026-05-18T02:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7634v2","created_at":"2026-05-18T02:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7634","created_at":"2026-05-18T02:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"UZNQLA7LV2TI","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZNQLA7LV2TIQEZF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZNQLA7L","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:2251e8940ac809c88eac569acd080b2702f077567f110b0db828b14484966ddb","target":"graph","created_at":"2026-05-18T02:45:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We address the problem of testing whether a given dynamic graph is temporally connected, {\\it i.e} a temporal path (also called a {\\em journey}) exists between all pairs of vertices. We consider a discrete version of the problem, where the topology is given as an evolving graph ${\\cal G}=\\{G_1,G_2,...,G_{k}\\}$ whose set of vertices is invariant and the set of (directed) edges varies over time. Two cases are studied, depending on whether a single edge or an unlimited number of edges can be crossed in a same $G_i$ (strict journeys {\\it vs} non-strict journeys).\n  In the case of {\\em strict} jour","authors_text":"Arnaud Casteigts, Colette Johnen, Matthieu Barjon, Serge Chaumette, Yessin M. Neggaz","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T08:53:27Z","title":"Testing Temporal Connectivity in Sparse Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7634","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:590f68672c5eda2ddfa331ace4a067909cb3c95b33b8ab402c1f74901c6a26b3","target":"record","created_at":"2026-05-18T02:45:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2445f08126b0484d23eccc16d7a8b977850f3483147cb795e921b7cc9d00f670","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T08:53:27Z","title_canon_sha256":"a3254fe2fe6ceaacc27e5884a4476e5af4f3ebb2b6cc3a7dec097eee809f0fae"},"schema_version":"1.0","source":{"id":"1404.7634","kind":"arxiv","version":2}},"canonical_sha256":"a65b0583ebaea68813257d39e0919452e9ec343f0b69c95f7aa0629efc2f5510","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a65b0583ebaea68813257d39e0919452e9ec343f0b69c95f7aa0629efc2f5510","first_computed_at":"2026-05-18T02:45:55.657474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:55.657474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/s/GUrqOd7wUa8G5fg92l7SNMVcm1v/77weNs6CuBrss/EOsVnEJ8v61sf7LqK246JOZRia99KL9pgFS9ckQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:55.658042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:590f68672c5eda2ddfa331ace4a067909cb3c95b33b8ab402c1f74901c6a26b3","sha256:2251e8940ac809c88eac569acd080b2702f077567f110b0db828b14484966ddb"],"state_sha256":"f8a32a12be391f8095c03f44624cc1a842b080fefcb10a44391623b69124eb0a"}