{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NJBMKH6HCS4XUUSJ7YQQUGDOTT","short_pith_number":"pith:NJBMKH6H","schema_version":"1.0","canonical_sha256":"6a42c51fc714b97a5249fe210a186e9ce00526812aa065c87c158b19958f290b","source":{"kind":"arxiv","id":"1901.02209","version":1},"attestation_state":"computed","paper":{"title":"Subset Feedback Vertex Set in Chordal and Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Geevarghese Philip, Prafullkumar Tale, Saket Saurabh, Varun Rajan","submitted_at":"2019-01-08T08:50:02Z","abstract_excerpt":"In the \\textsc{Subset Feedback Vertex Set (Subset-FVS)} problem the input is a graph $G$, a subset \\(T\\) of vertices of \\(G\\)  called the `terminal' vertices, and an integer $k$. The task is to determine whether there exists a subset of vertices of cardinality at most $k$ which together intersect all cycles which pass through the terminals. \\textsc{Subset-FVS} generalizes several well studied problems including \\textsc{Feedback Vertex Set} and \\textsc{Multiway Cut}. This problem is known to be \\NP-Complete even in split graphs. Cygan et al. proved that \\textsc{Subset-FVS} is fixed parameter tr"},"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":"1901.02209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-08T08:50:02Z","cross_cats_sorted":[],"title_canon_sha256":"70bc316e7d59c6e578ce3e70a237eb186597a6f423fb6aefc14aae64794d32ff","abstract_canon_sha256":"84b0052e96faa652e9b250086631727e883cd4d8d04e2cc21ff8f0ef68f5212d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:43.762424Z","signature_b64":"yi9TeFEpGmP/5HhSSfPUdbhIvZrXRHT3tiZSSqjpJeA1tUoHtgdsKMpb/MeQgVypLvBDribydeIHFVEoRzBcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a42c51fc714b97a5249fe210a186e9ce00526812aa065c87c158b19958f290b","last_reissued_at":"2026-05-17T23:56:43.761870Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:43.761870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subset Feedback Vertex Set in Chordal and Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Geevarghese Philip, Prafullkumar Tale, Saket Saurabh, Varun Rajan","submitted_at":"2019-01-08T08:50:02Z","abstract_excerpt":"In the \\textsc{Subset Feedback Vertex Set (Subset-FVS)} problem the input is a graph $G$, a subset \\(T\\) of vertices of \\(G\\)  called the `terminal' vertices, and an integer $k$. The task is to determine whether there exists a subset of vertices of cardinality at most $k$ which together intersect all cycles which pass through the terminals. \\textsc{Subset-FVS} generalizes several well studied problems including \\textsc{Feedback Vertex Set} and \\textsc{Multiway Cut}. This problem is known to be \\NP-Complete even in split graphs. Cygan et al. proved that \\textsc{Subset-FVS} is fixed parameter tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02209","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":""},"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":"1901.02209","created_at":"2026-05-17T23:56:43.761960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02209v1","created_at":"2026-05-17T23:56:43.761960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02209","created_at":"2026-05-17T23:56:43.761960+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJBMKH6HCS4X","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJBMKH6HCS4XUUSJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJBMKH6H","created_at":"2026-05-18T12:33:24.271573+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/NJBMKH6HCS4XUUSJ7YQQUGDOTT","json":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT.json","graph_json":"https://pith.science/api/pith-number/NJBMKH6HCS4XUUSJ7YQQUGDOTT/graph.json","events_json":"https://pith.science/api/pith-number/NJBMKH6HCS4XUUSJ7YQQUGDOTT/events.json","paper":"https://pith.science/paper/NJBMKH6H"},"agent_actions":{"view_html":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT","download_json":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT.json","view_paper":"https://pith.science/paper/NJBMKH6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02209&json=true","fetch_graph":"https://pith.science/api/pith-number/NJBMKH6HCS4XUUSJ7YQQUGDOTT/graph.json","fetch_events":"https://pith.science/api/pith-number/NJBMKH6HCS4XUUSJ7YQQUGDOTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT/action/storage_attestation","attest_author":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT/action/author_attestation","sign_citation":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT/action/citation_signature","submit_replication":"https://pith.science/pith/NJBMKH6HCS4XUUSJ7YQQUGDOTT/action/replication_record"}},"created_at":"2026-05-17T23:56:43.761960+00:00","updated_at":"2026-05-17T23:56:43.761960+00:00"}