{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QYR5QAAEGNY2BHEQLKOBVEYAKI","short_pith_number":"pith:QYR5QAAE","schema_version":"1.0","canonical_sha256":"8623d800043371a09c905a9c1a9300521d773e102c40b4d139ba8fe2492bfac3","source":{"kind":"arxiv","id":"1405.0170","version":1},"attestation_state":"computed","paper":{"title":"Un algorithme de test pour la connexit\\'e temporelle des graphes dynamiques de faible densit\\'e","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Arnaud Casteigts (LaBRI), Colette Johnen (LaBRI), Matthieu Barjon (LaBRI), Serge Chaumette (LaBRI), Yessin M. Neggaz (LaBRI)","submitted_at":"2014-05-01T14:31:31Z","abstract_excerpt":"We address the problem of testing whether a dynamic graph is temporally connected, i.e. a temporal path ({\\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 $\\G=\\{G_1,G_2,...,G_{k}\\}$ in which only the set of (directed) edges varies. 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). For strict journeys, two existing algorithms designed for other problems can be adapted. However, we"},"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":"1405.0170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T14:31:31Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"ba6352851929ef0ff6f57cb19ccde7be330c31f02759250d0119e3831285d9f0","abstract_canon_sha256":"a05582e3d744a26b50485ab7ab014a2423111d2724f8c18647eb70576c6d3372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:48.828437Z","signature_b64":"p/1JA8DmpZ5LyueD9mzagaQaXiSBMA1cbYcMElbTwAKEsck3+LoulTrTIsOZzItUxaMXsWLpKRq4sjLm5e1oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8623d800043371a09c905a9c1a9300521d773e102c40b4d139ba8fe2492bfac3","last_reissued_at":"2026-05-18T02:52:48.828007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:48.828007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Un algorithme de test pour la connexit\\'e temporelle des graphes dynamiques de faible densit\\'e","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Arnaud Casteigts (LaBRI), Colette Johnen (LaBRI), Matthieu Barjon (LaBRI), Serge Chaumette (LaBRI), Yessin M. Neggaz (LaBRI)","submitted_at":"2014-05-01T14:31:31Z","abstract_excerpt":"We address the problem of testing whether a dynamic graph is temporally connected, i.e. a temporal path ({\\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 $\\G=\\{G_1,G_2,...,G_{k}\\}$ in which only the set of (directed) edges varies. 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). For strict journeys, two existing algorithms designed for other problems can be adapted. However, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0170","kind":"arxiv","version":1},"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":"1405.0170","created_at":"2026-05-18T02:52:48.828066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0170v1","created_at":"2026-05-18T02:52:48.828066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0170","created_at":"2026-05-18T02:52:48.828066+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYR5QAAEGNY2","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYR5QAAEGNY2BHEQ","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYR5QAAE","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI","json":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI.json","graph_json":"https://pith.science/api/pith-number/QYR5QAAEGNY2BHEQLKOBVEYAKI/graph.json","events_json":"https://pith.science/api/pith-number/QYR5QAAEGNY2BHEQLKOBVEYAKI/events.json","paper":"https://pith.science/paper/QYR5QAAE"},"agent_actions":{"view_html":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI","download_json":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI.json","view_paper":"https://pith.science/paper/QYR5QAAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0170&json=true","fetch_graph":"https://pith.science/api/pith-number/QYR5QAAEGNY2BHEQLKOBVEYAKI/graph.json","fetch_events":"https://pith.science/api/pith-number/QYR5QAAEGNY2BHEQLKOBVEYAKI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/action/storage_attestation","attest_author":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/action/author_attestation","sign_citation":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/action/citation_signature","submit_replication":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/action/replication_record"}},"created_at":"2026-05-18T02:52:48.828066+00:00","updated_at":"2026-05-18T02:52:48.828066+00:00"}