{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OITDMNCQC5EBBDKKB6STUPIWY4","short_pith_number":"pith:OITDMNCQ","canonical_record":{"source":{"id":"1804.08885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-24T08:08:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"455b2e15ff6ba22790df5eda17069fb4ac5bb140c63f885c1ed5d294c16e288a","abstract_canon_sha256":"735d458594caf453fe16a70e1f131e12109f30ce3ab7c28579f8cde34d435bc1"},"schema_version":"1.0"},"canonical_sha256":"72263634501748108d4a0fa53a3d16c7034db93b6f7bda45d67f7fbe26c83c2d","source":{"kind":"arxiv","id":"1804.08885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08885","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08885v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08885","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"OITDMNCQC5EB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OITDMNCQC5EBBDKK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OITDMNCQ","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OITDMNCQC5EBBDKKB6STUPIWY4","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08885","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-24T08:08:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"455b2e15ff6ba22790df5eda17069fb4ac5bb140c63f885c1ed5d294c16e288a","abstract_canon_sha256":"735d458594caf453fe16a70e1f131e12109f30ce3ab7c28579f8cde34d435bc1"},"schema_version":"1.0"},"canonical_sha256":"72263634501748108d4a0fa53a3d16c7034db93b6f7bda45d67f7fbe26c83c2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:37.002703Z","signature_b64":"qes+Etn5UBacjf6Pw6wkjUO/t0f2VoAaOzpu/FbbBaXHqpHdqLDvmuwR/WPmO41dB1iqnVMF7xGsa88NQuoWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72263634501748108d4a0fa53a3d16c7034db93b6f7bda45d67f7fbe26c83c2d","last_reissued_at":"2026-05-18T00:17:37.001986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:37.001986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08885","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-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qu7ro69AMTeThBDiTm6AHk1+ARYu9JRVLXbbdDqkRmueeTBVUg8ayQKfGcC7Fzklxfvm4tXVucseG9eHWa6HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:14:32.430437Z"},"content_sha256":"2bc14c5be7f88942237495e7324206cd45dfd709b830c8de0adda7174e31f3f9","schema_version":"1.0","event_id":"sha256:2bc14c5be7f88942237495e7324206cd45dfd709b830c8de0adda7174e31f3f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OITDMNCQC5EBBDKKB6STUPIWY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M. P. Jansen","submitted_at":"2018-04-24T08:08:10Z","abstract_excerpt":"We investigate polynomial-time preprocessing for the problem of hitting forbidden minors in a graph, using the framework of kernelization. For a fixed finite set of connected graphs F, the F-Deletion problem is the following: given a graph G and integer k, is it possible to delete k vertices from G to ensure the resulting graph does not contain any graph from F as a minor? Earlier work by Fomin, Lokshtanov, Misra, and Saurabh [FOCS'12] showed that when F contains a planar graph, an instance (G,k) can be reduced in polynomial time to an equivalent one of size $k^{O(1)}$. In this work we focus o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08885","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-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1yEGfrnt92NxdDbXPQyDcuTD5hGLouxub130hypB7YvdMFS1ULk7nI5ONRNEWkxa5sGLuWGpYmcupWzZpTsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:14:32.431079Z"},"content_sha256":"c357ff2b7db30276b49f350939ab0c3fe5d8291047fac2ff6984ed5edb197a4c","schema_version":"1.0","event_id":"sha256:c357ff2b7db30276b49f350939ab0c3fe5d8291047fac2ff6984ed5edb197a4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/bundle.json","state_url":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OITDMNCQC5EBBDKKB6STUPIWY4/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-26T23:14:32Z","links":{"resolver":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4","bundle":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/bundle.json","state":"https://pith.science/pith/OITDMNCQC5EBBDKKB6STUPIWY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OITDMNCQC5EBBDKKB6STUPIWY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OITDMNCQC5EBBDKKB6STUPIWY4","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":"735d458594caf453fe16a70e1f131e12109f30ce3ab7c28579f8cde34d435bc1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-24T08:08:10Z","title_canon_sha256":"455b2e15ff6ba22790df5eda17069fb4ac5bb140c63f885c1ed5d294c16e288a"},"schema_version":"1.0","source":{"id":"1804.08885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08885","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08885v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08885","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"OITDMNCQC5EB","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OITDMNCQC5EBBDKK","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OITDMNCQ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:c357ff2b7db30276b49f350939ab0c3fe5d8291047fac2ff6984ed5edb197a4c","target":"graph","created_at":"2026-05-18T00:17:37Z","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 investigate polynomial-time preprocessing for the problem of hitting forbidden minors in a graph, using the framework of kernelization. For a fixed finite set of connected graphs F, the F-Deletion problem is the following: given a graph G and integer k, is it possible to delete k vertices from G to ensure the resulting graph does not contain any graph from F as a minor? Earlier work by Fomin, Lokshtanov, Misra, and Saurabh [FOCS'12] showed that when F contains a planar graph, an instance (G,k) can be reduced in polynomial time to an equivalent one of size $k^{O(1)}$. In this work we focus o","authors_text":"Astrid Pieterse, Bart M. P. Jansen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-24T08:08:10Z","title":"Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08885","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:2bc14c5be7f88942237495e7324206cd45dfd709b830c8de0adda7174e31f3f9","target":"record","created_at":"2026-05-18T00:17:37Z","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":"735d458594caf453fe16a70e1f131e12109f30ce3ab7c28579f8cde34d435bc1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-04-24T08:08:10Z","title_canon_sha256":"455b2e15ff6ba22790df5eda17069fb4ac5bb140c63f885c1ed5d294c16e288a"},"schema_version":"1.0","source":{"id":"1804.08885","kind":"arxiv","version":1}},"canonical_sha256":"72263634501748108d4a0fa53a3d16c7034db93b6f7bda45d67f7fbe26c83c2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72263634501748108d4a0fa53a3d16c7034db93b6f7bda45d67f7fbe26c83c2d","first_computed_at":"2026-05-18T00:17:37.001986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:37.001986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qes+Etn5UBacjf6Pw6wkjUO/t0f2VoAaOzpu/FbbBaXHqpHdqLDvmuwR/WPmO41dB1iqnVMF7xGsa88NQuoWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:37.002703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bc14c5be7f88942237495e7324206cd45dfd709b830c8de0adda7174e31f3f9","sha256:c357ff2b7db30276b49f350939ab0c3fe5d8291047fac2ff6984ed5edb197a4c"],"state_sha256":"6491f1dbe95bb57e8ada4c9cced1c3524cd1a6be5127835f8dbf09a407117a6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHCwHytaDLUcIaay5HEeWbE79PcMAD9UJjdvOkW9eIqM2ufJ+CSvr4kdDwxwDwUzsDTlLolkc2wAunINqMIOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:14:32.434332Z","bundle_sha256":"1c408de08a6d9607748c02ddc68d47a6f77e023f64d04ae5e36f588d451bd2b9"}}