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