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