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