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