{"id":"W3125711631","doi":"10.1007/s10589-020-00261-4","title":"A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bounding overwatch; Iterated function; Maximum cut; Eigenvalues and eigenvectors; Semidefinite programming; Upper and lower bounds; Mathematical optimization; Vertex (graph theory); Discrete mathematics; Graph; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0003193454,0.0001091702,0.0001328938,0.00005229286,0.0007015635,0.0001350413,0.0003568221,0.00004470417,0.000006354713],"category_scores_gemma":[0.0001109367,0.00007979215,0.00009189791,0.0007937208,0.000103138,0.0002467626,0.0001647897,0.0001134969,7.379692e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002584833,"about_ca_system_score_gemma":0.0001812407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007592219,"about_ca_topic_score_gemma":0.000005799909,"domain_scores_codex":[0.9989001,0.000104962,0.0003355214,0.0003154149,0.0002241108,0.0001198714],"domain_scores_gemma":[0.9966332,0.001878761,0.0003712893,0.0002795458,0.0007994486,0.00003774315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003442032,0.00005630167,0.00002219857,0.00001237871,0.00002905974,5.616002e-8,0.0004194885,0.5539154,0.00003199425,0.430162,0.00006866776,0.01527894],"study_design_scores_gemma":[0.0004289567,0.00001722165,0.0007280253,0.00001657823,0.00002945012,0.00001117602,0.0002306157,0.9235432,0.000336377,0.0726697,0.001898794,0.00008990119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005881394,0.0001559342,0.9916841,0.006365836,0.00006490518,0.001000892,0.0000398845,0.00003764548,0.0005919501],"genre_scores_gemma":[0.06382111,0.00002879417,0.9349108,0.0004981353,0.00006998561,0.0004566701,0.00006020268,0.00000846762,0.0001458536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3696277,"threshold_uncertainty_score":0.539593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02182201172403229,"score_gpt":0.2932571728029479,"score_spread":0.2714351610789156,"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."}}