{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0080"},"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-0080","number":11955,"title":{"zh-Hant":"第 11955 題：凸最佳化問題","en":"Question 11955: 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":"f40a12f25dbd7583125275d39ed4f781bc5edc38d2c2cfdeb8b64cca554510b8","derivation_sha256":"c52c303397e7a22c2f6f203cba7f0e980860c51d7b016548d9e333bee2b3c03d"}]}