{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QMOTCVIJAI2OWAAUCVBCG3HLM7","short_pith_number":"pith:QMOTCVIJ","schema_version":"1.0","canonical_sha256":"831d3155090234eb00141542236ceb67d90ec616699a2a4918156a18e00d11fb","source":{"kind":"arxiv","id":"1609.08095","version":2},"attestation_state":"computed","paper":{"title":"How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Marin Bougeret","submitted_at":"2016-09-26T17:41:03Z","abstract_excerpt":"In the last years, kernelization with structural parameters has been an active area of research within the field of parameterized complexity. As a relevant example, Gajarsk{\\`y} et al. [ESA 2013] proved that every graph problem satisfying a property called finite integer index admits a linear kernel on graphs of bounded expansion and an almost linear kernel on nowhere dense graphs, parameterized by the size of a $c$-treedepth modulator, which is a vertex set whose removal results in a graph of treedepth at most $c$, where $c \\geq 1$ is a fixed integer. The authors left as further research to i"},"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":"1609.08095","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-26T17:41:03Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"324526156227e7da66eb966b052312898fffbc70ea628f33c271501b1a4cbd83","abstract_canon_sha256":"37634aa38e5f6427adf4b85ca30c1410322d1af7d0276644ece56ad6da1c517b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:07.001805Z","signature_b64":"bDu8hDAPwvWARWfUTZEiOFFxKSmevgD1hhgYzKNyDPWl4hg+3O904aosTi+wk58o/wpSrvK75XLTrDqax540DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"831d3155090234eb00141542236ceb67d90ec616699a2a4918156a18e00d11fb","last_reissued_at":"2026-05-18T00:14:07.001254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:07.001254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Marin Bougeret","submitted_at":"2016-09-26T17:41:03Z","abstract_excerpt":"In the last years, kernelization with structural parameters has been an active area of research within the field of parameterized complexity. As a relevant example, Gajarsk{\\`y} et al. [ESA 2013] proved that every graph problem satisfying a property called finite integer index admits a linear kernel on graphs of bounded expansion and an almost linear kernel on nowhere dense graphs, parameterized by the size of a $c$-treedepth modulator, which is a vertex set whose removal results in a graph of treedepth at most $c$, where $c \\geq 1$ is a fixed integer. The authors left as further research to i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08095","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":"1609.08095","created_at":"2026-05-18T00:14:07.001351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08095v2","created_at":"2026-05-18T00:14:07.001351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08095","created_at":"2026-05-18T00:14:07.001351+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMOTCVIJAI2O","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMOTCVIJAI2OWAAU","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMOTCVIJ","created_at":"2026-05-18T12:30:39.010887+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/QMOTCVIJAI2OWAAUCVBCG3HLM7","json":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7.json","graph_json":"https://pith.science/api/pith-number/QMOTCVIJAI2OWAAUCVBCG3HLM7/graph.json","events_json":"https://pith.science/api/pith-number/QMOTCVIJAI2OWAAUCVBCG3HLM7/events.json","paper":"https://pith.science/paper/QMOTCVIJ"},"agent_actions":{"view_html":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7","download_json":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7.json","view_paper":"https://pith.science/paper/QMOTCVIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08095&json=true","fetch_graph":"https://pith.science/api/pith-number/QMOTCVIJAI2OWAAUCVBCG3HLM7/graph.json","fetch_events":"https://pith.science/api/pith-number/QMOTCVIJAI2OWAAUCVBCG3HLM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/action/storage_attestation","attest_author":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/action/author_attestation","sign_citation":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/action/citation_signature","submit_replication":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/action/replication_record"}},"created_at":"2026-05-18T00:14:07.001351+00:00","updated_at":"2026-05-18T00:14:07.001351+00:00"}