{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4VKK6WSNK75JKTCGTIAD2XVIJM","short_pith_number":"pith:4VKK6WSN","schema_version":"1.0","canonical_sha256":"e554af5a4d57fa954c469a003d5ea84b29497656ad4f11b721ab298a9bba6c8f","source":{"kind":"arxiv","id":"1602.06411","version":1},"attestation_state":"computed","paper":{"title":"On the Size and the Approximability of Minimum Temporally Connected Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitris Fotakis, Kyriakos Axiotis","submitted_at":"2016-02-20T14:24:13Z","abstract_excerpt":"We consider temporal graphs with discrete time labels and investigate the size and the approximability of minimum temporally connected spanning subgraphs. We present a family of minimally connected temporal graphs with $n$ vertices and $\\Omega(n^2)$ edges, thus resolving an open question of (Kempe, Kleinberg, Kumar, JCSS 64, 2002) about the existence of sparse temporal connectivity certificates. Next, we consider the problem of computing a minimum weight subset of temporal edges that preserve connectivity of a given temporal graph either from a given vertex r (r-MTC problem) or among all verte"},"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":"1602.06411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-20T14:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"9846173185c40de9635e507b57eb101a3cf47ab113e59b99711c45d286a9a128","abstract_canon_sha256":"5b3b717d13e64983f6c091c5db06bae6972df871ad8141f9eb0bd1e86a47292e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:14.108052Z","signature_b64":"yt7HXlbYwRQRoeU3ZbcmqaOQsUTqDDQE3jTTRs9fxc0l16edPokXzxg2tFj/RvI8fo3+dQybkbjQZqLXQ9emDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e554af5a4d57fa954c469a003d5ea84b29497656ad4f11b721ab298a9bba6c8f","last_reissued_at":"2026-05-18T01:20:14.107355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:14.107355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Size and the Approximability of Minimum Temporally Connected Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitris Fotakis, Kyriakos Axiotis","submitted_at":"2016-02-20T14:24:13Z","abstract_excerpt":"We consider temporal graphs with discrete time labels and investigate the size and the approximability of minimum temporally connected spanning subgraphs. We present a family of minimally connected temporal graphs with $n$ vertices and $\\Omega(n^2)$ edges, thus resolving an open question of (Kempe, Kleinberg, Kumar, JCSS 64, 2002) about the existence of sparse temporal connectivity certificates. Next, we consider the problem of computing a minimum weight subset of temporal edges that preserve connectivity of a given temporal graph either from a given vertex r (r-MTC problem) or among all verte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06411","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":"1602.06411","created_at":"2026-05-18T01:20:14.107458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06411v1","created_at":"2026-05-18T01:20:14.107458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06411","created_at":"2026-05-18T01:20:14.107458+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VKK6WSNK75J","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VKK6WSNK75JKTCG","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VKK6WSN","created_at":"2026-05-18T12:29:58.707656+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/4VKK6WSNK75JKTCGTIAD2XVIJM","json":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM.json","graph_json":"https://pith.science/api/pith-number/4VKK6WSNK75JKTCGTIAD2XVIJM/graph.json","events_json":"https://pith.science/api/pith-number/4VKK6WSNK75JKTCGTIAD2XVIJM/events.json","paper":"https://pith.science/paper/4VKK6WSN"},"agent_actions":{"view_html":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM","download_json":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM.json","view_paper":"https://pith.science/paper/4VKK6WSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06411&json=true","fetch_graph":"https://pith.science/api/pith-number/4VKK6WSNK75JKTCGTIAD2XVIJM/graph.json","fetch_events":"https://pith.science/api/pith-number/4VKK6WSNK75JKTCGTIAD2XVIJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM/action/storage_attestation","attest_author":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM/action/author_attestation","sign_citation":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM/action/citation_signature","submit_replication":"https://pith.science/pith/4VKK6WSNK75JKTCGTIAD2XVIJM/action/replication_record"}},"created_at":"2026-05-18T01:20:14.107458+00:00","updated_at":"2026-05-18T01:20:14.107458+00:00"}