{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UVFVJUYKR7UC46P7FZFRDUOAZM","short_pith_number":"pith:UVFVJUYK","schema_version":"1.0","canonical_sha256":"a54b54d30a8fe82e79ff2e4b11d1c0cb11800f4bed2f9e1110b5e43dede52567","source":{"kind":"arxiv","id":"1710.07741","version":2},"attestation_state":"computed","paper":{"title":"On the Computational Complexity of the Bipartizing Matching Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Carlos V.G.C. Lima, Dieter Rautenbach, Jayme L. Szwarcfiter, U\\'everton S. Souza","submitted_at":"2017-10-21T02:25:50Z","abstract_excerpt":"We study the problem of determining whether a given graph~$G=(V,E)$ admits a matching~$M$ whose removal destroys all odd cycles of~$G$ (or equivalently whether~$G-M$ is bipartite). This problem is equivalent to determine whether~$G$ admits a~$(2,1)$-coloring, which is a~$2$-coloring of~$V(G)$ such that each color class induces a graph of maximum degree at most~$1$. We determine a dichotomy related to the~{\\sf NP}-completeness of this problem, where we show that it is~{\\sf NP}-complete even for $3$-colorable planar graphs of maximum degree~$4$, while it is known that the problem can be solved i"},"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":"1710.07741","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2017-10-21T02:25:50Z","cross_cats_sorted":[],"title_canon_sha256":"b2dbccd0112d56140bf847b665812c8d26733d01165e1ebaaaa1e8fd31edd9dd","abstract_canon_sha256":"effb3711262c51d597b395870775ef48e0f5d850504aea869bf4dd0b66ef4461"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:43.376533Z","signature_b64":"fKvvWHgp0fw2M6HGyROXmPileB7Pk/owVBgH/dESR0DxiwFb1jLpp4PkreBAJZ9axROAprIUQad873/tfV3vBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a54b54d30a8fe82e79ff2e4b11d1c0cb11800f4bed2f9e1110b5e43dede52567","last_reissued_at":"2026-05-17T23:43:43.375894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:43.375894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computational Complexity of the Bipartizing Matching Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Carlos V.G.C. Lima, Dieter Rautenbach, Jayme L. Szwarcfiter, U\\'everton S. Souza","submitted_at":"2017-10-21T02:25:50Z","abstract_excerpt":"We study the problem of determining whether a given graph~$G=(V,E)$ admits a matching~$M$ whose removal destroys all odd cycles of~$G$ (or equivalently whether~$G-M$ is bipartite). This problem is equivalent to determine whether~$G$ admits a~$(2,1)$-coloring, which is a~$2$-coloring of~$V(G)$ such that each color class induces a graph of maximum degree at most~$1$. We determine a dichotomy related to the~{\\sf NP}-completeness of this problem, where we show that it is~{\\sf NP}-complete even for $3$-colorable planar graphs of maximum degree~$4$, while it is known that the problem can be solved i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07741","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":"1710.07741","created_at":"2026-05-17T23:43:43.376022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07741v2","created_at":"2026-05-17T23:43:43.376022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07741","created_at":"2026-05-17T23:43:43.376022+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVFVJUYKR7UC","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVFVJUYKR7UC46P7","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVFVJUYK","created_at":"2026-05-18T12:31:49.984773+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/UVFVJUYKR7UC46P7FZFRDUOAZM","json":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM.json","graph_json":"https://pith.science/api/pith-number/UVFVJUYKR7UC46P7FZFRDUOAZM/graph.json","events_json":"https://pith.science/api/pith-number/UVFVJUYKR7UC46P7FZFRDUOAZM/events.json","paper":"https://pith.science/paper/UVFVJUYK"},"agent_actions":{"view_html":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM","download_json":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM.json","view_paper":"https://pith.science/paper/UVFVJUYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07741&json=true","fetch_graph":"https://pith.science/api/pith-number/UVFVJUYKR7UC46P7FZFRDUOAZM/graph.json","fetch_events":"https://pith.science/api/pith-number/UVFVJUYKR7UC46P7FZFRDUOAZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM/action/storage_attestation","attest_author":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM/action/author_attestation","sign_citation":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM/action/citation_signature","submit_replication":"https://pith.science/pith/UVFVJUYKR7UC46P7FZFRDUOAZM/action/replication_record"}},"created_at":"2026-05-17T23:43:43.376022+00:00","updated_at":"2026-05-17T23:43:43.376022+00:00"}