{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SYOYC3IVPRPP6PC4SBQWS32MG4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"73176eccb0b7279a1d8a65787e82f3299d0aec37b2615cd2d71d2af07afbcd3b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-15T20:47:20Z","title_canon_sha256":"75cd6b894733634f21cf1d22f9e43a755e4ab02fa43751ad56039c9c40b9fa96"},"schema_version":"1.0","source":{"id":"1411.4184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4184","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4184v1","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4184","created_at":"2026-05-18T02:35:46Z"},{"alias_kind":"pith_short_12","alias_value":"SYOYC3IVPRPP","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SYOYC3IVPRPP6PC4","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SYOYC3IV","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:9aa0ebc963b3193144fca14fee21ccab22fe4804ae65cb3a6db3a202e4cdd6a1","target":"graph","created_at":"2026-05-18T02:35:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"D\\'aniel Marx, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-15T20:47:20Z","title":"Hitting forbidden subgraphs in graphs of bounded treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4184","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a73debb5e0363bd8f520ea3a64bda4c7a852257688897269a403d9806fdc2ea4","target":"record","created_at":"2026-05-18T02:35:46Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"73176eccb0b7279a1d8a65787e82f3299d0aec37b2615cd2d71d2af07afbcd3b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-15T20:47:20Z","title_canon_sha256":"75cd6b894733634f21cf1d22f9e43a755e4ab02fa43751ad56039c9c40b9fa96"},"schema_version":"1.0","source":{"id":"1411.4184","kind":"arxiv","version":1}},"canonical_sha256":"961d816d157c5eff3c5c9061696f4c37082d1eaada18035e39011d0779df570a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"961d816d157c5eff3c5c9061696f4c37082d1eaada18035e39011d0779df570a","first_computed_at":"2026-05-18T02:35:46.306307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:46.306307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0b3fKtkw5r4/oAveOd8hxFn78rTMvZ8zFDJHQc6+X7T9z3IZBQxQ9293fJBWLC6/1dpQTmx/xERbZZrd8BHQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:46.306800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a73debb5e0363bd8f520ea3a64bda4c7a852257688897269a403d9806fdc2ea4","sha256:9aa0ebc963b3193144fca14fee21ccab22fe4804ae65cb3a6db3a202e4cdd6a1"],"state_sha256":"1b0c15482d997408a873e7e2cd7edbfe58cd6169b722e8d136983f50f953d28b"}