{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0071"},"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-0071","number":15571,"title":{"zh-Hant":"第 15571 題：二分圖","en":"Question 15571: 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":"0ce864f10e3c26f8401dea18d6aafd6ea4e47e79957ba235a79a704d6669d714","derivation_sha256":"0597914d5a7fa25f8eefc41a157cf9899a2dd632b32473915ab779e3cbedf139"}]}