{"id":"W2962852933","doi":"10.5539/cis.v12n3p81","title":"Modeling the Parallelization of the Edmonds-Karp Algorithm and Application","year":2019,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Maximum flow problem; Algorithm; Computation; Minimum cut; Maximum cut; Graph; Theoretical computer science; Combinatorics; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005114119,0.00006172802,0.00006553808,0.00008902277,0.0003268726,0.0002689843,0.0007597503,0.00001866295,8.641654e-7],"category_scores_gemma":[0.000009030425,0.00003622486,0.00001921437,0.000713667,0.0002194152,0.003593264,0.0005373413,0.00006577808,0.000004830046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008602095,"about_ca_system_score_gemma":0.00004553359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001304144,"about_ca_topic_score_gemma":3.603145e-7,"domain_scores_codex":[0.9992152,0.00001766389,0.0002039792,0.0001349347,0.0003174721,0.0001107004],"domain_scores_gemma":[0.9993058,0.00003338063,0.00009030678,0.0003762391,0.0001629218,0.00003137094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.609908e-7,0.000007405974,0.0004402377,0.00001787176,0.000002269017,1.174413e-8,0.002752457,0.02529063,0.00006739103,0.2787922,0.0000316742,0.692597],"study_design_scores_gemma":[0.0001008947,0.00001663916,0.006399611,0.00001031864,0.000001019537,0.000007605988,0.00003880125,0.9879493,0.000118843,0.004266889,0.001037651,0.00005246523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02645613,0.00003634236,0.9720054,0.0005445728,0.0002522293,0.0002053591,9.700443e-7,0.00002323007,0.0004757454],"genre_scores_gemma":[0.9418949,0.00004731039,0.05735253,0.0006687132,0.00002314386,0.000005648213,0.000001004963,0.000001073677,0.000005672737],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9626586,"threshold_uncertainty_score":0.260503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008319934742299261,"score_gpt":0.2191753482244641,"score_spread":0.2108554134821648,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}