{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZS5UUHTUP4IDB5SSFYIF4IVCNX","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":"e8b7fe53998f058625f1af6af1a38fe9d66846c35b4d26f2aba9e94228e86387","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-15T13:54:00Z","title_canon_sha256":"20d052b2870c88b9e0e4694c69b8b68f9ca39d630888eaed1152025d9e2a9806"},"schema_version":"1.0","source":{"id":"1107.3068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.3068","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.3068v2","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3068","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZS5UUHTUP4ID","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZS5UUHTUP4IDB5SS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZS5UUHTU","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:a4839d9aa5824fda03ab1ec33d885c147689103468ac45f36b4782fc20a2d267","target":"graph","created_at":"2026-05-18T02:21:42Z","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 by deleting at most $k$ of its vertices. In a breakthrough result Reed, Smith, and Vetta (Operations Research Letters, 2004) gave a $\\BigOh(4^kkmn)$ time algorithm for it, the first algorithm with polynomial runtime of uniform degree for every fixed $k$. It is known that this implies a polynomial-time compression algorithm that turns OCT instances into equivalent instances of size at most $\\BigOh(4^k)$, a so-called kernelization. Since then the existence of a polynomial kernel for OCT, i.e., a kernelizatio","authors_text":"Magnus Wahlstr\\\"om, Stefan Kratsch","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-15T13:54:00Z","title":"Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3068","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:17c42d7213b989a73972d4d1cb334999b06add3c6309ee3f64416b5aa061a3a1","target":"record","created_at":"2026-05-18T02:21:42Z","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":"e8b7fe53998f058625f1af6af1a38fe9d66846c35b4d26f2aba9e94228e86387","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-15T13:54:00Z","title_canon_sha256":"20d052b2870c88b9e0e4694c69b8b68f9ca39d630888eaed1152025d9e2a9806"},"schema_version":"1.0","source":{"id":"1107.3068","kind":"arxiv","version":2}},"canonical_sha256":"ccbb4a1e747f1030f6522e105e22a26de69329f6c2a7751a74e14066c401bc0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccbb4a1e747f1030f6522e105e22a26de69329f6c2a7751a74e14066c401bc0b","first_computed_at":"2026-05-18T02:21:42.854744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.854744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rXHqaeS35dLiQvsaiXGo5oJFS14Adq8C+0l/t4RY7P4bTmEl692zrh0Je2Uch9+1m4xJ9ffGfkxRQuXEHzuGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.855174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.3068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17c42d7213b989a73972d4d1cb334999b06add3c6309ee3f64416b5aa061a3a1","sha256:a4839d9aa5824fda03ab1ec33d885c147689103468ac45f36b4782fc20a2d267"],"state_sha256":"8cda1a440e90a03ee10db2e2d1e2538d09f92c86f758bc49590496f8c64bbccd"}