{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:K7DY247NRNOYEJLZ5JAFTYOG7O","short_pith_number":"pith:K7DY247N","schema_version":"1.0","canonical_sha256":"57c78d73ed8b5d822579ea4059e1c6fbae3e14ed7f9f23db8a9096c42b6e5757","source":{"kind":"arxiv","id":"1102.5441","version":2},"attestation_state":"computed","paper":{"title":"Obtaining a Bipartite Graph by Contracting Few Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Daniel Lokshtanov, Pim van 't Hof, Pinar Heggernes","submitted_at":"2011-02-26T20:07:27Z","abstract_excerpt":"We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph $G$ and an integer $k$, and the task is to determine whether we can obtain a bipartite graph from $G$ by a sequence of at most $k$ edge contractions. Our main result is an $f(k) n^{O(1)}$ time algorithm for Bipartite Contraction. Despite a strong resemblance between Bipartite Contraction and the classical Odd Cycle Transversal (OCT) problem, the methods developed to tackle OCT do not seem to be directly applicable to Bipartite Contraction. Our algori"},"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":"1102.5441","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-26T20:07:27Z","cross_cats_sorted":[],"title_canon_sha256":"7402638c42b111e087424a804ae2572f5242e29ba1c3a94315d8c4ad9f1a8f8c","abstract_canon_sha256":"496fbd26f3bf41e162c14ceae39d9167dfe0a699d28494625179e1328acbb617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:17.432588Z","signature_b64":"wjTnyGQYw6bjlqySXBblBnbBd9EbQMRuYHbTUWCOQsseyTHdnPGDFT92cuzwrSyj/NEe1KuQBUsZKCF57HX5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c78d73ed8b5d822579ea4059e1c6fbae3e14ed7f9f23db8a9096c42b6e5757","last_reissued_at":"2026-05-18T04:27:17.431988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:17.431988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Obtaining a Bipartite Graph by Contracting Few Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Daniel Lokshtanov, Pim van 't Hof, Pinar Heggernes","submitted_at":"2011-02-26T20:07:27Z","abstract_excerpt":"We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph $G$ and an integer $k$, and the task is to determine whether we can obtain a bipartite graph from $G$ by a sequence of at most $k$ edge contractions. Our main result is an $f(k) n^{O(1)}$ time algorithm for Bipartite Contraction. Despite a strong resemblance between Bipartite Contraction and the classical Odd Cycle Transversal (OCT) problem, the methods developed to tackle OCT do not seem to be directly applicable to Bipartite Contraction. Our algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5441","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":"1102.5441","created_at":"2026-05-18T04:27:17.432083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5441v2","created_at":"2026-05-18T04:27:17.432083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5441","created_at":"2026-05-18T04:27:17.432083+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7DY247NRNOY","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7DY247NRNOYEJLZ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7DY247N","created_at":"2026-05-18T12:26:32.869790+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/K7DY247NRNOYEJLZ5JAFTYOG7O","json":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O.json","graph_json":"https://pith.science/api/pith-number/K7DY247NRNOYEJLZ5JAFTYOG7O/graph.json","events_json":"https://pith.science/api/pith-number/K7DY247NRNOYEJLZ5JAFTYOG7O/events.json","paper":"https://pith.science/paper/K7DY247N"},"agent_actions":{"view_html":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O","download_json":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O.json","view_paper":"https://pith.science/paper/K7DY247N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5441&json=true","fetch_graph":"https://pith.science/api/pith-number/K7DY247NRNOYEJLZ5JAFTYOG7O/graph.json","fetch_events":"https://pith.science/api/pith-number/K7DY247NRNOYEJLZ5JAFTYOG7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O/action/storage_attestation","attest_author":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O/action/author_attestation","sign_citation":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O/action/citation_signature","submit_replication":"https://pith.science/pith/K7DY247NRNOYEJLZ5JAFTYOG7O/action/replication_record"}},"created_at":"2026-05-18T04:27:17.432083+00:00","updated_at":"2026-05-18T04:27:17.432083+00:00"}