{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","short_pith_number":"pith:OWIOMWCQ","schema_version":"1.0","canonical_sha256":"7590e65850cfd3c5c041cf6e526f33d9d4d35489eef00dd7c888697d852983cf","source":{"kind":"arxiv","id":"1502.04579","version":3},"attestation_state":"computed","paper":{"title":"The complexity of optimal design of temporally connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eleni C. Akrida, George B. Mertzios, Leszek Gasieniec, Paul G. Spirakis","submitted_at":"2015-02-16T15:39:52Z","abstract_excerpt":"We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of $n$ vertices, where each edge has an associated set of discrete availability instances (labels). A journey from vertex $u$ to vertex $v$ is a path from $u$ to $v$ where successive path edges have strictly increasing labels. A graph is temporally connected iff there is a $(u,v)$-journey for any pair of vertices $u,v,~u\\not= v$. We first give a simple polynomial-time algorithm to check whether a given temporal graph is temporally connected. We then consider the case i"},"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":"1502.04579","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-16T15:39:52Z","cross_cats_sorted":[],"title_canon_sha256":"dedce77faa17cf4c201f0baa259d863d18c529e88c0ede898d2473f30d90c118","abstract_canon_sha256":"ea24c9ee5074faa56e7cf26c9971a75efbdc4a23f8ba81df7730dc3f1bc5573e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:27.514616Z","signature_b64":"r1yhNo2VDHofUerYOzEVpVHC1rH/88Ab9ybQCQLUkEGxdr+sg+yqId1Knb69t3LiYfXCLUz6Xb0mHmh5UU73Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7590e65850cfd3c5c041cf6e526f33d9d4d35489eef00dd7c888697d852983cf","last_reissued_at":"2026-05-18T01:11:27.514022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:27.514022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of optimal design of temporally connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eleni C. Akrida, George B. Mertzios, Leszek Gasieniec, Paul G. Spirakis","submitted_at":"2015-02-16T15:39:52Z","abstract_excerpt":"We study the design of small cost temporally connected graphs, under various constraints. We mainly consider undirected graphs of $n$ vertices, where each edge has an associated set of discrete availability instances (labels). A journey from vertex $u$ to vertex $v$ is a path from $u$ to $v$ where successive path edges have strictly increasing labels. A graph is temporally connected iff there is a $(u,v)$-journey for any pair of vertices $u,v,~u\\not= v$. We first give a simple polynomial-time algorithm to check whether a given temporal graph is temporally connected. We then consider the case i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04579","kind":"arxiv","version":3},"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":"1502.04579","created_at":"2026-05-18T01:11:27.514110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04579v3","created_at":"2026-05-18T01:11:27.514110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04579","created_at":"2026-05-18T01:11:27.514110+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWIOMWCQZ7J4","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWIOMWCQZ7J4LQCB","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWIOMWCQ","created_at":"2026-05-18T12:29:34.919912+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/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","json":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H.json","graph_json":"https://pith.science/api/pith-number/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/graph.json","events_json":"https://pith.science/api/pith-number/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/events.json","paper":"https://pith.science/paper/OWIOMWCQ"},"agent_actions":{"view_html":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","download_json":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H.json","view_paper":"https://pith.science/paper/OWIOMWCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04579&json=true","fetch_graph":"https://pith.science/api/pith-number/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/graph.json","fetch_events":"https://pith.science/api/pith-number/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/action/storage_attestation","attest_author":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/action/author_attestation","sign_citation":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/action/citation_signature","submit_replication":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/action/replication_record"}},"created_at":"2026-05-18T01:11:27.514110+00:00","updated_at":"2026-05-18T01:11:27.514110+00:00"}