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