{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0099"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0099","number":11974,"title":{"zh-Hant":"第 11974 題：凸最佳化問題","en":"Question 11974: Compare Only Two Eligible Candidates, Not the Whole Problem"},"family_id":"qf-mod25-convexopt-pairwise-feasible-comparison","batch_id":"batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations","mko_ids":["mko-convex-optimization-problem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"712d0d34fd170bd5772e4b5ff7f2f683d80079a7a67b9beb5656eabfe9148bd8","derivation_sha256":"db7a464ee15d994d9707d43bc6b9eef6e21e0b6f8eaf94fc0a95177c9a3720df"}]}