{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0041"},"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-0041","number":15516,"title":{"zh-Hant":"第 15516 題：二分圖","en":"Question 15516: One Edge Crossing Is Separate from the Whole Partition Audit"},"family_id":"qf-mod31-bipartite-edge-crossing","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":"0c9a5e712fbd6fa6dab3864218d4d3c2cd2d896b2e3f3e76feb27f80631fdf9b","derivation_sha256":"1cf1d05cc3fcaf187efd713e8f5c1795c84c50f615147590cdedd7cbfc5a34f1"}]}