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