{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QMOTCVIJAI2OWAAUCVBCG3HLM7","short_pith_number":"pith:QMOTCVIJ","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"},"canonical_sha256":"831d3155090234eb00141542236ceb67d90ec616699a2a4918156a18e00d11fb","source":{"kind":"arxiv","id":"1609.08095","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08095","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08095v2","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08095","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"QMOTCVIJAI2O","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QMOTCVIJAI2OWAAU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QMOTCVIJ","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QMOTCVIJAI2OWAAUCVBCG3HLM7","target":"record","payload":{"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"},"canonical_sha256":"831d3155090234eb00141542236ceb67d90ec616699a2a4918156a18e00d11fb","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"},"source_kind":"arxiv","source_id":"1609.08095","source_version":2,"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-18T00:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"we2bg25rBCwcDHWjntSa4ZG7T6o5w5AX6AMlAFPN82cHy3ZlApiWaWpn6n0vSUimtdqQC2UG5MP7uyK5di2PDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:06:28.161681Z"},"content_sha256":"9522bbc815b042149e867c12f023b67c9ee5e555f54115493761dd1b91a8bdaa","schema_version":"1.0","event_id":"sha256:9522bbc815b042149e867c12f023b67c9ee5e555f54115493761dd1b91a8bdaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QMOTCVIJAI2OWAAUCVBCG3HLM7","target":"graph","payload":{"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"},"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-18T00:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M9YBL6vWTBM6O1M7kZ+338YOsCWrz06yIVYyKOXjgv3P9eeUw8rqU/ACazGw4/hdoQSzluOdhjDIbtRmG3GVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:06:28.162034Z"},"content_sha256":"9740ca6f923c290dda6d21225c7c38ba4b8b6fa5d59cc33e0dde1756bac96d2f","schema_version":"1.0","event_id":"sha256:9740ca6f923c290dda6d21225c7c38ba4b8b6fa5d59cc33e0dde1756bac96d2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/bundle.json","state_url":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/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-30T05:06:28Z","links":{"resolver":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7","bundle":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/bundle.json","state":"https://pith.science/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMOTCVIJAI2OWAAUCVBCG3HLM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QMOTCVIJAI2OWAAUCVBCG3HLM7","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":"37634aa38e5f6427adf4b85ca30c1410322d1af7d0276644ece56ad6da1c517b","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-26T17:41:03Z","title_canon_sha256":"324526156227e7da66eb966b052312898fffbc70ea628f33c271501b1a4cbd83"},"schema_version":"1.0","source":{"id":"1609.08095","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08095","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08095v2","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08095","created_at":"2026-05-18T00:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"QMOTCVIJAI2O","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QMOTCVIJAI2OWAAU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QMOTCVIJ","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:9740ca6f923c290dda6d21225c7c38ba4b8b6fa5d59cc33e0dde1756bac96d2f","target":"graph","created_at":"2026-05-18T00:14:07Z","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":"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","authors_text":"Ignasi Sau, Marin Bougeret","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-26T17:41:03Z","title":"How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08095","kind":"arxiv","version":2},"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:9522bbc815b042149e867c12f023b67c9ee5e555f54115493761dd1b91a8bdaa","target":"record","created_at":"2026-05-18T00:14:07Z","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":"37634aa38e5f6427adf4b85ca30c1410322d1af7d0276644ece56ad6da1c517b","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-26T17:41:03Z","title_canon_sha256":"324526156227e7da66eb966b052312898fffbc70ea628f33c271501b1a4cbd83"},"schema_version":"1.0","source":{"id":"1609.08095","kind":"arxiv","version":2}},"canonical_sha256":"831d3155090234eb00141542236ceb67d90ec616699a2a4918156a18e00d11fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"831d3155090234eb00141542236ceb67d90ec616699a2a4918156a18e00d11fb","first_computed_at":"2026-05-18T00:14:07.001254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:07.001254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bDu8hDAPwvWARWfUTZEiOFFxKSmevgD1hhgYzKNyDPWl4hg+3O904aosTi+wk58o/wpSrvK75XLTrDqax540DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:07.001805Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08095","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9522bbc815b042149e867c12f023b67c9ee5e555f54115493761dd1b91a8bdaa","sha256:9740ca6f923c290dda6d21225c7c38ba4b8b6fa5d59cc33e0dde1756bac96d2f"],"state_sha256":"6a49a3e7897cebfb0cd4ae8822a83ba516de1ec302f9cdf8769388e3bb45fab2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbG5Y5nbLxMWO9uMESBUTkWFl3Wl7llmITxLVwugDJ84pjCcyThCIyXYKRPJ5OHs2DYcsR83uwSop4mzrCxiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:06:28.164124Z","bundle_sha256":"c00b39bec97932135040ea84b5fe876c7a9504cda7cd979f269a6593e8fd825a"}}