{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TEJ5HLQ6FYCWC5FN4DTDGL7U3X","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":"fd332e75305755f5e0b22ba64b2ecaeb2819f4e27ec9263516028af81ae6ab3e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-16T06:49:22Z","title_canon_sha256":"a61798c91ed20575303c583ef7be82748790761a81fe8c20b4eebb2a479dcca2"},"schema_version":"1.0","source":{"id":"1609.04918","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04918","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04918v2","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04918","created_at":"2026-05-18T00:36:14Z"},{"alias_kind":"pith_short_12","alias_value":"TEJ5HLQ6FYCW","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TEJ5HLQ6FYCWC5FN","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TEJ5HLQ6","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:84a69c7abd38f69e5e7e6390b25410efbe6b126e870317a58697cc9fead89249","target":"graph","created_at":"2026-05-18T00:36:14Z","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 introduce a temporal Steiner network problem in which a graph, as well as changes to its edges and/or vertices over a set of discrete times, are given as input; the goal is to find a minimal subgraph satisfying a set of $k$ time-sensitive connectivity demands. We show that this problem, $k$-Temporal Steiner Network ($k$-TSN), is NP-hard to approximate to a factor of $k - \\epsilon$, for every fixed $k \\geq 2$ and $\\epsilon > 0$. This bound is tight, as certified by a trivial approximation algorithm. Conceptually this demonstrates, in contrast to known results for traditional Steiner problems","authors_text":"Alex Khodaverdian, Benjamin Weitz, Jimmy Wu, Nir Yosef","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-16T06:49:22Z","title":"Steiner Network Problems on Temporal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04918","kind":"arxiv","version":2},"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:06f0586bc8e55f25985c4543841647effe6dfdf131e8edd80f455c2039e49b9a","target":"record","created_at":"2026-05-18T00:36:14Z","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":"fd332e75305755f5e0b22ba64b2ecaeb2819f4e27ec9263516028af81ae6ab3e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-16T06:49:22Z","title_canon_sha256":"a61798c91ed20575303c583ef7be82748790761a81fe8c20b4eebb2a479dcca2"},"schema_version":"1.0","source":{"id":"1609.04918","kind":"arxiv","version":2}},"canonical_sha256":"9913d3ae1e2e056174ade0e6332ff4ddf9dda4a6aed96a05466a6e3977a8d096","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9913d3ae1e2e056174ade0e6332ff4ddf9dda4a6aed96a05466a6e3977a8d096","first_computed_at":"2026-05-18T00:36:14.420237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:14.420237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uQCixKcN8emNAGhRh6iu1pHHuzBwv1M74uXtAigIB8aI9cKgwNWIGHzlLrhWrFx8xtw4Vg3rkiq084mk4x4XCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:14.420883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04918","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06f0586bc8e55f25985c4543841647effe6dfdf131e8edd80f455c2039e49b9a","sha256:84a69c7abd38f69e5e7e6390b25410efbe6b126e870317a58697cc9fead89249"],"state_sha256":"ecf85f4c8982bff15cc416ca2f87774318041aa1ad065632a34d4a72a63c98d1"}