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