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