{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:AAFWGAQ32XDJUJOQUQYCBFWTPO","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":"4f0e4706f2524b188e0bd8319b14038ae1e62d82d9778f53c52fcd81ebadc554","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-06-30T12:30:32Z","title_canon_sha256":"dfb7218c6a0b1e45593f7dd87a873a8482be6081076d6a680b25a49843e4f983"},"schema_version":"1.0","source":{"id":"2106.16015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.16015","created_at":"2026-07-05T02:54:02Z"},{"alias_kind":"arxiv_version","alias_value":"2106.16015v1","created_at":"2026-07-05T02:54:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.16015","created_at":"2026-07-05T02:54:02Z"},{"alias_kind":"pith_short_12","alias_value":"AAFWGAQ32XDJ","created_at":"2026-07-05T02:54:02Z"},{"alias_kind":"pith_short_16","alias_value":"AAFWGAQ32XDJUJOQ","created_at":"2026-07-05T02:54:02Z"},{"alias_kind":"pith_short_8","alias_value":"AAFWGAQ3","created_at":"2026-07-05T02:54:02Z"}],"graph_snapshots":[{"event_id":"sha256:2b365db13f64e9fa46a4c6543994a2784878844bc52ccc106f576ebb2923f8c4","target":"graph","created_at":"2026-07-05T02:54:02Z","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/2106.16015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a number of problems related to the classic Feedback Vertex Set (FVS) problem do not admit a $2^{o(k \\log k)} \\cdot n^{\\mathcal{O}(1)}$-time algorithm on graphs of treewidth at most $k$, assuming the Exponential Time Hypothesis. This contrasts with the $3^{k} \\cdot k^{\\mathcal{O}(1)} \\cdot n$-time algorithm for FVS using the Cut&Count technique.\n  During their live talk at IPEC 2020, Bergougnoux et al.~posed a number of open questions, which we answer in this work.\n  - Subset Even Cycle Transversal, Subset Odd Cycle Transversal,","authors_text":"Hugo Jacob, Marcin Pilipczuk, Oscar Defrain, Thomas Bellitto","cross_cats":["cs.CC","cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-06-30T12:30:32Z","title":"Close relatives (of Feedback Vertex Set), revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.16015","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:c10f279df762c11ecd650bda810e04afc9b2d612e3962e75285b08814f8bcb9c","target":"record","created_at":"2026-07-05T02:54:02Z","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":"4f0e4706f2524b188e0bd8319b14038ae1e62d82d9778f53c52fcd81ebadc554","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-06-30T12:30:32Z","title_canon_sha256":"dfb7218c6a0b1e45593f7dd87a873a8482be6081076d6a680b25a49843e4f983"},"schema_version":"1.0","source":{"id":"2106.16015","kind":"arxiv","version":1}},"canonical_sha256":"000b63021bd5c69a25d0a4302096d37ba5c1cbd1cf3109ffcb6f22ff6d9a0a75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"000b63021bd5c69a25d0a4302096d37ba5c1cbd1cf3109ffcb6f22ff6d9a0a75","first_computed_at":"2026-07-05T02:54:02.412780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:54:02.412780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t81Sf7bDBZdntp9NVZpxRZ96s5tJKSiuoQ1oI1d/oCMuZ2uQERlbnRZk0o3GiOrY3ELppp6DIAmTLUKKaFwcDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:54:02.413154Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.16015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c10f279df762c11ecd650bda810e04afc9b2d612e3962e75285b08814f8bcb9c","sha256:2b365db13f64e9fa46a4c6543994a2784878844bc52ccc106f576ebb2923f8c4"],"state_sha256":"7fb6269479235cfff52887dda368f6a5242d7716a5f9aa23a04837bd8432de90"}