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