{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MDCZ6MCRL4LPR4ZYHYJA44CEHD","short_pith_number":"pith:MDCZ6MCR","schema_version":"1.0","canonical_sha256":"60c59f30515f16f8f3383e120e704438ebfa8135a2cab5453d544858d36491a0","source":{"kind":"arxiv","id":"1107.3658","version":1},"attestation_state":"computed","paper":{"title":"On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Stefan Kratsch","submitted_at":"2011-07-19T09:24:48Z","abstract_excerpt":"The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of OCT with respect to their polynomial kernelizability, i.e., whether instances can be efficiently reduced to a size polynomial in the chosen parameter. It is a major open problem in parameterized complexity whether Odd Cycle Transversal admits a polynomial kernel when parameterized by l. On the positive side, we show a polynomial kernel for OCT when parameterized by the vertex deletion distance to the class of bipar"},"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":"1107.3658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T09:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"6fb46bddd52661a3a2e3c3010fef9dfe0234b9137f78f01d9ba5326131af68cb","abstract_canon_sha256":"2866fd5aed4c7a85ecf984b71b1018ac070d61758cf93d8c7519374c86871263"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:24.280727Z","signature_b64":"Iv8GZoLHdAabGo7phhEQpZ69vUQRkJ3DyIDqAcR++WNrolLcn0zkF4jX5wdO9/0Y/11HPU+dqIH9iPbBkPMcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60c59f30515f16f8f3383e120e704438ebfa8135a2cab5453d544858d36491a0","last_reissued_at":"2026-05-18T04:17:24.280042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:24.280042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Stefan Kratsch","submitted_at":"2011-07-19T09:24:48Z","abstract_excerpt":"The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of OCT with respect to their polynomial kernelizability, i.e., whether instances can be efficiently reduced to a size polynomial in the chosen parameter. It is a major open problem in parameterized complexity whether Odd Cycle Transversal admits a polynomial kernel when parameterized by l. On the positive side, we show a polynomial kernel for OCT when parameterized by the vertex deletion distance to the class of bipar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3658","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.3658","created_at":"2026-05-18T04:17:24.280156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3658v1","created_at":"2026-05-18T04:17:24.280156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3658","created_at":"2026-05-18T04:17:24.280156+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDCZ6MCRL4LP","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDCZ6MCRL4LPR4ZY","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDCZ6MCR","created_at":"2026-05-18T12:26:34.985390+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/MDCZ6MCRL4LPR4ZYHYJA44CEHD","json":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD.json","graph_json":"https://pith.science/api/pith-number/MDCZ6MCRL4LPR4ZYHYJA44CEHD/graph.json","events_json":"https://pith.science/api/pith-number/MDCZ6MCRL4LPR4ZYHYJA44CEHD/events.json","paper":"https://pith.science/paper/MDCZ6MCR"},"agent_actions":{"view_html":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD","download_json":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD.json","view_paper":"https://pith.science/paper/MDCZ6MCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3658&json=true","fetch_graph":"https://pith.science/api/pith-number/MDCZ6MCRL4LPR4ZYHYJA44CEHD/graph.json","fetch_events":"https://pith.science/api/pith-number/MDCZ6MCRL4LPR4ZYHYJA44CEHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/action/storage_attestation","attest_author":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/action/author_attestation","sign_citation":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/action/citation_signature","submit_replication":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/action/replication_record"}},"created_at":"2026-05-18T04:17:24.280156+00:00","updated_at":"2026-05-18T04:17:24.280156+00:00"}