{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QYR5QAAEGNY2BHEQLKOBVEYAKI","short_pith_number":"pith:QYR5QAAE","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"},"canonical_sha256":"8623d800043371a09c905a9c1a9300521d773e102c40b4d139ba8fe2492bfac3","source":{"kind":"arxiv","id":"1405.0170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0170","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0170v1","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0170","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"QYR5QAAEGNY2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QYR5QAAEGNY2BHEQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QYR5QAAE","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QYR5QAAEGNY2BHEQLKOBVEYAKI","target":"record","payload":{"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"},"canonical_sha256":"8623d800043371a09c905a9c1a9300521d773e102c40b4d139ba8fe2492bfac3","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"},"source_kind":"arxiv","source_id":"1405.0170","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/sMQzWQ9cr4wNCmZeZTCt8IrPxsI/zPs949OnQqhy1VgvrFYPUhL9/GW4OelD0+TNAl30vCDkzpg2t6XlLHjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:42:32.430761Z"},"content_sha256":"6921dd4b423eb30f791f4dc948817d374138cb4cef9277f773c4326a4b1c4b26","schema_version":"1.0","event_id":"sha256:6921dd4b423eb30f791f4dc948817d374138cb4cef9277f773c4326a4b1c4b26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QYR5QAAEGNY2BHEQLKOBVEYAKI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACl593yDfa/r1NeCR3YBJHtVdqNnHkiPEIoW9/peyhiXfMl6IOKK/hYZT6PkDLSFil2lhg/mVYZujqPGo3psCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:42:32.431108Z"},"content_sha256":"abfb6c4250559dfdafb5e22ad331c1fa4f1026c52012d628c7ead2e5aad5ece1","schema_version":"1.0","event_id":"sha256:abfb6c4250559dfdafb5e22ad331c1fa4f1026c52012d628c7ead2e5aad5ece1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/bundle.json","state_url":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T11:42:32Z","links":{"resolver":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI","bundle":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/bundle.json","state":"https://pith.science/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYR5QAAEGNY2BHEQLKOBVEYAKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QYR5QAAEGNY2BHEQLKOBVEYAKI","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":"a05582e3d744a26b50485ab7ab014a2423111d2724f8c18647eb70576c6d3372","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T14:31:31Z","title_canon_sha256":"ba6352851929ef0ff6f57cb19ccde7be330c31f02759250d0119e3831285d9f0"},"schema_version":"1.0","source":{"id":"1405.0170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0170","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0170v1","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0170","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"QYR5QAAEGNY2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QYR5QAAEGNY2BHEQ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QYR5QAAE","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:abfb6c4250559dfdafb5e22ad331c1fa4f1026c52012d628c7ead2e5aad5ece1","target":"graph","created_at":"2026-05-18T02:52:48Z","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 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","authors_text":"Arnaud Casteigts (LaBRI), Colette Johnen (LaBRI), Matthieu Barjon (LaBRI), Serge Chaumette (LaBRI), Yessin M. Neggaz (LaBRI)","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T14:31:31Z","title":"Un algorithme de test pour la connexit\\'e temporelle des graphes dynamiques de faible densit\\'e"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0170","kind":"arxiv","version":1},"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:6921dd4b423eb30f791f4dc948817d374138cb4cef9277f773c4326a4b1c4b26","target":"record","created_at":"2026-05-18T02:52:48Z","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":"a05582e3d744a26b50485ab7ab014a2423111d2724f8c18647eb70576c6d3372","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-01T14:31:31Z","title_canon_sha256":"ba6352851929ef0ff6f57cb19ccde7be330c31f02759250d0119e3831285d9f0"},"schema_version":"1.0","source":{"id":"1405.0170","kind":"arxiv","version":1}},"canonical_sha256":"8623d800043371a09c905a9c1a9300521d773e102c40b4d139ba8fe2492bfac3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8623d800043371a09c905a9c1a9300521d773e102c40b4d139ba8fe2492bfac3","first_computed_at":"2026-05-18T02:52:48.828007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:48.828007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p/1JA8DmpZ5LyueD9mzagaQaXiSBMA1cbYcMElbTwAKEsck3+LoulTrTIsOZzItUxaMXsWLpKRq4sjLm5e1oBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:48.828437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6921dd4b423eb30f791f4dc948817d374138cb4cef9277f773c4326a4b1c4b26","sha256:abfb6c4250559dfdafb5e22ad331c1fa4f1026c52012d628c7ead2e5aad5ece1"],"state_sha256":"82da693bd85e2a3070008bcf7384e02baa940d8bd6ec943eee5cce7797f4a431"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acC13Gz3fHBjGOnJXM+1DGJ8BBVmv839lkRVCFDkURB3rpBdKT1dmVDUamWLJa6Ce2kpRqeVaKrK7jdL2EksCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:42:32.432945Z","bundle_sha256":"d804092952d05040e42fef1a4045b782e2ef36d69427412cfb7dd12dbe88fde7"}}