{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"mko":"mko-max-flow-min-cut-theorem","page":"3"},"total":100,"page":3,"page_count":4,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0026","number":25951,"title":{"zh-Hant":"第 25951 題：最大流最小割定理","en":"Question 25951: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"01f7ea00a9f7b170de86d39ca2eee0f453ae78f8ed8e17855c3ef4bf9affec08","derivation_sha256":"6d88b77c808d7344cafc95b3857ad2aefa0e2e66061de5f179b64c22497325fc"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0027","number":25952,"title":{"zh-Hant":"第 25952 題：最大流最小割定理","en":"Question 25952: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"a129c06a2b2a8992b7bde45a121e6a4ea5e6fcebba4048dfb5183f150c155217","derivation_sha256":"4620e48153198a2feb8ef1698f826d913c20c5fd7b1eaea99bdb4cd7bf028fd7"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0028","number":25953,"title":{"zh-Hant":"第 25953 題：最大流最小割定理","en":"Question 25953: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"4e377809f097f9a51a05159b45ad2c5d1fddf239d87df3ada34698273f21431b","derivation_sha256":"623ff1ff14df91d45d59adf660b3793901a87e64dc401dbccb6073fd0ac8c559"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0029","number":25954,"title":{"zh-Hant":"第 25954 題：最大流最小割定理","en":"Question 25954: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"2e0cecb4a18a74b5b891542c157ee2efc0372e539bb19c419e3bd3ba28f7657b","derivation_sha256":"d0a80e63091ed8234be72e1e54901a00f8c715c3a1c9ae63feec287b51f15ddf"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0030","number":25955,"title":{"zh-Hant":"第 25955 題：最大流最小割定理","en":"Question 25955: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"2e5e541792e75013ebefdbdc524fef57cba1ef2a80bcfab6f022b3ef80097133","derivation_sha256":"61019d61836ea0ddb4cbf99de8bc9d75a81349167db21beaccc158353cff85ab"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0031","number":25956,"title":{"zh-Hant":"第 25956 題：最大流最小割定理","en":"Question 25956: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"60937caa0da243dadf6bb39b8bd1ef730f75cf456e8e40cc57ec1cf33cf07149","derivation_sha256":"7a61eaae59d337bbb59195453efbe335782a41af883791c62609516209dbd8d6"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0032","number":25957,"title":{"zh-Hant":"第 25957 題：最大流最小割定理","en":"Question 25957: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"06cad729aa9f4e12c5f94252322ff2cbe6c36021fc083175b499bc96d962d82f","derivation_sha256":"4ed0e90c5592b179a85c919e8aa7f8e5056fa47ebaeafdd461781e35b378f1dc"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0033","number":25958,"title":{"zh-Hant":"第 25958 題：最大流最小割定理","en":"Question 25958: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"83dbee6701e5c401c7863ce65e55dcb4716aaa22bc1abffe1669310249d6a31f","derivation_sha256":"506c4b692767c7b0af1b24e5235ae7b1be161c7257fb7ea2e900c74c4e1c0a6f"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0034","number":25959,"title":{"zh-Hant":"第 25959 題：最大流最小割定理","en":"Question 25959: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"583124badf7c6918d833ff8d8856581664bd15f018294de1375f8243e0010222","derivation_sha256":"9d7e737e18d9aea7fe75afb8b8b16474983f7bd181f80ac574cabe09994b2461"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0035","number":25960,"title":{"zh-Hant":"第 25960 題：最大流最小割定理","en":"Question 25960: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"23d03a37cd72de0ff2f6b5a7527f7badd6b1109d172f18070bb18d92aa2f217e","derivation_sha256":"b2107bb16854dcbbe0d0acefadaa2d202c30474f63831c43a018c1140f2c3427"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0036","number":25961,"title":{"zh-Hant":"第 25961 題：最大流最小割定理","en":"Question 25961: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"7e96c39d085ed9561e59b4665a2eedda2e470a283f8c6f9756b4f001883fe728","derivation_sha256":"cc6d01b4d89670ce6442994870ff36bdba4f458ab0ee85514b0e1505ba1f6f67"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0037","number":25962,"title":{"zh-Hant":"第 25962 題：最大流最小割定理","en":"Question 25962: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"29702653f1522be8cb763692924185ec57f5129e52052f753e21e4e07ee243a5","derivation_sha256":"967032128a41ef449b15c907d4bc0ce7970f50f13b5b2b917a8e47422fedd15e"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0038","number":25963,"title":{"zh-Hant":"第 25963 題：最大流最小割定理","en":"Question 25963: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"43527d34394e847dbbe1520ab64e0caac876fe5c2a2e8f316263b03348164a69","derivation_sha256":"6fcae4007126af86657baebd5750e3da0dd7f2dd8d09de3d3836aca3b7e0b5cf"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0039","number":25964,"title":{"zh-Hant":"第 25964 題：最大流最小割定理","en":"Question 25964: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"9ee9c543eb4b817a3651b5f5e540161760e17132ee2667060fb911e53c213289","derivation_sha256":"87375a9fca8fcff5cd089dace50558433932e9e8744897b6a5bf6c548bb0ba85"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0040","number":25965,"title":{"zh-Hant":"第 25965 題：最大流最小割定理","en":"Question 25965: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"e80d617731e0c641cf014d3b13e623f7c02b1d7ab15267317e065973ddc5dbfa","derivation_sha256":"578c4ce62355b173a1499bec9e5d370353cfffda5e3f0379b249e8d200b4b5c1"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0041","number":25966,"title":{"zh-Hant":"第 25966 題：最大流最小割定理","en":"Question 25966: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"9d902905f5810ae8fc6e7c09f9a5ac49f7d1194c386b9d59ab80d3e6ec8766f0","derivation_sha256":"fbb0bd7a4e2dddc9465cf8812e86b1f093f23779e5b8f32607849efb91a66c8b"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0042","number":25967,"title":{"zh-Hant":"第 25967 題：最大流最小割定理","en":"Question 25967: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"a73d5f0cd827c2c13575684a8e94691456ed757ead30d95f79a8f0c98f807b0c","derivation_sha256":"ca0b86e226f32a0bca18049601018793780780d8d392acfacf9184f8059d15ea"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0043","number":25968,"title":{"zh-Hant":"第 25968 題：最大流最小割定理","en":"Question 25968: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"c991adc880280a3846b28c681dea8305891b15e5ef4782d53eca78a7e465dc44","derivation_sha256":"3c78c9a39dd54c3acb1d1c989a9c9c81e02a5527a80d396849815a01dad873e0"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0044","number":25969,"title":{"zh-Hant":"第 25969 題：最大流最小割定理","en":"Question 25969: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"2c47a06bc2594bd7c1115e891e54b20378b8ba0da88cded7c023b87cde0098b3","derivation_sha256":"8ac4a9634cc25d680b4b7aefba2440ba2a056f1b042d4bf58daaf7bee7a67bb6"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0045","number":25970,"title":{"zh-Hant":"第 25970 題：最大流最小割定理","en":"Question 25970: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"69ad9936b29b89f0939351f64425fb22d190bd9c8b40af00d2e088a0945d9380","derivation_sha256":"dd93d6090d7680ddb02febfdefc92568cb9ba19c2c4f4067e1a6cf428ba29812"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0046","number":25971,"title":{"zh-Hant":"第 25971 題：最大流最小割定理","en":"Question 25971: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"560caa9af7419f46ab0b983587f8584a3d0e8b8599a52c2d5941943f30197f9c","derivation_sha256":"2d5b71ad813b06608af6ec90af46bbd05ebb22a96a31c819d9eb670c2a90c8f8"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0047","number":25972,"title":{"zh-Hant":"第 25972 題：最大流最小割定理","en":"Question 25972: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"ef177af067c0cf4be6d7248ae7bdeb5b35c77ffbf1deafab93cf4127328c41a8","derivation_sha256":"fbac0c5b139b50511e0bf2919ff9ba149fbbfffdfe41cbceae986364b8d72604"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0048","number":25973,"title":{"zh-Hant":"第 25973 題：最大流最小割定理","en":"Question 25973: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"a40ccc7a68e634c3a68b6c8dee15d91ab3836b5b5a36f32860c9d5ac4c2d75e0","derivation_sha256":"06c0bdc45eef0a3739f533461bb464d8979ed637086e0060c9e45e7555ac380b"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0049","number":25974,"title":{"zh-Hant":"第 25974 題：最大流最小割定理","en":"Question 25974: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"f81f6bf2d48b4ba47a44d7678de695fb4a4cbb97c0df42e3168eeb2bbfe8d5a1","derivation_sha256":"847068de4e70f4f94fbd634dd04d88b00b633a9618de5a75c04b434be93cd947"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0050","number":25975,"title":{"zh-Hant":"第 25975 題：最大流最小割定理","en":"Question 25975: A Feasible Flow Is Bounded above by Every Cut, Not Automatically Maximum"},"family_id":"qf-mod46-mfmc-flow-cut-upper-bound","batch_id":"batch-20261015-advance-20261115-r05-max-flow-min-cut-theorem-foundations","mko_ids":["mko-max-flow-min-cut-theorem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"72ff24c3afb61f7a7b8841fd300b3d0a1a8a75a8f4d05d2b9dac428d5ca75ebf","derivation_sha256":"a69b8d4687cce72495ca384f3f2c8f0ddca004a5309ab7329da85473e28d9568"}]}