{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009716941,0.0004283063,0.001088865,0.001347647,0.000745696,0.001068871,0.003749707,0.0004767512,0.0000364292],"category_scores_gemma":[0.001103383,0.0003980637,0.0009477556,0.001350447,0.000684005,0.0002233949,0.007306767,0.002152788,0.0002314569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002878059,"about_ca_system_score_gemma":0.0007409389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003736112,"about_ca_topic_score_gemma":0.00003767868,"domain_scores_codex":[0.9930952,0.001223185,0.0006677739,0.001569625,0.001964547,0.001479689],"domain_scores_gemma":[0.991531,0.005210356,0.0001681513,0.001808782,0.000939895,0.0003418461],"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":[0.001759987,0.0002201847,0.000008339275,0.001424945,0.0003537489,0.0002290126,0.001544302,0.0008727929,0.000004792865,0.08251408,0.01975013,0.8913177],"study_design_scores_gemma":[0.01923882,0.00007555002,0.00001627169,0.0005332155,0.000009438158,0.00000600972,0.0000965883,0.5738877,0.00007504026,0.4013307,0.00442007,0.0003105729],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009584432,0.0006453615,0.9894694,0.002557466,0.001915089,0.003692728,0.0002118066,0.0007041775,0.0007080911],"genre_scores_gemma":[0.01948702,0.001298194,0.9566836,0.000178347,0.002395291,0.009370934,0.0005354987,0.0002535038,0.009797597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8910071,"threshold_uncertainty_score":0.9999681,"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."}}