{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2Q572O2ON4QNNOILEGTF6HTV3L","short_pith_number":"pith:2Q572O2O","schema_version":"1.0","canonical_sha256":"d43bfd3b4e6f20d6b90b21a65f1e75dac20cdd8a7c5e99db30a2cab66a261e83","source":{"kind":"arxiv","id":"1305.4914","version":2},"attestation_state":"computed","paper":{"title":"Tight Kernel Bounds for Problems on Graphs with Small Degeneracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Fabrizio Grandoni, Marek Cygan","submitted_at":"2013-05-21T18:54:23Z","abstract_excerpt":"In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most $d$. This graph class generalizes many classes of graphs for which effective kernelization is known to exist, e.g. planar graphs, H-minor free graphs, and H-topological-minor free graphs. We show that for several natural problems on d-degenerate graphs the best known kernelization upper bounds are essentially tight."},"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":"1305.4914","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-21T18:54:23Z","cross_cats_sorted":[],"title_canon_sha256":"3736e051354f00b77a222e49f359c89962597b8e163696c13a4c589f8e960600","abstract_canon_sha256":"599ef13830e86967a6fa3087ab4387696f063f84503eb2ec09697339638bada3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:08.923335Z","signature_b64":"Yv5pjucEIu216K0Fx/7FdsFMRaFo34RsYCVkZ92v2z0v1QtJR5lHh6YfqMFt3FuMsJ9pz2Lp8Q+LdEXd5lE1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d43bfd3b4e6f20d6b90b21a65f1e75dac20cdd8a7c5e99db30a2cab66a261e83","last_reissued_at":"2026-05-18T03:20:08.922831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:08.922831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Kernel Bounds for Problems on Graphs with Small Degeneracy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danny Hermelin, Fabrizio Grandoni, Marek Cygan","submitted_at":"2013-05-21T18:54:23Z","abstract_excerpt":"In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most $d$. This graph class generalizes many classes of graphs for which effective kernelization is known to exist, e.g. planar graphs, H-minor free graphs, and H-topological-minor free graphs. We show that for several natural problems on d-degenerate graphs the best known kernelization upper bounds are essentially tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4914","kind":"arxiv","version":2},"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":"1305.4914","created_at":"2026-05-18T03:20:08.922902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4914v2","created_at":"2026-05-18T03:20:08.922902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4914","created_at":"2026-05-18T03:20:08.922902+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Q572O2ON4QN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Q572O2ON4QNNOIL","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Q572O2O","created_at":"2026-05-18T12:27:32.513160+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/2Q572O2ON4QNNOILEGTF6HTV3L","json":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L.json","graph_json":"https://pith.science/api/pith-number/2Q572O2ON4QNNOILEGTF6HTV3L/graph.json","events_json":"https://pith.science/api/pith-number/2Q572O2ON4QNNOILEGTF6HTV3L/events.json","paper":"https://pith.science/paper/2Q572O2O"},"agent_actions":{"view_html":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L","download_json":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L.json","view_paper":"https://pith.science/paper/2Q572O2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4914&json=true","fetch_graph":"https://pith.science/api/pith-number/2Q572O2ON4QNNOILEGTF6HTV3L/graph.json","fetch_events":"https://pith.science/api/pith-number/2Q572O2ON4QNNOILEGTF6HTV3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L/action/storage_attestation","attest_author":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L/action/author_attestation","sign_citation":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L/action/citation_signature","submit_replication":"https://pith.science/pith/2Q572O2ON4QNNOILEGTF6HTV3L/action/replication_record"}},"created_at":"2026-05-18T03:20:08.922902+00:00","updated_at":"2026-05-18T03:20:08.922902+00:00"}