{"id":"W4313457405","doi":"10.21203/rs.3.rs-2170035/v1","title":"A Randomized Algorithm for Finding Local Maximum Cuts","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Algorithm; Computer science; Randomized algorithm; Mathematical optimization; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002094227,0.001055581,0.001410406,0.00193138,0.0009129865,0.001556756,0.00258271,0.001456408,0.00931689],"category_scores_gemma":[0.006996119,0.0006563572,0.001007591,0.001721616,0.001022802,0.001841994,0.001481009,0.001946191,0.001579123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001758589,"about_ca_system_score_gemma":0.002112711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003159677,"about_ca_topic_score_gemma":0.003485524,"domain_scores_codex":[0.9969241,0.001014561,0.0001650396,0.0007270078,0.0008981334,0.000271203],"domain_scores_gemma":[0.9968167,0.001803286,0.0003161695,0.0003686018,0.0005942635,0.0001009641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005453476,0.0002965906,0.0006035143,0.0003246194,0.0001157889,0.0001431608,0.0001387512,0.512485,0.01055125,0.06444433,0.008701125,0.4016505],"study_design_scores_gemma":[0.000147696,0.0000891052,0.0001262522,0.00002435982,0.00001942434,0.000085339,0.00002842386,0.969437,0.002913321,0.02338867,0.00372251,0.00001794688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00380135,0.00009635683,0.9938446,0.00007632259,0.0000359926,0.00009979092,0.00004906243,0.0005460452,0.001450411],"genre_scores_gemma":[0.07424759,0.0000749269,0.9229943,0.00009773401,0.00003905997,0.0002993003,0.0002630294,0.0001939501,0.001790076],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00931689,"threshold_uncertainty_score":0.0311681,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1705579920051105,"score_gpt":0.4233588796267934,"score_spread":0.2528008876216829,"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."}}