{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0069"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261014-advance-20261031-r02-bipartite-graph-0069","number":15569,"title":{"zh-Hant":"第 15569 題：二分圖","en":"Question 15569: An Actual Simple Odd Cycle Certifies Nonbipartiteness"},"family_id":"qf-mod31-bipartite-odd-cycle","batch_id":"batch-20261014-advance-20261031-r02-bipartite-graph-foundations","mko_ids":["mko-bipartite-graph"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"ba092e57305257ff3662d9bed1e9d647fe5e21c0142812506144133832e75c4f","derivation_sha256":"9770f8609a9f9c06cfdc1a399312f23197075e6d21e85cd72f0922a3f163feda"}]}