{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SYOYC3IVPRPP6PC4SBQWS32MG4","short_pith_number":"pith:SYOYC3IV","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"},"canonical_sha256":"961d816d157c5eff3c5c9061696f4c37082d1eaada18035e39011d0779df570a","source":{"kind":"arxiv","id":"1411.4184","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SYOYC3IVPRPP6PC4SBQWS32MG4","target":"record","payload":{"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"},"canonical_sha256":"961d816d157c5eff3c5c9061696f4c37082d1eaada18035e39011d0779df570a","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"},"source_kind":"arxiv","source_id":"1411.4184","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ntlStFmAaOu92KSSrA258yIfHEPC+PDwZBRG2teT6fsMy2X596YIW1Ky0GHj62Tv2SprjOkPtgKayNBqMxJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T04:44:28.738292Z"},"content_sha256":"a73debb5e0363bd8f520ea3a64bda4c7a852257688897269a403d9806fdc2ea4","schema_version":"1.0","event_id":"sha256:a73debb5e0363bd8f520ea3a64bda4c7a852257688897269a403d9806fdc2ea4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SYOYC3IVPRPP6PC4SBQWS32MG4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:35:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbQssfpS1aLikuOqak/S4Yoc6wPHnVj8wYmzL1+SfRRz7orvhwRtu7vel3ALHz3aVfbwtFOgY2CSYlFGLd85AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T04:44:28.739032Z"},"content_sha256":"9aa0ebc963b3193144fca14fee21ccab22fe4804ae65cb3a6db3a202e4cdd6a1","schema_version":"1.0","event_id":"sha256:9aa0ebc963b3193144fca14fee21ccab22fe4804ae65cb3a6db3a202e4cdd6a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/bundle.json","state_url":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T04:44:28Z","links":{"resolver":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4","bundle":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/bundle.json","state":"https://pith.science/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYOYC3IVPRPP6PC4SBQWS32MG4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6HIe0g9ff/ZKc6hnXXeAM86+vWzP/X/fYM7Hq5xczSAflBcP868cG2dxqXsQAmxbgCh//Aj5xwrg6N7vnXdGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T04:44:28.741029Z","bundle_sha256":"b4c8a2947fe6c27594bef817d9612b8261ec562c01e28027bd737a1c47d017e2"}}