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