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