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