{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0066"},"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-0066","number":15566,"title":{"zh-Hant":"第 15566 題：二分圖","en":"Question 15566: 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":"2bfc63f45a486d7af455249a92c128f0d5f2209a8ae02751259650fc6b692a8a","derivation_sha256":"9dd064aed54960c45dd32e3f452b9ebe99f147c5133e7c3870f26abac5f318d0"}]}