{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I7FBNM33ZUQIHKZIRLQDL5QXYE","short_pith_number":"pith:I7FBNM33","schema_version":"1.0","canonical_sha256":"47ca16b37bcd2083ab288ae035f617c119d5f806999963e626a80adfa9815a20","source":{"kind":"arxiv","id":"2409.04786","version":2},"attestation_state":"computed","paper":{"title":"Subexponential Parameterized Algorithms for Hitting Subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Jie Xue, Meirav Zehavi, Saket Saurabh","submitted_at":"2024-09-07T10:19:47Z","abstract_excerpt":"For a finite set $\\mathcal{F}$ of graphs, the $\\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\\in\\mathbb{N}$, a set $S$ of vertices in $G$ such that $|S|\\leq k$ and $G-S$ does not contain any subgraph isomorphic to a graph in $\\mathcal{F}$. As a generic problem, $\\mathcal{F}$-Hitting subsumes many fundamental vertex-deletion problems that are well-studied in the literature. The $\\mathcal{F}$-Hitting problem admits a simple branching algorithm with running time $2^{O(k)}\\cdot n^{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":"2409.04786","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-07T10:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"beaed2f4c32f7b56c5f01c7885c70dfa96cf0b11086e3e5adac11047dadcbe5b","abstract_canon_sha256":"df3467e9660c06aeb8d63bbddc05eccde93d39b161b68d639236351ad39641ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:45.454950Z","signature_b64":"4WrQ6rP7XlccLHpEUvRACbpsgKFm6IiRCMg5lXbXgkuCckRDSpaIvzHmZ8h9jD8jlWqu9fmyNY6hKxpWeRLOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47ca16b37bcd2083ab288ae035f617c119d5f806999963e626a80adfa9815a20","last_reissued_at":"2026-07-05T10:15:45.454419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:45.454419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subexponential Parameterized Algorithms for Hitting Subgraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Jie Xue, Meirav Zehavi, Saket Saurabh","submitted_at":"2024-09-07T10:19:47Z","abstract_excerpt":"For a finite set $\\mathcal{F}$ of graphs, the $\\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\\in\\mathbb{N}$, a set $S$ of vertices in $G$ such that $|S|\\leq k$ and $G-S$ does not contain any subgraph isomorphic to a graph in $\\mathcal{F}$. As a generic problem, $\\mathcal{F}$-Hitting subsumes many fundamental vertex-deletion problems that are well-studied in the literature. The $\\mathcal{F}$-Hitting problem admits a simple branching algorithm with running time $2^{O(k)}\\cdot n^{O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04786","kind":"arxiv","version":2},"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/2409.04786/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":"2409.04786","created_at":"2026-07-05T10:15:45.454498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04786v2","created_at":"2026-07-05T10:15:45.454498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04786","created_at":"2026-07-05T10:15:45.454498+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7FBNM33ZUQI","created_at":"2026-07-05T10:15:45.454498+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7FBNM33ZUQIHKZI","created_at":"2026-07-05T10:15:45.454498+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7FBNM33","created_at":"2026-07-05T10:15:45.454498+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/I7FBNM33ZUQIHKZIRLQDL5QXYE","json":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE.json","graph_json":"https://pith.science/api/pith-number/I7FBNM33ZUQIHKZIRLQDL5QXYE/graph.json","events_json":"https://pith.science/api/pith-number/I7FBNM33ZUQIHKZIRLQDL5QXYE/events.json","paper":"https://pith.science/paper/I7FBNM33"},"agent_actions":{"view_html":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE","download_json":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE.json","view_paper":"https://pith.science/paper/I7FBNM33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04786&json=true","fetch_graph":"https://pith.science/api/pith-number/I7FBNM33ZUQIHKZIRLQDL5QXYE/graph.json","fetch_events":"https://pith.science/api/pith-number/I7FBNM33ZUQIHKZIRLQDL5QXYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/action/storage_attestation","attest_author":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/action/author_attestation","sign_citation":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/action/citation_signature","submit_replication":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/action/replication_record"}},"created_at":"2026-07-05T10:15:45.454498+00:00","updated_at":"2026-07-05T10:15:45.454498+00:00"}