{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:U4KDRSROM6MWKALS5JR77KWCDP","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":"c204862be0592ea142147924ee9d389c21eee14054b1d3879a1f9fde747ea1bd","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-01T16:36:43Z","title_canon_sha256":"51c0b2ad2cd2fc570d3b282b29ea6cf4abe8f9eb94c743701292eac590339c69"},"schema_version":"1.0","source":{"id":"1908.00491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00491","created_at":"2026-07-04T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00491v1","created_at":"2026-07-04T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00491","created_at":"2026-07-04T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"U4KDRSROM6MW","created_at":"2026-07-04T23:51:01Z"},{"alias_kind":"pith_short_16","alias_value":"U4KDRSROM6MWKALS","created_at":"2026-07-04T23:51:01Z"},{"alias_kind":"pith_short_8","alias_value":"U4KDRSRO","created_at":"2026-07-04T23:51:01Z"}],"graph_snapshots":[{"event_id":"sha256:227808233c149142f3a3263d4bc34c4b18ce06f89ab9ec59c1d8afd808e8ebdc","target":"graph","created_at":"2026-07-04T23:51:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.00491/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is $H$-free if it contains no induced subgraph isomorphic to $H$. We prove new complexity results for the two classical cycle transversal problems Feedback Vertex Set and Odd Cycle Transversal by showing that they can be solved in polynomial time on $(sP_1+P_3)$-free graphs for every integer $s\\geq 1$. We show the same result for the variants Connected Feedback Vertex Set and Connected Odd Cycle Transversal. We also prove that the latter two problems are polynomial-time solvable on cographs; this was already known for Feedback Vertex Set and Odd Cycle Transversal. We complement these r","authors_text":"Carl Feghali, Dani\\\"el Paulusma, Giacomo Paesani, Konrad K. Dabrowski, Matthew Johnson, Pawe{\\l} Rz\\k{a}\\.zewski","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-01T16:36:43Z","title":"On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00491","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:ff729ec0ea47fe5a121a5ec40e4de0e5e5189e0c3a4104fe1f841e434262c918","target":"record","created_at":"2026-07-04T23:51:01Z","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":"c204862be0592ea142147924ee9d389c21eee14054b1d3879a1f9fde747ea1bd","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-01T16:36:43Z","title_canon_sha256":"51c0b2ad2cd2fc570d3b282b29ea6cf4abe8f9eb94c743701292eac590339c69"},"schema_version":"1.0","source":{"id":"1908.00491","kind":"arxiv","version":1}},"canonical_sha256":"a71438ca2e6799650172ea63ffaac21bdb613d5ba558f0d0bc0703e9fc416de4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a71438ca2e6799650172ea63ffaac21bdb613d5ba558f0d0bc0703e9fc416de4","first_computed_at":"2026-07-04T23:51:01.065876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:01.065876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8y8M0O2Q49s2ibo7M0+STBDIXWqDq/hxrlnQm08ZzvmR3CDC/gWSLLbjeaivHfNo16ao8QkZAuNPBnNTf+XcDg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:01.066223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff729ec0ea47fe5a121a5ec40e4de0e5e5189e0c3a4104fe1f841e434262c918","sha256:227808233c149142f3a3263d4bc34c4b18ce06f89ab9ec59c1d8afd808e8ebdc"],"state_sha256":"8ad92438c56d2bc23df7c4e8fb2d5f3bfe6a6aa2fe3ec4164e0cbc83ab88d432"}