{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KEX2VY525UPVXZK2MOOGUSW7FM","short_pith_number":"pith:KEX2VY52","schema_version":"1.0","canonical_sha256":"512faae3baed1f5be55a639c6a4adf2b010b6ac8ff272ff1cbeca9e0b619560a","source":{"kind":"arxiv","id":"1305.2743","version":3},"attestation_state":"computed","paper":{"title":"A faster FPT algorithm for Bipartite Contraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Sylvain Guillemot","submitted_at":"2013-05-13T11:25:01Z","abstract_excerpt":"The \\textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown by [Heggernes et al. 2011], with an algorithm whose running time has double-exponential dependence on $k$. We present a new randomized FPT algorithm for the problem, which is both conceptually simpler and achieves an improved $2^{O(k^2)} n m$ running time, i.e., avoiding the double-exponential dependence on $k$. The algorithm can be derandomized using stand"},"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":"1305.2743","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-13T11:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"da6061e9e27d5fbfe93bb2a3edfe6ca1830cd3e1876147a11c6b4e4ec88c6fb2","abstract_canon_sha256":"8b069e31a3f93c909d96e3a6e819a95a1d9664f38f2d9221debaf889d9924806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:17.148468Z","signature_b64":"RGW3lo3q7NrZI7o6FGOOuUs07Z4VqNwGgnfoa4Gu6a2o8m0CeYUijDsOoAzE/SaVcNcP0fEGdSMN0oqjjV98BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512faae3baed1f5be55a639c6a4adf2b010b6ac8ff272ff1cbeca9e0b619560a","last_reissued_at":"2026-05-18T03:14:17.147605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:17.147605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A faster FPT algorithm for Bipartite Contraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Sylvain Guillemot","submitted_at":"2013-05-13T11:25:01Z","abstract_excerpt":"The \\textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown by [Heggernes et al. 2011], with an algorithm whose running time has double-exponential dependence on $k$. We present a new randomized FPT algorithm for the problem, which is both conceptually simpler and achieves an improved $2^{O(k^2)} n m$ running time, i.e., avoiding the double-exponential dependence on $k$. The algorithm can be derandomized using stand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2743","kind":"arxiv","version":3},"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":"1305.2743","created_at":"2026-05-18T03:14:17.147750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2743v3","created_at":"2026-05-18T03:14:17.147750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2743","created_at":"2026-05-18T03:14:17.147750+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEX2VY525UPV","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEX2VY525UPVXZK2","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEX2VY52","created_at":"2026-05-18T12:27:49.015174+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/KEX2VY525UPVXZK2MOOGUSW7FM","json":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM.json","graph_json":"https://pith.science/api/pith-number/KEX2VY525UPVXZK2MOOGUSW7FM/graph.json","events_json":"https://pith.science/api/pith-number/KEX2VY525UPVXZK2MOOGUSW7FM/events.json","paper":"https://pith.science/paper/KEX2VY52"},"agent_actions":{"view_html":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM","download_json":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM.json","view_paper":"https://pith.science/paper/KEX2VY52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2743&json=true","fetch_graph":"https://pith.science/api/pith-number/KEX2VY525UPVXZK2MOOGUSW7FM/graph.json","fetch_events":"https://pith.science/api/pith-number/KEX2VY525UPVXZK2MOOGUSW7FM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/action/storage_attestation","attest_author":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/action/author_attestation","sign_citation":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/action/citation_signature","submit_replication":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/action/replication_record"}},"created_at":"2026-05-18T03:14:17.147750+00:00","updated_at":"2026-05-18T03:14:17.147750+00:00"}