{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MZY34WJPJDJOGKARMHTM44H4D2","short_pith_number":"pith:MZY34WJP","schema_version":"1.0","canonical_sha256":"6671be592f48d2e3281161e6ce70fc1eb069e32a2aea4ad3b7632e6f80a9ad5c","source":{"kind":"arxiv","id":"1609.07780","version":1},"attestation_state":"computed","paper":{"title":"Linear kernels for edge deletion problems to immersion-closed graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Archontia C. Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2016-09-25T18:03:00Z","abstract_excerpt":"Suppose $\\mathcal{F}$ is a finite family of graphs. We consider the following meta-problem, called $\\mathcal{F}$-Immersion Deletion: given a graph $G$ and integer $k$, decide whether the deletion of at most $k$ edges of $G$ can result in a graph that does not contain any graph from $\\mathcal{F}$ as an immersion. This problem is a close relative of the $\\mathcal{F}$-Minor Deletion problem studied by Fomin et al. [FOCS 2012], where one deletes vertices in order to remove all minor models of graphs from $\\mathcal{F}$.\n  We prove that whenever all graphs from $\\mathcal{F}$ are connected and at lea"},"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":"1609.07780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-25T18:03:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dd4d0a64684525eef32a0875b565b53055b0e3c52467041c8ae66d8309f5f1ab","abstract_canon_sha256":"1f72a7351c36f4ee3ee5f6662752ce6842b5ce26192422dcac4b3c614f2b97c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:55.463266Z","signature_b64":"5yYvhJsDx6Dyv0eH7bBlvSeLUESiKmshrlmxzew0mmiif2wIqhnxhddJGQnX6rZs1Kz0momGlroQ+I+MF/ObBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6671be592f48d2e3281161e6ce70fc1eb069e32a2aea4ad3b7632e6f80a9ad5c","last_reissued_at":"2026-05-18T01:03:55.462618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:55.462618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear kernels for edge deletion problems to immersion-closed graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Archontia C. Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2016-09-25T18:03:00Z","abstract_excerpt":"Suppose $\\mathcal{F}$ is a finite family of graphs. We consider the following meta-problem, called $\\mathcal{F}$-Immersion Deletion: given a graph $G$ and integer $k$, decide whether the deletion of at most $k$ edges of $G$ can result in a graph that does not contain any graph from $\\mathcal{F}$ as an immersion. This problem is a close relative of the $\\mathcal{F}$-Minor Deletion problem studied by Fomin et al. [FOCS 2012], where one deletes vertices in order to remove all minor models of graphs from $\\mathcal{F}$.\n  We prove that whenever all graphs from $\\mathcal{F}$ are connected and at lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07780","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":"1609.07780","created_at":"2026-05-18T01:03:55.462729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07780v1","created_at":"2026-05-18T01:03:55.462729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07780","created_at":"2026-05-18T01:03:55.462729+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZY34WJPJDJO","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZY34WJPJDJOGKAR","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZY34WJP","created_at":"2026-05-18T12:30:32.724797+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/MZY34WJPJDJOGKARMHTM44H4D2","json":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2.json","graph_json":"https://pith.science/api/pith-number/MZY34WJPJDJOGKARMHTM44H4D2/graph.json","events_json":"https://pith.science/api/pith-number/MZY34WJPJDJOGKARMHTM44H4D2/events.json","paper":"https://pith.science/paper/MZY34WJP"},"agent_actions":{"view_html":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2","download_json":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2.json","view_paper":"https://pith.science/paper/MZY34WJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07780&json=true","fetch_graph":"https://pith.science/api/pith-number/MZY34WJPJDJOGKARMHTM44H4D2/graph.json","fetch_events":"https://pith.science/api/pith-number/MZY34WJPJDJOGKARMHTM44H4D2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/action/storage_attestation","attest_author":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/action/author_attestation","sign_citation":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/action/citation_signature","submit_replication":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/action/replication_record"}},"created_at":"2026-05-18T01:03:55.462729+00:00","updated_at":"2026-05-18T01:03:55.462729+00:00"}