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