{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:G72D7URNWCWU5TANGHZGDKGMZE","short_pith_number":"pith:G72D7URN","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"},"canonical_sha256":"37f43fd22db0ad4ecc0d31f261a8ccc9064c8623eb816dab27120afeb7f4c56b","source":{"kind":"arxiv","id":"1802.08189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08189","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08189v1","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08189","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"G72D7URNWCWU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G72D7URNWCWU5TAN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G72D7URN","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:G72D7URNWCWU5TANGHZGDKGMZE","target":"record","payload":{"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"},"canonical_sha256":"37f43fd22db0ad4ecc0d31f261a8ccc9064c8623eb816dab27120afeb7f4c56b","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"},"source_kind":"arxiv","source_id":"1802.08189","source_version":1,"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-18T00:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"foOD8BMSfbY07pISIZKXMEYeKDGfQAZLJ89awf7dgOCxYpIAaruB6ExeD7VsOeb7/Gc7TSF4taeP6+pr7wBRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:27:28.080698Z"},"content_sha256":"a46cbf7d8c7f8758e3c3be7b5f93bd8012e997a9af726d871f09a1976373c6cd","schema_version":"1.0","event_id":"sha256:a46cbf7d8c7f8758e3c3be7b5f93bd8012e997a9af726d871f09a1976373c6cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:G72D7URNWCWU5TANGHZGDKGMZE","target":"graph","payload":{"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"},"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-18T00:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nT663tiup2dbMinaE8wHMWPJelZEtL25FIUvlSQK1qFWstBurSv2NLR2d55sG35MVY6VJgK0CvCYA2zAhjeDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:27:28.081048Z"},"content_sha256":"bdd74c07d57d401dd25ad7241505134a342670641b97a2c9b81593578d43c18d","schema_version":"1.0","event_id":"sha256:bdd74c07d57d401dd25ad7241505134a342670641b97a2c9b81593578d43c18d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/bundle.json","state_url":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G72D7URNWCWU5TANGHZGDKGMZE/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-06-22T12:27:28Z","links":{"resolver":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE","bundle":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/bundle.json","state":"https://pith.science/pith/G72D7URNWCWU5TANGHZGDKGMZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G72D7URNWCWU5TANGHZGDKGMZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:G72D7URNWCWU5TANGHZGDKGMZE","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":"d498abc1e1c58fe0a231207596ff155498841275e0485958e7ccc24170b21d7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-22T17:21:06Z","title_canon_sha256":"23ac2c5c394ba532247f98a490abd896d66f33439c7e7bf1c36fe8d4b8a64a9d"},"schema_version":"1.0","source":{"id":"1802.08189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08189","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08189v1","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08189","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"G72D7URNWCWU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"G72D7URNWCWU5TAN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"G72D7URN","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:bdd74c07d57d401dd25ad7241505134a342670641b97a2c9b81593578d43c18d","target":"graph","created_at":"2026-05-18T00:22:45Z","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":"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","authors_text":"Du\\v{s}an Knop, Eduard Eiben, Fahad Panolan, Ond\\v{r}ej Such\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-22T17:21:06Z","title":"Complexity of the Steiner Network Problem with Respect to the Number of Terminals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08189","kind":"arxiv","version":1},"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:a46cbf7d8c7f8758e3c3be7b5f93bd8012e997a9af726d871f09a1976373c6cd","target":"record","created_at":"2026-05-18T00:22:45Z","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":"d498abc1e1c58fe0a231207596ff155498841275e0485958e7ccc24170b21d7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-22T17:21:06Z","title_canon_sha256":"23ac2c5c394ba532247f98a490abd896d66f33439c7e7bf1c36fe8d4b8a64a9d"},"schema_version":"1.0","source":{"id":"1802.08189","kind":"arxiv","version":1}},"canonical_sha256":"37f43fd22db0ad4ecc0d31f261a8ccc9064c8623eb816dab27120afeb7f4c56b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37f43fd22db0ad4ecc0d31f261a8ccc9064c8623eb816dab27120afeb7f4c56b","first_computed_at":"2026-05-18T00:22:45.309651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:45.309651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rn7kQ3JOb7oxF0MnQyMtV9I2z/0DWNapfIobGu5iTMnA6gSvYPEn+kkjiYtVIODws+zb7A03/iYCHttr8wB7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:45.310095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a46cbf7d8c7f8758e3c3be7b5f93bd8012e997a9af726d871f09a1976373c6cd","sha256:bdd74c07d57d401dd25ad7241505134a342670641b97a2c9b81593578d43c18d"],"state_sha256":"a8da9058d582c4e8cfb53980257c0b67fdfc01dee48cac58dd44cb28cd2509b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUcwRsST/3PfPZwK33y8/Bl04nKqHhqh8FTnXmaDNyMOOpBexR+rPhsgI/f1nppVsU4ypTvjoPodyo9FdPvQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:27:28.083009Z","bundle_sha256":"b01a421c2eb3ce95387bcc157219365e69bbbd0f4ecbc439da442270a34ea029"}}