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