{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","short_pith_number":"pith:OWIOMWCQ","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"},"canonical_sha256":"7590e65850cfd3c5c041cf6e526f33d9d4d35489eef00dd7c888697d852983cf","source":{"kind":"arxiv","id":"1502.04579","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04579","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04579v3","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04579","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"pith_short_12","alias_value":"OWIOMWCQZ7J4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OWIOMWCQZ7J4LQCB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OWIOMWCQ","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","target":"record","payload":{"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"},"canonical_sha256":"7590e65850cfd3c5c041cf6e526f33d9d4d35489eef00dd7c888697d852983cf","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"},"source_kind":"arxiv","source_id":"1502.04579","source_version":3,"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-18T01:11:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pujf565DvYIe0iValMYzvJKL3UERywR0OLa42qyGEFu1W60HYgXO/2UbVPlgc41fK6sPgHZszgY1JdSIBuKBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:26:45.039680Z"},"content_sha256":"ccfce0a083534e7e8f98cab420027c4023b2ccc62a673a4940e0afea432139c3","schema_version":"1.0","event_id":"sha256:ccfce0a083534e7e8f98cab420027c4023b2ccc62a673a4940e0afea432139c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","target":"graph","payload":{"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"},"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-18T01:11:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1Y8jdzJmom1yI8BygAJfJi8FGBxiH4oUtzrhRpy4JNKu2YPzqh6CYG2dOlRueU3G4Ew2R4zCUYlOY5n9Ph0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:26:45.040498Z"},"content_sha256":"d9b41fe6038fec1be0665484ce739d0f81b434b08fd9e7625ee880a72f1a4580","schema_version":"1.0","event_id":"sha256:d9b41fe6038fec1be0665484ce739d0f81b434b08fd9e7625ee880a72f1a4580"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/bundle.json","state_url":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/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-05-31T19:26:45Z","links":{"resolver":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","bundle":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/bundle.json","state":"https://pith.science/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWIOMWCQZ7J4LQCBZ5XFE3ZT3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OWIOMWCQZ7J4LQCBZ5XFE3ZT3H","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":"ea24c9ee5074faa56e7cf26c9971a75efbdc4a23f8ba81df7730dc3f1bc5573e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-16T15:39:52Z","title_canon_sha256":"dedce77faa17cf4c201f0baa259d863d18c529e88c0ede898d2473f30d90c118"},"schema_version":"1.0","source":{"id":"1502.04579","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04579","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04579v3","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04579","created_at":"2026-05-18T01:11:27Z"},{"alias_kind":"pith_short_12","alias_value":"OWIOMWCQZ7J4","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OWIOMWCQZ7J4LQCB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OWIOMWCQ","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:d9b41fe6038fec1be0665484ce739d0f81b434b08fd9e7625ee880a72f1a4580","target":"graph","created_at":"2026-05-18T01:11:27Z","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 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","authors_text":"Eleni C. Akrida, George B. Mertzios, Leszek Gasieniec, Paul G. Spirakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-16T15:39:52Z","title":"The complexity of optimal design of temporally connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04579","kind":"arxiv","version":3},"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:ccfce0a083534e7e8f98cab420027c4023b2ccc62a673a4940e0afea432139c3","target":"record","created_at":"2026-05-18T01:11:27Z","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":"ea24c9ee5074faa56e7cf26c9971a75efbdc4a23f8ba81df7730dc3f1bc5573e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-16T15:39:52Z","title_canon_sha256":"dedce77faa17cf4c201f0baa259d863d18c529e88c0ede898d2473f30d90c118"},"schema_version":"1.0","source":{"id":"1502.04579","kind":"arxiv","version":3}},"canonical_sha256":"7590e65850cfd3c5c041cf6e526f33d9d4d35489eef00dd7c888697d852983cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7590e65850cfd3c5c041cf6e526f33d9d4d35489eef00dd7c888697d852983cf","first_computed_at":"2026-05-18T01:11:27.514022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:27.514022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r1yhNo2VDHofUerYOzEVpVHC1rH/88Ab9ybQCQLUkEGxdr+sg+yqId1Knb69t3LiYfXCLUz6Xb0mHmh5UU73Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:27.514616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04579","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccfce0a083534e7e8f98cab420027c4023b2ccc62a673a4940e0afea432139c3","sha256:d9b41fe6038fec1be0665484ce739d0f81b434b08fd9e7625ee880a72f1a4580"],"state_sha256":"d6ac33502a3b3f2975579dfb5c73a349d33d8ec4bd935ec603d75d2a8b812862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TrGeyJE7vya/wgiMdcroXJ22APFANDABY8qnMsOG1ZZ7OuyMup9PZbeVayVvOcTcOjxy641H415t9jsFG1erAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:26:45.044820Z","bundle_sha256":"a16cf7e0750dfa17e33ec3db2ae7cbb21aaa1c2bef72422750d51625866fc692"}}