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