{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UIQL35Q33PJYOHWYUMWGHSCHCC","short_pith_number":"pith:UIQL35Q3","schema_version":"1.0","canonical_sha256":"a220bdf61bdbd3871ed8a32c63c8471080f6e131e80323285135e61b0372a3e6","source":{"kind":"arxiv","id":"2608.09800","version":1},"attestation_state":"computed","paper":{"title":"Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-$\\eta$ Deletion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ahmed Ghazy, Jakob Greilhuber, Roohani Sharma, Tim A. Hartmann","submitted_at":"2026-08-10T16:19:40Z","abstract_excerpt":"For a constant $\\eta \\geq 0$, Pathwidth-$\\eta$ Deletion is the problem of deciding whether, for a given graph $G$ and integer $k$, there is a set $S \\subseteq V(G)$ of size at most $k$ such that the pathwidth of $G - S$ is at most $\\eta$. The problems Treewidth-$\\eta$ Deletion and Treedepth-$\\eta$ Deletion are defined similarly for the parameters treewidth and treedepth, respectively. A landmark result of Fomin et al. [FOCS, 2012] shows that, for any constant $\\eta$, all three problems admit a kernel on $O(k^{c(\\eta)})$ vertices, where $c(\\eta)$ is a constant depending on $\\eta$.\n  Giannopoulo"},"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":"2608.09800","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-10T16:19:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5e584befde6c8dde7df8511d8310d41222019ee83ef3633c5076b699c6642385","abstract_canon_sha256":"55a9ce7bf95ef6234efaefa23fe601c0aec989662720c0d156c6fdabc2dc1e3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:25:07.469680Z","signature_b64":"voSGIci24yEenI7Bn45IboQDCYZ33o322zTeo0la6NPSx+RNJnwZLgWMkLaixLNCZBKGdroPXxgdTRKeM7qPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a220bdf61bdbd3871ed8a32c63c8471080f6e131e80323285135e61b0372a3e6","last_reissued_at":"2026-08-11T02:25:07.468111Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:25:07.468111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-$\\eta$ Deletion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ahmed Ghazy, Jakob Greilhuber, Roohani Sharma, Tim A. Hartmann","submitted_at":"2026-08-10T16:19:40Z","abstract_excerpt":"For a constant $\\eta \\geq 0$, Pathwidth-$\\eta$ Deletion is the problem of deciding whether, for a given graph $G$ and integer $k$, there is a set $S \\subseteq V(G)$ of size at most $k$ such that the pathwidth of $G - S$ is at most $\\eta$. The problems Treewidth-$\\eta$ Deletion and Treedepth-$\\eta$ Deletion are defined similarly for the parameters treewidth and treedepth, respectively. A landmark result of Fomin et al. [FOCS, 2012] shows that, for any constant $\\eta$, all three problems admit a kernel on $O(k^{c(\\eta)})$ vertices, where $c(\\eta)$ is a constant depending on $\\eta$.\n  Giannopoulo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09800","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.09800/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":"2608.09800","created_at":"2026-08-11T02:25:07.468704+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09800v1","created_at":"2026-08-11T02:25:07.468704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09800","created_at":"2026-08-11T02:25:07.468704+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIQL35Q33PJY","created_at":"2026-08-11T02:25:07.468704+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIQL35Q33PJYOHWY","created_at":"2026-08-11T02:25:07.468704+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIQL35Q3","created_at":"2026-08-11T02:25:07.468704+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/UIQL35Q33PJYOHWYUMWGHSCHCC","json":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC.json","graph_json":"https://pith.science/api/pith-number/UIQL35Q33PJYOHWYUMWGHSCHCC/graph.json","events_json":"https://pith.science/api/pith-number/UIQL35Q33PJYOHWYUMWGHSCHCC/events.json","paper":"https://pith.science/paper/UIQL35Q3"},"agent_actions":{"view_html":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC","download_json":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC.json","view_paper":"https://pith.science/paper/UIQL35Q3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09800&json=true","fetch_graph":"https://pith.science/api/pith-number/UIQL35Q33PJYOHWYUMWGHSCHCC/graph.json","fetch_events":"https://pith.science/api/pith-number/UIQL35Q33PJYOHWYUMWGHSCHCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC/action/storage_attestation","attest_author":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC/action/author_attestation","sign_citation":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC/action/citation_signature","submit_replication":"https://pith.science/pith/UIQL35Q33PJYOHWYUMWGHSCHCC/action/replication_record"}},"created_at":"2026-08-11T02:25:07.468704+00:00","updated_at":"2026-08-11T02:25:07.468704+00:00"}