{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UZNQLA7LV2TIQEZFPU46BEMUKL","short_pith_number":"pith:UZNQLA7L","schema_version":"1.0","canonical_sha256":"a65b0583ebaea68813257d39e0919452e9ec343f0b69c95f7aa0629efc2f5510","source":{"kind":"arxiv","id":"1404.7634","version":2},"attestation_state":"computed","paper":{"title":"Testing Temporal Connectivity in Sparse Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Arnaud Casteigts, Colette Johnen, Matthieu Barjon, Serge Chaumette, Yessin M. Neggaz","submitted_at":"2014-04-30T08:53:27Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1404.7634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T08:53:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"a3254fe2fe6ceaacc27e5884a4476e5af4f3ebb2b6cc3a7dec097eee809f0fae","abstract_canon_sha256":"2445f08126b0484d23eccc16d7a8b977850f3483147cb795e921b7cc9d00f670"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:55.658042Z","signature_b64":"/s/GUrqOd7wUa8G5fg92l7SNMVcm1v/77weNs6CuBrss/EOsVnEJ8v61sf7LqK246JOZRia99KL9pgFS9ckQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65b0583ebaea68813257d39e0919452e9ec343f0b69c95f7aa0629efc2f5510","last_reissued_at":"2026-05-18T02:45:55.657474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:55.657474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing Temporal Connectivity in Sparse Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Arnaud Casteigts, Colette Johnen, Matthieu Barjon, Serge Chaumette, Yessin M. Neggaz","submitted_at":"2014-04-30T08:53:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7634","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.7634","created_at":"2026-05-18T02:45:55.657569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7634v2","created_at":"2026-05-18T02:45:55.657569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7634","created_at":"2026-05-18T02:45:55.657569+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZNQLA7LV2TI","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZNQLA7LV2TIQEZF","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZNQLA7L","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":80,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL","json":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL.json","graph_json":"https://pith.science/api/pith-number/UZNQLA7LV2TIQEZFPU46BEMUKL/graph.json","events_json":"https://pith.science/api/pith-number/UZNQLA7LV2TIQEZFPU46BEMUKL/events.json","paper":"https://pith.science/paper/UZNQLA7L"},"agent_actions":{"view_html":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL","download_json":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL.json","view_paper":"https://pith.science/paper/UZNQLA7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7634&json=true","fetch_graph":"https://pith.science/api/pith-number/UZNQLA7LV2TIQEZFPU46BEMUKL/graph.json","fetch_events":"https://pith.science/api/pith-number/UZNQLA7LV2TIQEZFPU46BEMUKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL/action/storage_attestation","attest_author":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL/action/author_attestation","sign_citation":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL/action/citation_signature","submit_replication":"https://pith.science/pith/UZNQLA7LV2TIQEZFPU46BEMUKL/action/replication_record"}},"created_at":"2026-05-18T02:45:55.657569+00:00","updated_at":"2026-05-18T02:45:55.657569+00:00"}