{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261014-advance-20261031-r02-bipartite-graph-0037"},"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-0037","number":15512,"title":{"zh-Hant":"第 15512 題：二分圖","en":"Question 15512: 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":"8f88a6c2d1ca76d194398825e2c38c53e5b59645cc0a31ff557af6b421d99a4f","derivation_sha256":"84d3291aeb3b91d9d823deed1ce157d23fd8a77684eab307faa500b18c8ca914"}]}