{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:H6O4Z47N5WKWYFFLXNMPC374RQ","short_pith_number":"pith:H6O4Z47N","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"},"canonical_sha256":"3f9dccf3eded956c14abbb58f16ffc8c280451735c3d4fd085d6a5966f58a054","source":{"kind":"arxiv","id":"1502.03965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03965","created_at":"2026-05-18T02:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03965v1","created_at":"2026-05-18T02:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03965","created_at":"2026-05-18T02:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"H6O4Z47N5WKW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H6O4Z47N5WKWYFFL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H6O4Z47N","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:H6O4Z47N5WKWYFFLXNMPC374RQ","target":"record","payload":{"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"},"canonical_sha256":"3f9dccf3eded956c14abbb58f16ffc8c280451735c3d4fd085d6a5966f58a054","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"},"source_kind":"arxiv","source_id":"1502.03965","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-18T02:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BLXRQ/VDF3QZbw7GfS3e3/K27wlgr9Tcp7GRLQuLHM6+m0gEvePV7cNMgH4Xb39EvKofX817OzDniUx4SrKuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:36:58.929661Z"},"content_sha256":"75f38a18801d49005c7bb21e87e71b1fe8eea534ac1d28ea654383baf2a17eb2","schema_version":"1.0","event_id":"sha256:75f38a18801d49005c7bb21e87e71b1fe8eea534ac1d28ea654383baf2a17eb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:H6O4Z47N5WKWYFFLXNMPC374RQ","target":"graph","payload":{"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"},"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-18T02:27:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ch5DmlwyNXWp0RiEoCyCq8rY3GvKSVpgW797HQcvvrSV6NiVoBNYCcPJRmsArrX2mm9iLtgS9PVTJfKQFobCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:36:58.930390Z"},"content_sha256":"81cbcefd5e879d1890bdb569e10360872605d503d259cbc36a1d2fa11b1cf95f","schema_version":"1.0","event_id":"sha256:81cbcefd5e879d1890bdb569e10360872605d503d259cbc36a1d2fa11b1cf95f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/bundle.json","state_url":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/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-26T08:36:58Z","links":{"resolver":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ","bundle":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/bundle.json","state":"https://pith.science/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6O4Z47N5WKWYFFLXNMPC374RQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:H6O4Z47N5WKWYFFLXNMPC374RQ","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":"98c24bdf008e53aa5857a9d0cf4312d680f6d164ee635dc9591e0cb998303562","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T12:48:31Z","title_canon_sha256":"1681e387e5917605fa4f199e510fe656b3cd36894b1c3136007ff4a4244982b6"},"schema_version":"1.0","source":{"id":"1502.03965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03965","created_at":"2026-05-18T02:27:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03965v1","created_at":"2026-05-18T02:27:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03965","created_at":"2026-05-18T02:27:06Z"},{"alias_kind":"pith_short_12","alias_value":"H6O4Z47N5WKW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"H6O4Z47N5WKWYFFL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"H6O4Z47N","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:81cbcefd5e879d1890bdb569e10360872605d503d259cbc36a1d2fa11b1cf95f","target":"graph","created_at":"2026-05-18T02:27:06Z","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":"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 ","authors_text":"Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T12:48:31Z","title":"Uniform Kernelization Complexity of Hitting Forbidden Minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03965","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:75f38a18801d49005c7bb21e87e71b1fe8eea534ac1d28ea654383baf2a17eb2","target":"record","created_at":"2026-05-18T02:27:06Z","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":"98c24bdf008e53aa5857a9d0cf4312d680f6d164ee635dc9591e0cb998303562","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-13T12:48:31Z","title_canon_sha256":"1681e387e5917605fa4f199e510fe656b3cd36894b1c3136007ff4a4244982b6"},"schema_version":"1.0","source":{"id":"1502.03965","kind":"arxiv","version":1}},"canonical_sha256":"3f9dccf3eded956c14abbb58f16ffc8c280451735c3d4fd085d6a5966f58a054","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f9dccf3eded956c14abbb58f16ffc8c280451735c3d4fd085d6a5966f58a054","first_computed_at":"2026-05-18T02:27:06.878702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:06.878702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y9zn9FYkk2LbF3+6nXmZ+2RstsRkBH4DqsSxZfh0YeBEL/nwOcnZxPCxbQzShnvdIu0IxwjX3EjafMsYFN3WCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:06.879588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75f38a18801d49005c7bb21e87e71b1fe8eea534ac1d28ea654383baf2a17eb2","sha256:81cbcefd5e879d1890bdb569e10360872605d503d259cbc36a1d2fa11b1cf95f"],"state_sha256":"764ae228210cc6490fab209675718b2049240d841e9d446c81916ff55d5b463d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkFS8IqXVImVRi85m5/Rr/vpF6jyLX0MT4fINYdLSkxmKWxqymiHi9h27ueZfoKFu5/5TWtf21eYEt9j5y4+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:36:58.934109Z","bundle_sha256":"e9092e5a8756bdd39335da51c1b9e1d2843fb39ebe4ec8ad94be0e77db987306"}}