{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZS5UUHTUP4IDB5SSFYIF4IVCNX","short_pith_number":"pith:ZS5UUHTU","schema_version":"1.0","canonical_sha256":"ccbb4a1e747f1030f6522e105e22a26de69329f6c2a7751a74e14066c401bc0b","source":{"kind":"arxiv","id":"1107.3068","version":2},"attestation_state":"computed","paper":{"title":"Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Magnus Wahlstr\\\"om, Stefan Kratsch","submitted_at":"2011-07-15T13:54:00Z","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"},"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.3068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-15T13:54:00Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"20d052b2870c88b9e0e4694c69b8b68f9ca39d630888eaed1152025d9e2a9806","abstract_canon_sha256":"e8b7fe53998f058625f1af6af1a38fe9d66846c35b4d26f2aba9e94228e86387"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.855174Z","signature_b64":"rXHqaeS35dLiQvsaiXGo5oJFS14Adq8C+0l/t4RY7P4bTmEl692zrh0Je2Uch9+1m4xJ9ffGfkxRQuXEHzuGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccbb4a1e747f1030f6522e105e22a26de69329f6c2a7751a74e14066c401bc0b","last_reissued_at":"2026-05-18T02:21:42.854744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.854744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Magnus Wahlstr\\\"om, Stefan Kratsch","submitted_at":"2011-07-15T13:54:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3068","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":"1107.3068","created_at":"2026-05-18T02:21:42.854806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3068v2","created_at":"2026-05-18T02:21:42.854806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3068","created_at":"2026-05-18T02:21:42.854806+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS5UUHTUP4ID","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS5UUHTUP4IDB5SS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS5UUHTU","created_at":"2026-05-18T12:26:50.516681+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/ZS5UUHTUP4IDB5SSFYIF4IVCNX","json":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX.json","graph_json":"https://pith.science/api/pith-number/ZS5UUHTUP4IDB5SSFYIF4IVCNX/graph.json","events_json":"https://pith.science/api/pith-number/ZS5UUHTUP4IDB5SSFYIF4IVCNX/events.json","paper":"https://pith.science/paper/ZS5UUHTU"},"agent_actions":{"view_html":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX","download_json":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX.json","view_paper":"https://pith.science/paper/ZS5UUHTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3068&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS5UUHTUP4IDB5SSFYIF4IVCNX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS5UUHTUP4IDB5SSFYIF4IVCNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX/action/storage_attestation","attest_author":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX/action/author_attestation","sign_citation":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX/action/citation_signature","submit_replication":"https://pith.science/pith/ZS5UUHTUP4IDB5SSFYIF4IVCNX/action/replication_record"}},"created_at":"2026-05-18T02:21:42.854806+00:00","updated_at":"2026-05-18T02:21:42.854806+00:00"}