{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"family":"qf-mod46-mfmc-equal-value-optimality"},"total":25,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0076","number":25926,"title":{"zh-Hant":"第 25926 題：最大流最小割定理","en":"Question 25926: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"c2f40892f70dfadf9930bbf500a9e5537fd65ec9fcbfe11bb3e9c83853afedf3","derivation_sha256":"692cc98a0191498a6cfb91a1d13b3a43f111fdb4becfd78b5bf86c1fe3d4a36f"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0077","number":25927,"title":{"zh-Hant":"第 25927 題：最大流最小割定理","en":"Question 25927: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"3289aaa4338d03f6eb747c10fb9baed3e5519e12bc073f0bfffaef637dbc2ad5","derivation_sha256":"a0c343484c374d0d029bdfe2e9aa6435ce8a0c59c74e1e2aa0fa538be4fe7f72"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0078","number":25928,"title":{"zh-Hant":"第 25928 題：最大流最小割定理","en":"Question 25928: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"090be1577566064b03615d5eb03084de013f9f8076f9c3a0e70ae269857cb786","derivation_sha256":"186fe6257024761968e97951c9513e7bd4f861fd52dc81f15c0365fac3a41ac5"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0079","number":25929,"title":{"zh-Hant":"第 25929 題：最大流最小割定理","en":"Question 25929: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"5ab8653e92550d12e5263816086b31f90b2a4caf39c8e5af0a217665ff63b4d8","derivation_sha256":"6be9b50ee5c730ec021cc853e744e4ebc172abaa8b82a19bb33715023b000c2b"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0080","number":25930,"title":{"zh-Hant":"第 25930 題：最大流最小割定理","en":"Question 25930: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"d4e64dea0b658a8eafe671f771ffa2e243418a047b2dcb4f9fb8aa3c92f1f16c","derivation_sha256":"afc990f281f7fd669f924d5913dc5d70958dc9fa2b284bca3903b0aff9f459cb"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0081","number":25931,"title":{"zh-Hant":"第 25931 題：最大流最小割定理","en":"Question 25931: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"be8652a91bb70c0436b98e00a3b10222d751d29d5dbd8fd5bcfcd83a3eaef498","derivation_sha256":"eadc5bdb1023618b2565ef9f51b2cc13a749f543b2835711dc2d149636dd6955"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0082","number":25932,"title":{"zh-Hant":"第 25932 題：最大流最小割定理","en":"Question 25932: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"3b4aacd0033e9902058fe60496f5fb863d12517da797aaa0d3c0d79416c10c18","derivation_sha256":"b3738b2eb41a249c4a3d0a5ff6bcc82c3a453cd489431f07a826f3bafd1e5555"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0083","number":25933,"title":{"zh-Hant":"第 25933 題：最大流最小割定理","en":"Question 25933: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"11910861e66fbc7afcf620c2ef568be992f9a00a8bc871eaa4c1977adbc2a3e7","derivation_sha256":"9a4328e5ff7bd7a77111fcc44d35b855c5d470bfbd4a5191a8febd960768606a"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0084","number":25934,"title":{"zh-Hant":"第 25934 題：最大流最小割定理","en":"Question 25934: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"05b377df9c57e3bd0842c5123a083b5611208dbf919f6f22d588a4260ab582b5","derivation_sha256":"6cb9025871a318b3eb41699ac7b143d38ac8a34812aa460ec227c9df7c1a8820"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0085","number":25935,"title":{"zh-Hant":"第 25935 題：最大流最小割定理","en":"Question 25935: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"9b8d482b5d3e1af5ec1bc9bf19bd5009b1222da96a3ffcc32848ea1f75da7aca","derivation_sha256":"335147b7203ec63a7b0c166a18d9491729ed38c3e5a2409bf9084ba6b4498360"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0086","number":25936,"title":{"zh-Hant":"第 25936 題：最大流最小割定理","en":"Question 25936: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"bd49b878a025f7d0920decc2ef36d23bb03cbf60033ce34e2fcc4e075947aa8c","derivation_sha256":"640afabc0decae6a2865fe8609ef9e5e5704b10ebfb49c49340760f7ef49c006"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0087","number":25937,"title":{"zh-Hant":"第 25937 題：最大流最小割定理","en":"Question 25937: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"b713ad7f45c824acc3ab89406dd2e993dfb26446ce300da65a43c1bb67981924","derivation_sha256":"993fd283fa0078238ee45639a37879cfe9897faf0c0399c61bf1e2b3b9e92587"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0088","number":25938,"title":{"zh-Hant":"第 25938 題：最大流最小割定理","en":"Question 25938: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"1256df878729bbf7e88dedda3a0833949c1c8b0e199cd82c8d9b58c51d6c7914","derivation_sha256":"f9f4df945d07c15f4b599e3ccd9a484eea2c98d9060a7e6cb87ec233e7a1dace"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0089","number":25939,"title":{"zh-Hant":"第 25939 題：最大流最小割定理","en":"Question 25939: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"cd84887d9d08fc6ede8abd7e10116a04f1b80f20aa9e73f280832aa7917541c7","derivation_sha256":"f23ea0c74cdf55b777fbb1259016604c82855d3575d9f7f08ea9bab0d76fa709"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0090","number":25940,"title":{"zh-Hant":"第 25940 題：最大流最小割定理","en":"Question 25940: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"ffc185449614cc1aba76511c4f4ec6bd49f29d3b3b09bae5055d6cd0ca3985c6","derivation_sha256":"100f79a57812c8258c5063de8d2f08fb29abdf44afda657d1bc5e6ff5f70ff07"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0091","number":25941,"title":{"zh-Hant":"第 25941 題：最大流最小割定理","en":"Question 25941: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"1f451f09b19e261fb5799d47d6c4dcae12bb49bbfc3aa4ca0d01e27a96cb7822","derivation_sha256":"c9481c8f7a7bd6dd202899ad7ae35965d33abd58186e3d3ec7ed85e1dd7491d3"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0092","number":25942,"title":{"zh-Hant":"第 25942 題：最大流最小割定理","en":"Question 25942: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"958280471eaae6564a585153b204fde6f440549b3fd3b269e7d6d6636d2fea47","derivation_sha256":"adb6a50074a85494170b8d53549478fc6605f94eeb44301ab49eda657c530739"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0093","number":25943,"title":{"zh-Hant":"第 25943 題：最大流最小割定理","en":"Question 25943: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"b301814fc1a67f2c01341304b501d682013026bce2b91dc47f316cc2cd580ef5","derivation_sha256":"19ffeb1a7d65de9d51fc77b0f9eee8927199ab94f139e94c735ed3aeb9ac9260"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0094","number":25944,"title":{"zh-Hant":"第 25944 題：最大流最小割定理","en":"Question 25944: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"83d8942391ec70eb05bde0a43d22ce9be944f5e923c0881a5d9494368a214d66","derivation_sha256":"8372342c7304c38f1aa3dc87a5bf86e6f37a71e4d9aac732657b79a54a882d91"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0095","number":25945,"title":{"zh-Hant":"第 25945 題：最大流最小割定理","en":"Question 25945: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"f96f241f047cab8bcf03433df99a78e5aaa896e799a16db83249a3eac8ec8ead","derivation_sha256":"6e82ff21a5b813b7f275b3ef7585100652ec5d03a4fc1c183f88de0e84170e67"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0096","number":25946,"title":{"zh-Hant":"第 25946 題：最大流最小割定理","en":"Question 25946: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"2d4671358c3e3ef164d57c251f922633e61f36cec15c51069e2545d3a112fc69","derivation_sha256":"9ab821b2883bd24f77c7185a5969ad8b08d4699e34d026404daa37748bd2154c"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0097","number":25947,"title":{"zh-Hant":"第 25947 題：最大流最小割定理","en":"Question 25947: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"adf4a0557111dfa0423f0662be0b504fd1d8d7db8e2417a5287b29c94fd1b976","derivation_sha256":"eca60cb1d59e2c521b9ed76d8cbeb941e66ae7550bc42bb6ab552078d85328bd"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0098","number":25948,"title":{"zh-Hant":"第 25948 題：最大流最小割定理","en":"Question 25948: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"adf7148cd4b92afa4cbde6aba45a7bd57daf1d9a1777848ee59a09ebedc4562e","derivation_sha256":"5ac9abce3052af1b00e92cb946d0d90a966b2a63603ec15d22e5b1fa62764fc0"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0099","number":25949,"title":{"zh-Hant":"第 25949 題：最大流最小割定理","en":"Question 25949: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"f2b1258d5fb17bc7828a0d868fc85746e779f9d74fd712f388f0b1a39d9c0d96","derivation_sha256":"9414fe94a23228ff245106017e6262053b34316059c287fdda77fed852b5174a"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0100","number":25950,"title":{"zh-Hant":"第 25950 題：最大流最小割定理","en":"Question 25950: An Equal-Valued Feasible Flow and Cut Certify Both Optima"},"family_id":"qf-mod46-mfmc-equal-value-optimality","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":"1be3cf99054dcfe5f589341c1d502900394221685c2519ba34e0f7aa87483bfc","derivation_sha256":"6632671d3f82f4479b66a4e21ecc3e0aafe289d2d3a1daf6fc846c59c2c9e7f2"}]}