{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0030"},"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-0030","number":15505,"title":{"zh-Hant":"第 15505 題：二分圖","en":"Question 15505: 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":"96f1133c6c3bb05a98b1bd25a0bbd56d5c17afba90b745163e50b0373ad4353e","derivation_sha256":"1efd5d2129323cc7045747acc5b5cc8e18a539a5c602caf0fe3c925d6db1e143"}]}