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