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