{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0026"},"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-0026","number":15501,"title":{"zh-Hant":"第 15501 題：二分圖","en":"Question 15501: 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":"3cc771a1498d098f2ecb79d3209f3911bd262b82c1e275a1665504190d3e05c1","derivation_sha256":"92d755cab3d1e79d63faa49b82b6ed136b806149db6895413baf9e45a2957f99"}]}