{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0075"},"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-0075","number":15575,"title":{"zh-Hant":"第 15575 題：二分圖","en":"Question 15575: 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":"8e1de618f233f23fbe47c0775870f18e2f533a8001c56bc8a1c3fd08a59d2c47","derivation_sha256":"1ed4ca82e32272c6853cb8b144c49112d9b359d18dba6e7932d4e7b2ff4b69c9"}]}