{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IVTWPG2FLXKYZWHK3MH7SYJ3HG","short_pith_number":"pith:IVTWPG2F","canonical_record":{"source":{"id":"1707.01470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:07:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0d44308410acb98533a0abfa34552d3d057e9de5a0933030e8d1c96792abe41e","abstract_canon_sha256":"4d50ef1d2d8a9a51563e9be9101c11a19e70fab46cfd61d9fda39c7d8f733b46"},"schema_version":"1.0"},"canonical_sha256":"4567679b455dd58cd8eadb0ff9613b39810ce9d4b5ea6508a22f2b19cff7021a","source":{"kind":"arxiv","id":"1707.01470","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01470","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01470v2","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01470","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"IVTWPG2FLXKY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IVTWPG2FLXKYZWHK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IVTWPG2F","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IVTWPG2FLXKYZWHK3MH7SYJ3HG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:07:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0d44308410acb98533a0abfa34552d3d057e9de5a0933030e8d1c96792abe41e","abstract_canon_sha256":"4d50ef1d2d8a9a51563e9be9101c11a19e70fab46cfd61d9fda39c7d8f733b46"},"schema_version":"1.0"},"canonical_sha256":"4567679b455dd58cd8eadb0ff9613b39810ce9d4b5ea6508a22f2b19cff7021a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:13.570476Z","signature_b64":"c9AUd8KYwtnyg4sxxOvOAsENZY1sv+RK+nCqxcgB0Q+tb127Qyjx7dI+Ao7SNpUMtKierxDf1eAB25eWVqMqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4567679b455dd58cd8eadb0ff9613b39810ce9d4b5ea6508a22f2b19cff7021a","last_reissued_at":"2026-05-18T00:35:13.569856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:13.569856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01470","source_version":2,"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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ysK2z+T4Mt63CrgkL8vXJVzcU0x5flrbPzzUsxgwHAIyhxRb/YF92ZFKl2k9l3uSGFdA96JH9L30MbDBbuIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:10:16.292098Z"},"content_sha256":"8103d8102d2833533bb182c609310b37381e9fc1466980808270547f158d3c47","schema_version":"1.0","event_id":"sha256:8103d8102d2833533bb182c609310b37381e9fc1466980808270547f158d3c47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IVTWPG2FLXKYZWHK3MH7SYJ3HG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Directed Feedback Vertex Set parameterized by treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Arkadiusz Soca{\\l}a, Jesper Nederlof, {\\L}ukasz Kowalik, Marcin Wrochna, Marthe Bonamy, Micha{\\l} Pilipczuk","submitted_at":"2017-07-05T17:07:50Z","abstract_excerpt":"We study the Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot be solved in time $2^{o(t\\log t)}\\cdot n^{\\mathcal{O}(1)}$ on general directed graphs, where $t$ is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time $2^{\\mathcal{O}(t\\log t)}\\cdot n^{\\mathcal{O}(1)}$. On the other hand, we show that if the input digraph is planar, then the running time can be improved to $2^{\\mathcal{O}(t)}\\cdot n^{\\mathcal{O}(1)}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01470","kind":"arxiv","version":2},"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:35:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dc1C6GLaZ87FUwhgr8mia6ZR7o0RlVBq1sANh2dF/1RVNzBAH4g4QcwHzhN9K6lWzzqrpvct7pMAC1V6wqn4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:10:16.292856Z"},"content_sha256":"9459f403cb46cdf048b8cd1160f8d5dbe93ef46368309cdd085b88326b3ce445","schema_version":"1.0","event_id":"sha256:9459f403cb46cdf048b8cd1160f8d5dbe93ef46368309cdd085b88326b3ce445"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVTWPG2FLXKYZWHK3MH7SYJ3HG/bundle.json","state_url":"https://pith.science/pith/IVTWPG2FLXKYZWHK3MH7SYJ3HG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVTWPG2FLXKYZWHK3MH7SYJ3HG/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-28T22:10:16Z","links":{"resolver":"https://pith.science/pith/IVTWPG2FLXKYZWHK3MH7SYJ3HG","bundle":"https://pith.science/pith/IVTWPG2FLXKYZWHK3MH7SYJ3HG/bundle.json","state":"https://pith.science/pith/IVTWPG2FLXKYZWHK3MH7SYJ3HG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVTWPG2FLXKYZWHK3MH7SYJ3HG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IVTWPG2FLXKYZWHK3MH7SYJ3HG","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":"4d50ef1d2d8a9a51563e9be9101c11a19e70fab46cfd61d9fda39c7d8f733b46","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:07:50Z","title_canon_sha256":"0d44308410acb98533a0abfa34552d3d057e9de5a0933030e8d1c96792abe41e"},"schema_version":"1.0","source":{"id":"1707.01470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01470","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01470v2","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01470","created_at":"2026-05-18T00:35:13Z"},{"alias_kind":"pith_short_12","alias_value":"IVTWPG2FLXKY","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IVTWPG2FLXKYZWHK","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IVTWPG2F","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:9459f403cb46cdf048b8cd1160f8d5dbe93ef46368309cdd085b88326b3ce445","target":"graph","created_at":"2026-05-18T00:35:13Z","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 Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot be solved in time $2^{o(t\\log t)}\\cdot n^{\\mathcal{O}(1)}$ on general directed graphs, where $t$ is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time $2^{\\mathcal{O}(t\\log t)}\\cdot n^{\\mathcal{O}(1)}$. On the other hand, we show that if the input digraph is planar, then the running time can be improved to $2^{\\mathcal{O}(t)}\\cdot n^{\\mathcal{O}(1)}$","authors_text":"Arkadiusz Soca{\\l}a, Jesper Nederlof, {\\L}ukasz Kowalik, Marcin Wrochna, Marthe Bonamy, Micha{\\l} Pilipczuk","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:07:50Z","title":"On Directed Feedback Vertex Set parameterized by treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01470","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:8103d8102d2833533bb182c609310b37381e9fc1466980808270547f158d3c47","target":"record","created_at":"2026-05-18T00:35:13Z","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":"4d50ef1d2d8a9a51563e9be9101c11a19e70fab46cfd61d9fda39c7d8f733b46","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-05T17:07:50Z","title_canon_sha256":"0d44308410acb98533a0abfa34552d3d057e9de5a0933030e8d1c96792abe41e"},"schema_version":"1.0","source":{"id":"1707.01470","kind":"arxiv","version":2}},"canonical_sha256":"4567679b455dd58cd8eadb0ff9613b39810ce9d4b5ea6508a22f2b19cff7021a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4567679b455dd58cd8eadb0ff9613b39810ce9d4b5ea6508a22f2b19cff7021a","first_computed_at":"2026-05-18T00:35:13.569856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:13.569856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c9AUd8KYwtnyg4sxxOvOAsENZY1sv+RK+nCqxcgB0Q+tb127Qyjx7dI+Ao7SNpUMtKierxDf1eAB25eWVqMqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:13.570476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8103d8102d2833533bb182c609310b37381e9fc1466980808270547f158d3c47","sha256:9459f403cb46cdf048b8cd1160f8d5dbe93ef46368309cdd085b88326b3ce445"],"state_sha256":"5b063c823ef934ab6c8c41dead74ecaeafde1c9a4bf3ee709675ee9656a27cc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59PzQr63hZB/Xa32CAlARisT+Ah/7p8rVozTx4X7TSiXbuxH7ojQ30fZKiKLcZ/KnR3Bxn2Anrgv0/uzZBNgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:10:16.296726Z","bundle_sha256":"7a9217aa151890fc786ca3adcea7d442ae24ab642047ffd3608778876fe43117"}}