{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"mko":"mko-max-flow-min-cut-theorem","page":"1"},"total":100,"page":1,"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-0001","number":25901,"title":{"zh-Hant":"第 25901 題：最大流最小割定理","en":"Question 25901: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"6ae737099023056dcc70511865395c73785fbc7479548ada4f24035d1147a31f","derivation_sha256":"c2bb983646759f65ab003f5c1cb63aa8cdadc4a2d3b242ac929fcd5c935110cf"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0002","number":25902,"title":{"zh-Hant":"第 25902 題：最大流最小割定理","en":"Question 25902: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"a6a23b7159d3d61efd870132fad82691f8932070e84d5d414bec1969e61fe107","derivation_sha256":"d502f8aa133681b58e3fe86be2b81cd164914638390c3d2f2f8342685ca0961a"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0003","number":25903,"title":{"zh-Hant":"第 25903 題：最大流最小割定理","en":"Question 25903: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"eb31e3e73d4b311b72e8a61ad7de5949a0196c8bfde739e57a40cc44132c8cbe","derivation_sha256":"72162ea5c6a948fed7c687d3fde95e18c19d597feb078d1e189e0c689bb403ac"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0004","number":25904,"title":{"zh-Hant":"第 25904 題：最大流最小割定理","en":"Question 25904: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"d902a80d3bcb10df5c8acfc32e4b2d1af808dab4b606db71e0399d7399ae8d9b","derivation_sha256":"f0eb862b89f15f9f406ac8e6ae5bf16731c3fc6706aa96ff0f45f829a549951e"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0005","number":25905,"title":{"zh-Hant":"第 25905 題：最大流最小割定理","en":"Question 25905: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"ebb0ed6a704d87923aa285801612451b38209c9726f670ba30a37fdaa59c8ab6","derivation_sha256":"9d826efdbbd56e8a9aad2fa5cf5ee2ea968a8a57abb57ae13fe16e634b1b4877"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0006","number":25906,"title":{"zh-Hant":"第 25906 題：最大流最小割定理","en":"Question 25906: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"67349e5242d91e01d41975b7b726f71fd55218bc0943933416f6b30bc259d644","derivation_sha256":"aa3b391e051b3c4c2a311f6e7c4fb197582a67530978e11a9113c7d3b25dccbe"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0007","number":25907,"title":{"zh-Hant":"第 25907 題：最大流最小割定理","en":"Question 25907: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"ad65433d52b6f0b19a6a13a0449adb80e8f4b3edb23e3fdaca911c683f43c527","derivation_sha256":"2bf2fd32cd11d7a86efb7ea43139f173027b32eb1dfcaaabbbac466760d22f35"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0008","number":25908,"title":{"zh-Hant":"第 25908 題：最大流最小割定理","en":"Question 25908: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"4de1a0766af89515f3e3139cc4bb286b93c3bb78e17ccbbd974f613807abd4da","derivation_sha256":"2a798e7ddc0f25439640b79658e0fb18d884adbc67764c2d03b7011eda0c3950"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0009","number":25909,"title":{"zh-Hant":"第 25909 題：最大流最小割定理","en":"Question 25909: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"244192531a1ad0fe578ea0c308951a083f9989c617098799d4f4b45fbb458fa3","derivation_sha256":"831834354784a415139f23c77a16f9a9de7b90ea4e39f8b6c90b00dd012e9fd8"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0010","number":25910,"title":{"zh-Hant":"第 25910 題：最大流最小割定理","en":"Question 25910: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"7dd78867aa499582afc93d58aac991c8e4b79feb2fedc7a16e03a02955de93c7","derivation_sha256":"32aae2c8f731b8ce12779b596d2659ecdbe18c5065bce808f22cd54a2a482cd5"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0011","number":25911,"title":{"zh-Hant":"第 25911 題：最大流最小割定理","en":"Question 25911: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"889aefc85c3bcfb5d193a070c514989a437ad5d444edc1b64c34fc67cb62c51f","derivation_sha256":"80b38a4628a5475a64371378b28f1004029b050a5618113231b24f21cde77fbf"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0012","number":25912,"title":{"zh-Hant":"第 25912 題：最大流最小割定理","en":"Question 25912: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"9214827cf656ef74dc11eae25aa09258737f1c48b26e12cb98e1f7ee434cd234","derivation_sha256":"e42f0204e673e7cfabd627a03baeea8204a9134bfee7be2023a6523a8bcf685f"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0013","number":25913,"title":{"zh-Hant":"第 25913 題：最大流最小割定理","en":"Question 25913: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"112bc19f4fa4fc07fd314ed1e88462bd70a84649cb34571c0eeb45429c35fd4a","derivation_sha256":"fca54b48b6cd95da17e2c01c441144a20bc5acfb0969d077e1223168dcd7fce4"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0014","number":25914,"title":{"zh-Hant":"第 25914 題：最大流最小割定理","en":"Question 25914: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"d0f325c02ecef3dc4a709409d638632cb4db027224efa0028c5d4064890d8d12","derivation_sha256":"18ad5d1717258cc2d08032efc6d3d4be650928fc7678e16b1af6636956cabaed"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0015","number":25915,"title":{"zh-Hant":"第 25915 題：最大流最小割定理","en":"Question 25915: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"6fb44d11477b86a499d0d3ab3db6ac34d8854a5e10ff25b2ebbe4eeca097e368","derivation_sha256":"70470077d82860fd3372dbf2ba3b30d7d91e4acf43046710753439f7a92df4d6"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0016","number":25916,"title":{"zh-Hant":"第 25916 題：最大流最小割定理","en":"Question 25916: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"b3bbd32977d2e38ba96c97899e9dea1b233ac5fb2e0d8cd1772fae80076a2c9b","derivation_sha256":"379b515ffb9df161c23fb06eded1e9f8a3ea0517555bfa9b6da1028b3be8ff5a"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0017","number":25917,"title":{"zh-Hant":"第 25917 題：最大流最小割定理","en":"Question 25917: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"24954c3321c18156fbcfdce30f7250c4a614cab4b01d23aa1abce2236ca02bcc","derivation_sha256":"843165759951f9f795778ddef5a56b0d29df270469475e4b7c1930bd630a34ab"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0018","number":25918,"title":{"zh-Hant":"第 25918 題：最大流最小割定理","en":"Question 25918: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"09c834a272abff1515c461035c28eba91cf59467944ddf27d28a07655eab7c3a","derivation_sha256":"c548f8faa938eb810060caf24e23e5df7c5199d489781db069fbd80b7c055d69"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0019","number":25919,"title":{"zh-Hant":"第 25919 題：最大流最小割定理","en":"Question 25919: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"2620f26f9113a09cf1453f1c7e88dca47707e7fb26a0eb23f39cf4e099f08b5d","derivation_sha256":"243e1732df25a3fc993fc947f8ca07c620ad8c855de878ee77468b2c2c628d71"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0020","number":25920,"title":{"zh-Hant":"第 25920 題：最大流最小割定理","en":"Question 25920: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"5f47623cfc35cfaf18def69798bfe48e898b43ed5236244861a61b16dca91668","derivation_sha256":"2560d32aa1c02d246766fdfd11542c0a5405b1ba7dd34efc6fb15a99a5c5fc58"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0021","number":25921,"title":{"zh-Hant":"第 25921 題：最大流最小割定理","en":"Question 25921: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"752e7f71cdde4a6bf58c4eeecdfa9a5a49dc2b02669f612a06eea07bc43b6be7","derivation_sha256":"a75cc7482007e4666609ed80f015fb9101c12483c81420c596de89d6c37f2156"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0022","number":25922,"title":{"zh-Hant":"第 25922 題：最大流最小割定理","en":"Question 25922: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"26785fa150b65b8d869cbb7e8f84d27acb396dcbc95ae077df18e54beaf1e150","derivation_sha256":"32286cfdd82f504282d56b54e6ed67b3b0ca18af6866faeec0f889791e7da406"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0023","number":25923,"title":{"zh-Hant":"第 25923 題：最大流最小割定理","en":"Question 25923: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"2f50165cd6947f705db8c7e03289274e56a1464478c5cfb4ee7fe0c3d229624c","derivation_sha256":"2d9a11049db8a09b905663e8b5b535cfda8b1d77a85f8ed980f460fb04c8bf53"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0024","number":25924,"title":{"zh-Hant":"第 25924 題：最大流最小割定理","en":"Question 25924: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"f8a69aaee580725dcab2089c7a0979772d55c75325e7935338ddf31d88c4c89a","derivation_sha256":"938219f75d3ddb324c6191a5f4427b5ea4f1c697ec4c5d481e35f5b2222bf0f8"},{"question_id":"q-20261015-advance-20261115-r05-max-flow-min-cut-theorem-0025","number":25925,"title":{"zh-Hant":"第 25925 題：最大流最小割定理","en":"Question 25925: Every Source-Side Vertex Subset Defines One Directed Cut Audit"},"family_id":"qf-mod46-mfmc-complete-cut-enumeration","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":"926c25d0f8be835d1614129a1a473ae23d2f6a267ed4fa3b7acc3fa871dd3903","derivation_sha256":"cad4972a1e159ffcaf7bebf2841f64acecbb9ed56396189125be06a8508948f0"}]}