{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:I7FBNM33ZUQIHKZIRLQDL5QXYE","short_pith_number":"pith:I7FBNM33","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"},"canonical_sha256":"47ca16b37bcd2083ab288ae035f617c119d5f806999963e626a80adfa9815a20","source":{"kind":"arxiv","id":"2409.04786","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.04786","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2409.04786v2","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04786","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"I7FBNM33ZUQI","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"I7FBNM33ZUQIHKZI","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"I7FBNM33","created_at":"2026-07-05T10:15:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:I7FBNM33ZUQIHKZIRLQDL5QXYE","target":"record","payload":{"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"},"canonical_sha256":"47ca16b37bcd2083ab288ae035f617c119d5f806999963e626a80adfa9815a20","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"},"source_kind":"arxiv","source_id":"2409.04786","source_version":2,"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-07-05T10:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIHJ14knsbwWKLJJkoScZgrzWScPwZG9TDqLaYAL2lS/xABLocchgZif7WJr5GT4BcyiM1SOaP5esNgN2nszDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:35:33.031047Z"},"content_sha256":"5ac38e09fdee972eeac1ab67b8a24826d8fc27e371a1aa6c583de38e62a9a642","schema_version":"1.0","event_id":"sha256:5ac38e09fdee972eeac1ab67b8a24826d8fc27e371a1aa6c583de38e62a9a642"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:I7FBNM33ZUQIHKZIRLQDL5QXYE","target":"graph","payload":{"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"},"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-07-05T10:15:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IKOLOXA5Sf/5lGofAJ4Bx/JCydKXVrhqB1odBsy0AlrcGcEiCiVSX2+6Jf10rWr2TnpGL/wBgqeYolsav9FaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:35:33.031995Z"},"content_sha256":"c94064a8c4a1592722ad42ad4f9fecfff46138bf3c4547bf515d9af61aa0bdef","schema_version":"1.0","event_id":"sha256:c94064a8c4a1592722ad42ad4f9fecfff46138bf3c4547bf515d9af61aa0bdef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/bundle.json","state_url":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/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-08-15T11:35:33Z","links":{"resolver":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE","bundle":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/bundle.json","state":"https://pith.science/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7FBNM33ZUQIHKZIRLQDL5QXYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:I7FBNM33ZUQIHKZIRLQDL5QXYE","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":"df3467e9660c06aeb8d63bbddc05eccde93d39b161b68d639236351ad39641ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-07T10:19:47Z","title_canon_sha256":"beaed2f4c32f7b56c5f01c7885c70dfa96cf0b11086e3e5adac11047dadcbe5b"},"schema_version":"1.0","source":{"id":"2409.04786","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.04786","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"arxiv_version","alias_value":"2409.04786v2","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04786","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_12","alias_value":"I7FBNM33ZUQI","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_16","alias_value":"I7FBNM33ZUQIHKZI","created_at":"2026-07-05T10:15:45Z"},{"alias_kind":"pith_short_8","alias_value":"I7FBNM33","created_at":"2026-07-05T10:15:45Z"}],"graph_snapshots":[{"event_id":"sha256:c94064a8c4a1592722ad42ad4f9fecfff46138bf3c4547bf515d9af61aa0bdef","target":"graph","created_at":"2026-07-05T10:15:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.04786/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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(","authors_text":"Daniel Lokshtanov, Fahad Panolan, Jie Xue, Meirav Zehavi, Saket Saurabh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-07T10:19:47Z","title":"Subexponential Parameterized Algorithms for Hitting Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04786","kind":"arxiv","version":2},"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:5ac38e09fdee972eeac1ab67b8a24826d8fc27e371a1aa6c583de38e62a9a642","target":"record","created_at":"2026-07-05T10:15:45Z","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":"df3467e9660c06aeb8d63bbddc05eccde93d39b161b68d639236351ad39641ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-09-07T10:19:47Z","title_canon_sha256":"beaed2f4c32f7b56c5f01c7885c70dfa96cf0b11086e3e5adac11047dadcbe5b"},"schema_version":"1.0","source":{"id":"2409.04786","kind":"arxiv","version":2}},"canonical_sha256":"47ca16b37bcd2083ab288ae035f617c119d5f806999963e626a80adfa9815a20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47ca16b37bcd2083ab288ae035f617c119d5f806999963e626a80adfa9815a20","first_computed_at":"2026-07-05T10:15:45.454419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:45.454419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4WrQ6rP7XlccLHpEUvRACbpsgKFm6IiRCMg5lXbXgkuCckRDSpaIvzHmZ8h9jD8jlWqu9fmyNY6hKxpWeRLOBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:45.454950Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.04786","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ac38e09fdee972eeac1ab67b8a24826d8fc27e371a1aa6c583de38e62a9a642","sha256:c94064a8c4a1592722ad42ad4f9fecfff46138bf3c4547bf515d9af61aa0bdef"],"state_sha256":"c95d7232d1ba4ac9270feaa376a668712ce93e7e962775d7ba257846f720b7d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pDXswV6H7nD2B/SE7hd3AcXIMY5afyRtBsrYpt1KkKUnsu/3utp12Y0vFLP11ZUCHn46ZAqy/qiydbwXVF/kBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T11:35:33.038857Z","bundle_sha256":"ea16ebc7112aea574db8b14be6eea812073964fdb6410ab6ab5cc2bf5cfbf98c"}}