{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SYOYC3IVPRPP6PC4SBQWS32MG4","short_pith_number":"pith:SYOYC3IV","schema_version":"1.0","canonical_sha256":"961d816d157c5eff3c5c9061696f4c37082d1eaada18035e39011d0779df570a","source":{"kind":"arxiv","id":"1411.4184","version":1},"attestation_state":"computed","paper":{"title":"Hitting forbidden subgraphs in graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2014-11-15T20:47:20Z","abstract_excerpt":"We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph $H$ and an input graph $G$, the task is to find a set $X \\subseteq V(G)$ of minimum size that hits all subgraphs of $G$ isomorphic to $H$. In the colorful variant of the problem, each vertex of $G$ is precolored with some color from $V(H)$ and we require to hit only $H$-subgraphs with matching colors. Standard techniques shows that for every fixed $H$, the problem is fixed-parameter tractable parameterized by the treewidth of $G$; however, it is not clear how exactly the running time shou"},"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":"1411.4184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-15T20:47:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"75cd6b894733634f21cf1d22f9e43a755e4ab02fa43751ad56039c9c40b9fa96","abstract_canon_sha256":"73176eccb0b7279a1d8a65787e82f3299d0aec37b2615cd2d71d2af07afbcd3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.306800Z","signature_b64":"0b3fKtkw5r4/oAveOd8hxFn78rTMvZ8zFDJHQc6+X7T9z3IZBQxQ9293fJBWLC6/1dpQTmx/xERbZZrd8BHQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961d816d157c5eff3c5c9061696f4c37082d1eaada18035e39011d0779df570a","last_reissued_at":"2026-05-18T02:35:46.306307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.306307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hitting forbidden subgraphs in graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2014-11-15T20:47:20Z","abstract_excerpt":"We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph $H$ and an input graph $G$, the task is to find a set $X \\subseteq V(G)$ of minimum size that hits all subgraphs of $G$ isomorphic to $H$. In the colorful variant of the problem, each vertex of $G$ is precolored with some color from $V(H)$ and we require to hit only $H$-subgraphs with matching colors. Standard techniques shows that for every fixed $H$, the problem is fixed-parameter tractable parameterized by the treewidth of $G$; however, it is not clear how exactly the running time shou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4184","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":"1411.4184","created_at":"2026-05-18T02:35:46.306402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4184v1","created_at":"2026-05-18T02:35:46.306402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4184","created_at":"2026-05-18T02:35:46.306402+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYOYC3IVPRPP","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYOYC3IVPRPP6PC4","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYOYC3IV","created_at":"2026-05-18T12:28:49.207871+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/SYOYC3IVPRPP6PC4SBQWS32MG4","json":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4.json","graph_json":"https://pith.science/api/pith-number/SYOYC3IVPRPP6PC4SBQWS32MG4/graph.json","events_json":"https://pith.science/api/pith-number/SYOYC3IVPRPP6PC4SBQWS32MG4/events.json","paper":"https://pith.science/paper/SYOYC3IV"},"agent_actions":{"view_html":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4","download_json":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4.json","view_paper":"https://pith.science/paper/SYOYC3IV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4184&json=true","fetch_graph":"https://pith.science/api/pith-number/SYOYC3IVPRPP6PC4SBQWS32MG4/graph.json","fetch_events":"https://pith.science/api/pith-number/SYOYC3IVPRPP6PC4SBQWS32MG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/action/storage_attestation","attest_author":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/action/author_attestation","sign_citation":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/action/citation_signature","submit_replication":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/action/replication_record"}},"created_at":"2026-05-18T02:35:46.306402+00:00","updated_at":"2026-05-18T02:35:46.306402+00:00"}