{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:H6O4Z47N5WKWYFFLXNMPC374RQ","short_pith_number":"pith:H6O4Z47N","schema_version":"1.0","canonical_sha256":"3f9dccf3eded956c14abbb58f16ffc8c280451735c3d4fd085d6a5966f58a054","source":{"kind":"arxiv","id":"1502.03965","version":1},"attestation_state":"computed","paper":{"title":"Uniform Kernelization Complexity of Hitting Forbidden Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh","submitted_at":"2015-02-13T12:48:31Z","abstract_excerpt":"The F-Minor-Free Deletion problem asks, for a fixed set F and an input consisting of a graph G and integer k, whether k vertices can be removed from G such that the resulting graph does not contain any member of F as a minor. This paper analyzes to what extent provably effective and efficient preprocessing is possible for F-Minor-Free Deletion. Fomin et al. (FOCS 2012) showed that the special case Planar F-Deletion (when F contains at least one planar graph) has a kernel of size f(F) * k^{g(F)} for some functions f and g. The degree g of the polynomial grows very quickly; it is not even known "},"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":"1502.03965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T12:48:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1681e387e5917605fa4f199e510fe656b3cd36894b1c3136007ff4a4244982b6","abstract_canon_sha256":"98c24bdf008e53aa5857a9d0cf4312d680f6d164ee635dc9591e0cb998303562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:06.879588Z","signature_b64":"Y9zn9FYkk2LbF3+6nXmZ+2RstsRkBH4DqsSxZfh0YeBEL/nwOcnZxPCxbQzShnvdIu0IxwjX3EjafMsYFN3WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f9dccf3eded956c14abbb58f16ffc8c280451735c3d4fd085d6a5966f58a054","last_reissued_at":"2026-05-18T02:27:06.878702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:06.878702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform Kernelization Complexity of Hitting Forbidden Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh","submitted_at":"2015-02-13T12:48:31Z","abstract_excerpt":"The F-Minor-Free Deletion problem asks, for a fixed set F and an input consisting of a graph G and integer k, whether k vertices can be removed from G such that the resulting graph does not contain any member of F as a minor. This paper analyzes to what extent provably effective and efficient preprocessing is possible for F-Minor-Free Deletion. Fomin et al. (FOCS 2012) showed that the special case Planar F-Deletion (when F contains at least one planar graph) has a kernel of size f(F) * k^{g(F)} for some functions f and g. The degree g of the polynomial grows very quickly; it is not even known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03965","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":"1502.03965","created_at":"2026-05-18T02:27:06.878855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03965v1","created_at":"2026-05-18T02:27:06.878855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03965","created_at":"2026-05-18T02:27:06.878855+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6O4Z47N5WKW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6O4Z47N5WKWYFFL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6O4Z47N","created_at":"2026-05-18T12:29:22.688609+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/H6O4Z47N5WKWYFFLXNMPC374RQ","json":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ.json","graph_json":"https://pith.science/api/pith-number/H6O4Z47N5WKWYFFLXNMPC374RQ/graph.json","events_json":"https://pith.science/api/pith-number/H6O4Z47N5WKWYFFLXNMPC374RQ/events.json","paper":"https://pith.science/paper/H6O4Z47N"},"agent_actions":{"view_html":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ","download_json":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ.json","view_paper":"https://pith.science/paper/H6O4Z47N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03965&json=true","fetch_graph":"https://pith.science/api/pith-number/H6O4Z47N5WKWYFFLXNMPC374RQ/graph.json","fetch_events":"https://pith.science/api/pith-number/H6O4Z47N5WKWYFFLXNMPC374RQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/action/storage_attestation","attest_author":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/action/author_attestation","sign_citation":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/action/citation_signature","submit_replication":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/action/replication_record"}},"created_at":"2026-05-18T02:27:06.878855+00:00","updated_at":"2026-05-18T02:27:06.878855+00:00"}