{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OCGPBRV3LP4MTCCY75CYGUNZPN","short_pith_number":"pith:OCGPBRV3","schema_version":"1.0","canonical_sha256":"708cf0c6bb5bf8c98858ff458351b97b45d5519ec0b04f91e8d38161adb9bc4a","source":{"kind":"arxiv","id":"1807.10277","version":1},"attestation_state":"computed","paper":{"title":"On a reduction of the weighted induced bipartite subgraph problem to the weighted independent set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Shinji Mizuno, Yotaro Takazawa","submitted_at":"2018-07-25T23:32:50Z","abstract_excerpt":"We study the weighted induced bipartite subgraph problem (WIBSP). The goal of WIBSP is, given a graph and nonnegative weights for the nodes, to find a set W of nodes with the maximum total weight such that a subgraph induced by W is bipartite. WIBSP is also referred as to the graph bipartization problem or the odd cycle transversal problem. In this paper, we show that WIBSP can be reduced to the weighted independent set problem (WISP) where the number of nodes becomes twice and the maximum degree increase by 1. WISP is a well-studied combinatorial optimization problem. Thus, by using the reduc"},"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":"1807.10277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-25T23:32:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b04141107ff69b4ee240e045b8ae5adae34f84c4e7f36a5916bfc575738e467d","abstract_canon_sha256":"6116fbb7c90a2fa351a5ee0c0907e3d4d242d7e7de7aa4ca79576956b10824df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:41.105995Z","signature_b64":"T8j1G/dppjONS1mRAwuf32OTBi0HAqGZSuN9P8qclCGwC2w28I0MbwQm6WvCAo6wPaiEs3meA6yNQcLv3/tTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"708cf0c6bb5bf8c98858ff458351b97b45d5519ec0b04f91e8d38161adb9bc4a","last_reissued_at":"2026-05-18T00:09:41.105149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:41.105149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a reduction of the weighted induced bipartite subgraph problem to the weighted independent set problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Shinji Mizuno, Yotaro Takazawa","submitted_at":"2018-07-25T23:32:50Z","abstract_excerpt":"We study the weighted induced bipartite subgraph problem (WIBSP). The goal of WIBSP is, given a graph and nonnegative weights for the nodes, to find a set W of nodes with the maximum total weight such that a subgraph induced by W is bipartite. WIBSP is also referred as to the graph bipartization problem or the odd cycle transversal problem. In this paper, we show that WIBSP can be reduced to the weighted independent set problem (WISP) where the number of nodes becomes twice and the maximum degree increase by 1. WISP is a well-studied combinatorial optimization problem. Thus, by using the reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10277","kind":"arxiv","version":1},"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":"1807.10277","created_at":"2026-05-18T00:09:41.105276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10277v1","created_at":"2026-05-18T00:09:41.105276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10277","created_at":"2026-05-18T00:09:41.105276+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCGPBRV3LP4M","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCGPBRV3LP4MTCCY","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCGPBRV3","created_at":"2026-05-18T12:32:43.782077+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/OCGPBRV3LP4MTCCY75CYGUNZPN","json":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN.json","graph_json":"https://pith.science/api/pith-number/OCGPBRV3LP4MTCCY75CYGUNZPN/graph.json","events_json":"https://pith.science/api/pith-number/OCGPBRV3LP4MTCCY75CYGUNZPN/events.json","paper":"https://pith.science/paper/OCGPBRV3"},"agent_actions":{"view_html":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN","download_json":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN.json","view_paper":"https://pith.science/paper/OCGPBRV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10277&json=true","fetch_graph":"https://pith.science/api/pith-number/OCGPBRV3LP4MTCCY75CYGUNZPN/graph.json","fetch_events":"https://pith.science/api/pith-number/OCGPBRV3LP4MTCCY75CYGUNZPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN/action/storage_attestation","attest_author":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN/action/author_attestation","sign_citation":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN/action/citation_signature","submit_replication":"https://pith.science/pith/OCGPBRV3LP4MTCCY75CYGUNZPN/action/replication_record"}},"created_at":"2026-05-18T00:09:41.105276+00:00","updated_at":"2026-05-18T00:09:41.105276+00:00"}