{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5UVOP43F2JQJIJ25ZB57TENZ4K","short_pith_number":"pith:5UVOP43F","schema_version":"1.0","canonical_sha256":"ed2ae7f365d26094275dc87bf991b9e2b2019ae82a0de41c41bc975f92e237f3","source":{"kind":"arxiv","id":"2212.04726","version":4},"attestation_state":"computed","paper":{"title":"Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao, Tian Bai","submitted_at":"2022-12-09T08:48:32Z","abstract_excerpt":"The Subset Feedback Vertex Set problem (SFVS), to delete $k$ vertices from a given graph such that any vertex in a vertex subset (called a terminal set) is not in a cycle in the remaining graph, generalizes the famous Feedback Vertex Set problem and Multiway Cut problem. SFVS remains NP-hard even in split and chordal graphs, and SFVS in Chordal Graphs (SFVS-C) can be considered as an implicit 3-Hitting Set problem. However, it is not easy to solve SFVS-C faster than 3-Hitting Set. In 2019, Philip, Rajan, Saurabh, and Tale (Algorithmica 2019) proved that SFVS-C can be solved in $\\mathcal{O}^{*}"},"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":"2212.04726","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-12-09T08:48:32Z","cross_cats_sorted":[],"title_canon_sha256":"5b87077ea917f37bc318063cf78ed547f61a0dd4b99e576bf9560411fd27728d","abstract_canon_sha256":"64bc665a372e31568e4ee05fd7b32251aac8a332a530f46c7d58e6ba197fafe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:19.944437Z","signature_b64":"n0RHz+sb165Pfm1G0Bpy85fuTKaXVUbHlvDAAWg7TXpL/FDVFTKJrldYyokhJhSbO/0QWToII2y2SBSsXQKtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed2ae7f365d26094275dc87bf991b9e2b2019ae82a0de41c41bc975f92e237f3","last_reissued_at":"2026-07-05T09:56:19.944007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:19.944007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mingyu Xiao, Tian Bai","submitted_at":"2022-12-09T08:48:32Z","abstract_excerpt":"The Subset Feedback Vertex Set problem (SFVS), to delete $k$ vertices from a given graph such that any vertex in a vertex subset (called a terminal set) is not in a cycle in the remaining graph, generalizes the famous Feedback Vertex Set problem and Multiway Cut problem. SFVS remains NP-hard even in split and chordal graphs, and SFVS in Chordal Graphs (SFVS-C) can be considered as an implicit 3-Hitting Set problem. However, it is not easy to solve SFVS-C faster than 3-Hitting Set. In 2019, Philip, Rajan, Saurabh, and Tale (Algorithmica 2019) proved that SFVS-C can be solved in $\\mathcal{O}^{*}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.04726","kind":"arxiv","version":4},"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/2212.04726/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":"2212.04726","created_at":"2026-07-05T09:56:19.944063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.04726v4","created_at":"2026-07-05T09:56:19.944063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.04726","created_at":"2026-07-05T09:56:19.944063+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UVOP43F2JQJ","created_at":"2026-07-05T09:56:19.944063+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UVOP43F2JQJIJ25","created_at":"2026-07-05T09:56:19.944063+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UVOP43F","created_at":"2026-07-05T09:56:19.944063+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/5UVOP43F2JQJIJ25ZB57TENZ4K","json":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K.json","graph_json":"https://pith.science/api/pith-number/5UVOP43F2JQJIJ25ZB57TENZ4K/graph.json","events_json":"https://pith.science/api/pith-number/5UVOP43F2JQJIJ25ZB57TENZ4K/events.json","paper":"https://pith.science/paper/5UVOP43F"},"agent_actions":{"view_html":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K","download_json":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K.json","view_paper":"https://pith.science/paper/5UVOP43F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.04726&json=true","fetch_graph":"https://pith.science/api/pith-number/5UVOP43F2JQJIJ25ZB57TENZ4K/graph.json","fetch_events":"https://pith.science/api/pith-number/5UVOP43F2JQJIJ25ZB57TENZ4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/action/storage_attestation","attest_author":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/action/author_attestation","sign_citation":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/action/citation_signature","submit_replication":"https://pith.science/pith/5UVOP43F2JQJIJ25ZB57TENZ4K/action/replication_record"}},"created_at":"2026-07-05T09:56:19.944063+00:00","updated_at":"2026-07-05T09:56:19.944063+00:00"}