{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:G72D7URNWCWU5TANGHZGDKGMZE","short_pith_number":"pith:G72D7URN","schema_version":"1.0","canonical_sha256":"37f43fd22db0ad4ecc0d31f261a8ccc9064c8623eb816dab27120afeb7f4c56b","source":{"kind":"arxiv","id":"1802.08189","version":1},"attestation_state":"computed","paper":{"title":"Complexity of the Steiner Network Problem with Respect to the Number of Terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop, Eduard Eiben, Fahad Panolan, Ond\\v{r}ej Such\\'y","submitted_at":"2018-02-22T17:21:06Z","abstract_excerpt":"In the Directed Steiner Network problem we are given an arc-weighted digraph $G$, a set of terminals $T \\subseteq V(G)$, and an (unweighted) directed request graph $R$ with $V(R)=T$. Our task is to output a subgraph $G' \\subseteq G$ of the minimum cost such that there is a directed path from $s$ to $t$ in $G'$ for all $st \\in A(R)$.\n  It is known that the problem can be solved in time $|V(G)|^{O(|A(R)|)}$ [Feldman&Ruhl, SIAM J. Comput. 2006] and cannot be solved in time $|V(G)|^{o(|A(R)|)}$ even if $G$ is planar, unless Exponential-Time Hypothesis (ETH) fails [Chitnis et al., SODA 2014]. Howev"},"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":"1802.08189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-22T17:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"23ac2c5c394ba532247f98a490abd896d66f33439c7e7bf1c36fe8d4b8a64a9d","abstract_canon_sha256":"d498abc1e1c58fe0a231207596ff155498841275e0485958e7ccc24170b21d7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:45.310095Z","signature_b64":"Rn7kQ3JOb7oxF0MnQyMtV9I2z/0DWNapfIobGu5iTMnA6gSvYPEn+kkjiYtVIODws+zb7A03/iYCHttr8wB7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f43fd22db0ad4ecc0d31f261a8ccc9064c8623eb816dab27120afeb7f4c56b","last_reissued_at":"2026-05-18T00:22:45.309651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:45.309651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the Steiner Network Problem with Respect to the Number of Terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Du\\v{s}an Knop, Eduard Eiben, Fahad Panolan, Ond\\v{r}ej Such\\'y","submitted_at":"2018-02-22T17:21:06Z","abstract_excerpt":"In the Directed Steiner Network problem we are given an arc-weighted digraph $G$, a set of terminals $T \\subseteq V(G)$, and an (unweighted) directed request graph $R$ with $V(R)=T$. Our task is to output a subgraph $G' \\subseteq G$ of the minimum cost such that there is a directed path from $s$ to $t$ in $G'$ for all $st \\in A(R)$.\n  It is known that the problem can be solved in time $|V(G)|^{O(|A(R)|)}$ [Feldman&Ruhl, SIAM J. Comput. 2006] and cannot be solved in time $|V(G)|^{o(|A(R)|)}$ even if $G$ is planar, unless Exponential-Time Hypothesis (ETH) fails [Chitnis et al., SODA 2014]. Howev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08189","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":"1802.08189","created_at":"2026-05-18T00:22:45.309722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08189v1","created_at":"2026-05-18T00:22:45.309722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08189","created_at":"2026-05-18T00:22:45.309722+00:00"},{"alias_kind":"pith_short_12","alias_value":"G72D7URNWCWU","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"G72D7URNWCWU5TAN","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"G72D7URN","created_at":"2026-05-18T12:32:25.280505+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/G72D7URNWCWU5TANGHZGDKGMZE","json":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE.json","graph_json":"https://pith.science/api/pith-number/G72D7URNWCWU5TANGHZGDKGMZE/graph.json","events_json":"https://pith.science/api/pith-number/G72D7URNWCWU5TANGHZGDKGMZE/events.json","paper":"https://pith.science/paper/G72D7URN"},"agent_actions":{"view_html":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE","download_json":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE.json","view_paper":"https://pith.science/paper/G72D7URN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08189&json=true","fetch_graph":"https://pith.science/api/pith-number/G72D7URNWCWU5TANGHZGDKGMZE/graph.json","fetch_events":"https://pith.science/api/pith-number/G72D7URNWCWU5TANGHZGDKGMZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/action/storage_attestation","attest_author":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/action/author_attestation","sign_citation":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/action/citation_signature","submit_replication":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/action/replication_record"}},"created_at":"2026-05-18T00:22:45.309722+00:00","updated_at":"2026-05-18T00:22:45.309722+00:00"}