{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"family":"qf-mod25-convexopt-pairwise-feasible-comparison"},"total":25,"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-0076","number":11951,"title":{"zh-Hant":"第 11951 題：凸最佳化問題","en":"Question 11951: 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":"ea3648122dfd14c18cc460d82c4e7ccb781062436f63c55731168a64a7666691","derivation_sha256":"1708750c7cf48ca3a9793bd401b87f30ac61b9f9fd326b0c62a2644337f06792"},{"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"},{"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"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0079","number":11954,"title":{"zh-Hant":"第 11954 題：凸最佳化問題","en":"Question 11954: 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":"b576190f971f27771acb6a7b2536fea35a05d35f2b5f98559b9b0c926e74e42b","derivation_sha256":"c5240bdacdaf50820fe4c30e78b2624a33e35099de10ec50d4051440dfff021f"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0080","number":11955,"title":{"zh-Hant":"第 11955 題：凸最佳化問題","en":"Question 11955: 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":"f40a12f25dbd7583125275d39ed4f781bc5edc38d2c2cfdeb8b64cca554510b8","derivation_sha256":"c52c303397e7a22c2f6f203cba7f0e980860c51d7b016548d9e333bee2b3c03d"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0081","number":11956,"title":{"zh-Hant":"第 11956 題：凸最佳化問題","en":"Question 11956: 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":"93062a4d5d48551e3c7ec3274eba59e470252d6768d668183ad90c0259e30835","derivation_sha256":"d8e344dacf00a1717f8af4ce8cbd2d4531d05e65f4cabef67347c8a26daf00db"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0082","number":11957,"title":{"zh-Hant":"第 11957 題：凸最佳化問題","en":"Question 11957: 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":"2bee8d1d1ed50c0bf3ea900b575b5b2db8cf55d87fec82ffd5683092659a57f2","derivation_sha256":"7683a9e8ccf5cfb024268c01e39e33b0d9f506fea6fc82e337318db73ecc95e7"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0083","number":11958,"title":{"zh-Hant":"第 11958 題：凸最佳化問題","en":"Question 11958: 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":"7b0837be5200a0f56d3e17af25c574da0207837aa5022afea2525aafd5020eab","derivation_sha256":"4aee12ab4b9792d8cc83afde39ee8636a42578ee5f38e3e4d00f668956fca087"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0084","number":11959,"title":{"zh-Hant":"第 11959 題：凸最佳化問題","en":"Question 11959: 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":"3a46c76979be4672958be320b5b37dc1edccf6f9aa3206f64e0939d3c1b5f30e","derivation_sha256":"86e2bbb8a011d19ee989937edad7146896486f1ab9c8a3be235e7d4764519bb9"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0085","number":11960,"title":{"zh-Hant":"第 11960 題：凸最佳化問題","en":"Question 11960: 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":"80878debe6b7845e31459a41e1a52e943d6351cae0c1127ee29dc0fee5b8c888","derivation_sha256":"5b0687ddae430531470c2e29190ee08d8d4e9d86c20deceb6dcf63747eb71d47"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0086","number":11961,"title":{"zh-Hant":"第 11961 題：凸最佳化問題","en":"Question 11961: 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":"4572497b3450fcf79fda61c7fe762d69886bda1936ef4958110815d88599868a","derivation_sha256":"7c62c9c601c0745044733a2b2e145dae69fff835a3d4edbceda7982e310dba1c"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0087","number":11962,"title":{"zh-Hant":"第 11962 題：凸最佳化問題","en":"Question 11962: 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":"672e3ea9c81b79270dc258d64260f20d7cb5461c34b95103c97b7f4ff5fd7d63","derivation_sha256":"3613426407a23b197ce4e8ef0f1ead5459f69fa0ea2ba6eae297ec2e784d01c6"},{"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"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0089","number":11964,"title":{"zh-Hant":"第 11964 題：凸最佳化問題","en":"Question 11964: 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":"ba397318dd5406b5b13ecdf888b83788749115db99af8ee99bb19d762ccada46","derivation_sha256":"fe7eaf3d8a87e197aaf6b3f2c6c191f8db5f3f24132245e96b3caf2ecea76f57"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0090","number":11965,"title":{"zh-Hant":"第 11965 題：凸最佳化問題","en":"Question 11965: 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":"a41b4e0f5df545fa7a2aee0eae5baafaac476981f55fd38f1f425be78125bc15","derivation_sha256":"3e9ac43cbf656892df71bff8dae124eed79b941666fd8fb22db8056f4a6fe858"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0091","number":11966,"title":{"zh-Hant":"第 11966 題：凸最佳化問題","en":"Question 11966: 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":"d23d8eab31c3be53e4d06cb88b39647b1c40e8668e57ae0d4fafc2e511489fb8","derivation_sha256":"c1bf16f618e5dd050fbb4a054b7c84973e937ccca71ae034d11c2d0a7e47b2c1"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0092","number":11967,"title":{"zh-Hant":"第 11967 題：凸最佳化問題","en":"Question 11967: 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":"69fe6ad2a392b94dd81b937f378e2172d4875f5c14eeeeff3f217bd6591fdc32","derivation_sha256":"277e55c926dee34d1f3087deeb1d9c926e7ed0564533c5bbf85d7e6148ffb186"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0093","number":11968,"title":{"zh-Hant":"第 11968 題：凸最佳化問題","en":"Question 11968: 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":"89df9ec580945514d47cb04fdcb1f7b5c44bb5b017687f6763f116bc2f759ba2","derivation_sha256":"70e25edfa8e34203d38d069be3d3d7b2f8862df62586e1856bf3af979dce1940"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0094","number":11969,"title":{"zh-Hant":"第 11969 題：凸最佳化問題","en":"Question 11969: 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":"95dc8a40af78b4165c92ffb903cfc9d714904fc878389dcf817957982095f118","derivation_sha256":"4799b3921c56714398af06e9d0e2b5f182db0eaaf1521a4e6c033b443b31da21"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0095","number":11970,"title":{"zh-Hant":"第 11970 題：凸最佳化問題","en":"Question 11970: 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":"c51c1ff24acd1de76b2e8f037dd4f24ed9f1fe4e33c2ad34f61cd4cf3a09e0c0","derivation_sha256":"a9ba9a7df53590ea0369e94dd91a0d8c9fb4ea8d12d67732e0038f41b3dc66e4"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0096","number":11971,"title":{"zh-Hant":"第 11971 題：凸最佳化問題","en":"Question 11971: 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":"2d936782304ec4ab58e36f02441d14d883d19deece5105626591df8386e329be","derivation_sha256":"789423c17191006d680f069a81274913ca7c51ec6b5ad7deea7b7fe0536b76c3"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0097","number":11972,"title":{"zh-Hant":"第 11972 題：凸最佳化問題","en":"Question 11972: 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":"4ae66021e8c8f6cb7943a498112f9514a0e29884c4a9c1cc63ec7b806dcda4dd","derivation_sha256":"9d4653263f83a67b4fbff0579dba8517ef021e1b68c2ec44af690a0b104a45ae"},{"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"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0099","number":11974,"title":{"zh-Hant":"第 11974 題：凸最佳化問題","en":"Question 11974: 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":"712d0d34fd170bd5772e4b5ff7f2f683d80079a7a67b9beb5656eabfe9148bd8","derivation_sha256":"db7a464ee15d994d9707d43bc6b9eef6e21e0b6f8eaf94fc0a95177c9a3720df"},{"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"}]}