{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MZY34WJPJDJOGKARMHTM44H4D2","short_pith_number":"pith:MZY34WJP","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"},"canonical_sha256":"6671be592f48d2e3281161e6ce70fc1eb069e32a2aea4ad3b7632e6f80a9ad5c","source":{"kind":"arxiv","id":"1609.07780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07780","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07780v1","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07780","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"MZY34WJPJDJO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZY34WJPJDJOGKAR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZY34WJP","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MZY34WJPJDJOGKARMHTM44H4D2","target":"record","payload":{"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"},"canonical_sha256":"6671be592f48d2e3281161e6ce70fc1eb069e32a2aea4ad3b7632e6f80a9ad5c","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"},"source_kind":"arxiv","source_id":"1609.07780","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-18T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xnoYZx5t9VSua71IntyIg2Ryw5LwFQbISz3YoQV34eIy4e1q9x99PDTNynnzJk577y/TvVF+CI1uhK6IGajDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:25:01.710098Z"},"content_sha256":"7ebd4048f45894f6009e7a8bb5f46d7fa0d6e0fe28dc90885c2fede1d94f7450","schema_version":"1.0","event_id":"sha256:7ebd4048f45894f6009e7a8bb5f46d7fa0d6e0fe28dc90885c2fede1d94f7450"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MZY34WJPJDJOGKARMHTM44H4D2","target":"graph","payload":{"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"},"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-18T01:03:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvUz5xFY6lKCCCTQSW0wergWvz6uUv+qTP0OTYK7G6UdPIezy4d45VbQT2f9rAsuLGW4LpP8nGTb0F9b2iJMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:25:01.710806Z"},"content_sha256":"4cbd2639a283af7addac095f9a90d20e9485085905345d3af69777dc02cfd6c7","schema_version":"1.0","event_id":"sha256:4cbd2639a283af7addac095f9a90d20e9485085905345d3af69777dc02cfd6c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/bundle.json","state_url":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZY34WJPJDJOGKARMHTM44H4D2/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-25T14:25:01Z","links":{"resolver":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2","bundle":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/bundle.json","state":"https://pith.science/pith/MZY34WJPJDJOGKARMHTM44H4D2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZY34WJPJDJOGKARMHTM44H4D2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MZY34WJPJDJOGKARMHTM44H4D2","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":"1f72a7351c36f4ee3ee5f6662752ce6842b5ce26192422dcac4b3c614f2b97c5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-25T18:03:00Z","title_canon_sha256":"dd4d0a64684525eef32a0875b565b53055b0e3c52467041c8ae66d8309f5f1ab"},"schema_version":"1.0","source":{"id":"1609.07780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07780","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07780v1","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07780","created_at":"2026-05-18T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"MZY34WJPJDJO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MZY34WJPJDJOGKAR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MZY34WJP","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:4cbd2639a283af7addac095f9a90d20e9485085905345d3af69777dc02cfd6c7","target":"graph","created_at":"2026-05-18T01:03:55Z","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":"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","authors_text":"Archontia C. Giannopoulou, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna, Micha{\\l} Pilipczuk","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-25T18:03:00Z","title":"Linear kernels for edge deletion problems to immersion-closed graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07780","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:7ebd4048f45894f6009e7a8bb5f46d7fa0d6e0fe28dc90885c2fede1d94f7450","target":"record","created_at":"2026-05-18T01:03:55Z","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":"1f72a7351c36f4ee3ee5f6662752ce6842b5ce26192422dcac4b3c614f2b97c5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-25T18:03:00Z","title_canon_sha256":"dd4d0a64684525eef32a0875b565b53055b0e3c52467041c8ae66d8309f5f1ab"},"schema_version":"1.0","source":{"id":"1609.07780","kind":"arxiv","version":1}},"canonical_sha256":"6671be592f48d2e3281161e6ce70fc1eb069e32a2aea4ad3b7632e6f80a9ad5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6671be592f48d2e3281161e6ce70fc1eb069e32a2aea4ad3b7632e6f80a9ad5c","first_computed_at":"2026-05-18T01:03:55.462618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:55.462618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5yYvhJsDx6Dyv0eH7bBlvSeLUESiKmshrlmxzew0mmiif2wIqhnxhddJGQnX6rZs1Kz0momGlroQ+I+MF/ObBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:55.463266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ebd4048f45894f6009e7a8bb5f46d7fa0d6e0fe28dc90885c2fede1d94f7450","sha256:4cbd2639a283af7addac095f9a90d20e9485085905345d3af69777dc02cfd6c7"],"state_sha256":"f5d5ac6f57e8bcc87f51f8b6eb2c8f95c9094f3d11d98cb518892e307617cc0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YmJ7Ayr9if6xbK4DNrKS7XbLmwfiUgfGMz0yA8ldvpZZw6wIMIFds1OgtVK2xARb7H5wnbEJybjyiVGB35fACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:25:01.714810Z","bundle_sha256":"81755d69826dab99965fcfc7387488ac56471be8a037f9d73769c1faa5148f4b"}}