{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MDCZ6MCRL4LPR4ZYHYJA44CEHD","short_pith_number":"pith:MDCZ6MCR","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"},"canonical_sha256":"60c59f30515f16f8f3383e120e704438ebfa8135a2cab5453d544858d36491a0","source":{"kind":"arxiv","id":"1107.3658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3658","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3658v1","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3658","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"MDCZ6MCRL4LP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MDCZ6MCRL4LPR4ZY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MDCZ6MCR","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MDCZ6MCRL4LPR4ZYHYJA44CEHD","target":"record","payload":{"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"},"canonical_sha256":"60c59f30515f16f8f3383e120e704438ebfa8135a2cab5453d544858d36491a0","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"},"source_kind":"arxiv","source_id":"1107.3658","source_version":1,"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-18T04:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdGzKHCNUmIlU1AofSea2XR7Vq60ijYXyMP9dDMYqZvFhL4+ya3qqz0dvckNRb8Ngj6fnKKyvLgO4vSQvzAXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:30:11.841059Z"},"content_sha256":"76de2c6deb59b94da101e677595991c8dc26fd238c565b7bf6d4b819bc9ec8d3","schema_version":"1.0","event_id":"sha256:76de2c6deb59b94da101e677595991c8dc26fd238c565b7bf6d4b819bc9ec8d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MDCZ6MCRL4LPR4ZYHYJA44CEHD","target":"graph","payload":{"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"},"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-18T04:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUsnjpzHLC4qybMJJ7lRQ31p95dn2u1EA0RNVwSp6xrUOFbSRjAI97BXd7YnyPv6XbyJIqHp+NbESRHNvJswBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:30:11.841686Z"},"content_sha256":"1d0da066fe9b6a1607712b7c16454ba8ef01856d2693fae99b6d5e62590977a3","schema_version":"1.0","event_id":"sha256:1d0da066fe9b6a1607712b7c16454ba8ef01856d2693fae99b6d5e62590977a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/bundle.json","state_url":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/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-27T02:30:11Z","links":{"resolver":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD","bundle":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/bundle.json","state":"https://pith.science/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDCZ6MCRL4LPR4ZYHYJA44CEHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MDCZ6MCRL4LPR4ZYHYJA44CEHD","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":"2866fd5aed4c7a85ecf984b71b1018ac070d61758cf93d8c7519374c86871263","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T09:24:48Z","title_canon_sha256":"6fb46bddd52661a3a2e3c3010fef9dfe0234b9137f78f01d9ba5326131af68cb"},"schema_version":"1.0","source":{"id":"1107.3658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3658","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3658v1","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3658","created_at":"2026-05-18T04:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"MDCZ6MCRL4LP","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MDCZ6MCRL4LPR4ZY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MDCZ6MCR","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:1d0da066fe9b6a1607712b7c16454ba8ef01856d2693fae99b6d5e62590977a3","target":"graph","created_at":"2026-05-18T04:17:24Z","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":"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","authors_text":"Bart M. P. Jansen, Stefan Kratsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T09:24:48Z","title":"On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3658","kind":"arxiv","version":1},"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:76de2c6deb59b94da101e677595991c8dc26fd238c565b7bf6d4b819bc9ec8d3","target":"record","created_at":"2026-05-18T04:17:24Z","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":"2866fd5aed4c7a85ecf984b71b1018ac070d61758cf93d8c7519374c86871263","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-19T09:24:48Z","title_canon_sha256":"6fb46bddd52661a3a2e3c3010fef9dfe0234b9137f78f01d9ba5326131af68cb"},"schema_version":"1.0","source":{"id":"1107.3658","kind":"arxiv","version":1}},"canonical_sha256":"60c59f30515f16f8f3383e120e704438ebfa8135a2cab5453d544858d36491a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60c59f30515f16f8f3383e120e704438ebfa8135a2cab5453d544858d36491a0","first_computed_at":"2026-05-18T04:17:24.280042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:24.280042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iv8GZoLHdAabGo7phhEQpZ69vUQRkJ3DyIDqAcR++WNrolLcn0zkF4jX5wdO9/0Y/11HPU+dqIH9iPbBkPMcCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:24.280727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76de2c6deb59b94da101e677595991c8dc26fd238c565b7bf6d4b819bc9ec8d3","sha256:1d0da066fe9b6a1607712b7c16454ba8ef01856d2693fae99b6d5e62590977a3"],"state_sha256":"566060871a713498a83a2770bc2971640d51f2d745093db90984600c832a10dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dLDLlRLwdsUdZfIQPQ303RTEDsdDw26vUYftSfEyLDIkC2e4z9gRKqEFEH1cxyknwATuS4cHL3qxq9Y1sXLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:30:11.845004Z","bundle_sha256":"07ea097406471ecbbf2f493831983e1a5f929521effbda03fe4028a344209abb"}}