{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AAFWGAQ32XDJUJOQUQYCBFWTPO","short_pith_number":"pith:AAFWGAQ3","schema_version":"1.0","canonical_sha256":"000b63021bd5c69a25d0a4302096d37ba5c1cbd1cf3109ffcb6f22ff6d9a0a75","source":{"kind":"arxiv","id":"2106.16015","version":1},"attestation_state":"computed","paper":{"title":"Close relatives (of Feedback Vertex Set), revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Hugo Jacob, Marcin Pilipczuk, Oscar Defrain, Thomas Bellitto","submitted_at":"2021-06-30T12:30:32Z","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,"},"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":"2106.16015","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2021-06-30T12:30:32Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"dfb7218c6a0b1e45593f7dd87a873a8482be6081076d6a680b25a49843e4f983","abstract_canon_sha256":"4f0e4706f2524b188e0bd8319b14038ae1e62d82d9778f53c52fcd81ebadc554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:02.413154Z","signature_b64":"t81Sf7bDBZdntp9NVZpxRZ96s5tJKSiuoQ1oI1d/oCMuZ2uQERlbnRZk0o3GiOrY3ELppp6DIAmTLUKKaFwcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"000b63021bd5c69a25d0a4302096d37ba5c1cbd1cf3109ffcb6f22ff6d9a0a75","last_reissued_at":"2026-07-05T02:54:02.412780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:02.412780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Close relatives (of Feedback Vertex Set), revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Hugo Jacob, Marcin Pilipczuk, Oscar Defrain, Thomas Bellitto","submitted_at":"2021-06-30T12:30:32Z","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,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.16015","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.16015/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.16015","created_at":"2026-07-05T02:54:02.412838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.16015v1","created_at":"2026-07-05T02:54:02.412838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.16015","created_at":"2026-07-05T02:54:02.412838+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAFWGAQ32XDJ","created_at":"2026-07-05T02:54:02.412838+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAFWGAQ32XDJUJOQ","created_at":"2026-07-05T02:54:02.412838+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAFWGAQ3","created_at":"2026-07-05T02:54:02.412838+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/AAFWGAQ32XDJUJOQUQYCBFWTPO","json":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO.json","graph_json":"https://pith.science/api/pith-number/AAFWGAQ32XDJUJOQUQYCBFWTPO/graph.json","events_json":"https://pith.science/api/pith-number/AAFWGAQ32XDJUJOQUQYCBFWTPO/events.json","paper":"https://pith.science/paper/AAFWGAQ3"},"agent_actions":{"view_html":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO","download_json":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO.json","view_paper":"https://pith.science/paper/AAFWGAQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.16015&json=true","fetch_graph":"https://pith.science/api/pith-number/AAFWGAQ32XDJUJOQUQYCBFWTPO/graph.json","fetch_events":"https://pith.science/api/pith-number/AAFWGAQ32XDJUJOQUQYCBFWTPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO/action/storage_attestation","attest_author":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO/action/author_attestation","sign_citation":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO/action/citation_signature","submit_replication":"https://pith.science/pith/AAFWGAQ32XDJUJOQUQYCBFWTPO/action/replication_record"}},"created_at":"2026-07-05T02:54:02.412838+00:00","updated_at":"2026-07-05T02:54:02.412838+00:00"}