{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0067"},"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-0067","number":15567,"title":{"zh-Hant":"第 15567 題：二分圖","en":"Question 15567: 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":"e617b264b24f8b515048bc83e8b4d9cf97d0c05f73d4f21530c16af57771a2a3","derivation_sha256":"572f1d3089f724f2e84fd7afe8fa3f463167129146686bf8dfd950dc219a34af"}]}