{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4UGCHWH4WAEM2XQNYL4ITRMQPL","short_pith_number":"pith:4UGCHWH4","schema_version":"1.0","canonical_sha256":"e50c23d8fcb008cd5e0dc2f889c5907ae78d9057237b271cfc3ed321c61bd3b3","source":{"kind":"arxiv","id":"1302.6863","version":3},"attestation_state":"computed","paper":{"title":"Kernelization Using Structural Parameters on Sparse Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Fernando S\\'anchez Villaamil, Jakub Gajarsk\\'y, Jan Obdr\\v{z}\\'alek, Peter Rossmanith, Petr Hlin\\v{e}n\\'y, Sebastian Ordyniak, Somnath Sikdar","submitted_at":"2013-02-27T14:49:43Z","abstract_excerpt":"Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, meta-theorems for linear kernels exist on graphs of bounded genus, $H$-minor-free graphs, and $H$-topological-minor-free graphs. To the best of our knowledge, no meta-theorems for polynomial kernels are known for any larger sparse graph classes; e.g., for classes of bounded expansion or for nowhere dense ones. In this paper we prove such meta-theorems for the two latter cases. More specifically, we show that graph problems that have finite integer index (FII) have "},"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":"1302.6863","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-27T14:49:43Z","cross_cats_sorted":[],"title_canon_sha256":"9786ad68dece425e7f9a43b24008e4a5eb7d53427b3588aa86ba9826aba27946","abstract_canon_sha256":"c4ef9462dc6af48cfb12576747acfa84708e2cf474c0d39576b0f84d05ae1e02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:50.078479Z","signature_b64":"8c16SAh6v3KbQ27vMRL5cPxemWspBZA4sFp4d0Z84FV5/un57gAaWptjCrROxz1f/QfQycakdA0Y84cynUPiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e50c23d8fcb008cd5e0dc2f889c5907ae78d9057237b271cfc3ed321c61bd3b3","last_reissued_at":"2026-05-18T01:09:50.077811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:50.077811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization Using Structural Parameters on Sparse Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felix Reidl, Fernando S\\'anchez Villaamil, Jakub Gajarsk\\'y, Jan Obdr\\v{z}\\'alek, Peter Rossmanith, Petr Hlin\\v{e}n\\'y, Sebastian Ordyniak, Somnath Sikdar","submitted_at":"2013-02-27T14:49:43Z","abstract_excerpt":"Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, meta-theorems for linear kernels exist on graphs of bounded genus, $H$-minor-free graphs, and $H$-topological-minor-free graphs. To the best of our knowledge, no meta-theorems for polynomial kernels are known for any larger sparse graph classes; e.g., for classes of bounded expansion or for nowhere dense ones. In this paper we prove such meta-theorems for the two latter cases. More specifically, we show that graph problems that have finite integer index (FII) have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6863","kind":"arxiv","version":3},"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":"1302.6863","created_at":"2026-05-18T01:09:50.077904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6863v3","created_at":"2026-05-18T01:09:50.077904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6863","created_at":"2026-05-18T01:09:50.077904+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UGCHWH4WAEM","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UGCHWH4WAEM2XQN","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UGCHWH4","created_at":"2026-05-18T12:27:34.582898+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/4UGCHWH4WAEM2XQNYL4ITRMQPL","json":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL.json","graph_json":"https://pith.science/api/pith-number/4UGCHWH4WAEM2XQNYL4ITRMQPL/graph.json","events_json":"https://pith.science/api/pith-number/4UGCHWH4WAEM2XQNYL4ITRMQPL/events.json","paper":"https://pith.science/paper/4UGCHWH4"},"agent_actions":{"view_html":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL","download_json":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL.json","view_paper":"https://pith.science/paper/4UGCHWH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6863&json=true","fetch_graph":"https://pith.science/api/pith-number/4UGCHWH4WAEM2XQNYL4ITRMQPL/graph.json","fetch_events":"https://pith.science/api/pith-number/4UGCHWH4WAEM2XQNYL4ITRMQPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL/action/storage_attestation","attest_author":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL/action/author_attestation","sign_citation":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL/action/citation_signature","submit_replication":"https://pith.science/pith/4UGCHWH4WAEM2XQNYL4ITRMQPL/action/replication_record"}},"created_at":"2026-05-18T01:09:50.077904+00:00","updated_at":"2026-05-18T01:09:50.077904+00:00"}