{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407814,0.0007889945,0.0009045463,0.0006566732,0.0006475368,0.0009457029,0.001914331,0.001401669,0.005684055],"category_scores_gemma":[0.002941041,0.0004989255,0.0007698928,0.0005742544,0.0009440369,0.001231219,0.002090838,0.002779266,0.0007400073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006154056,"about_ca_system_score_gemma":0.001498288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001876904,"about_ca_topic_score_gemma":0.0026971,"domain_scores_codex":[0.999523,0.0001784063,0.00001935277,0.00007211194,0.0001601147,0.0000469672],"domain_scores_gemma":[0.9993302,0.0002935995,0.00004584674,0.00008132091,0.0001520729,0.00009698519],"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.0003319624,0.000289522,0.0006327066,0.0003437243,0.0000809846,0.0001935691,0.0003182177,0.3703667,0.01863951,0.3650306,0.009641581,0.234131],"study_design_scores_gemma":[0.00002474783,0.00004587221,0.00008150542,0.00002337148,0.000008899571,0.0000300971,0.00002313358,0.963905,0.0006364582,0.03304011,0.002170773,0.00001001007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008778701,0.0001365692,0.9858838,0.0001749793,0.00009380625,0.00006439448,0.00004664113,0.00006889366,0.00475226],"genre_scores_gemma":[0.1649166,0.0002778651,0.8246684,0.0002592956,0.0001321244,0.0003083903,0.0002644622,0.0003231732,0.008849804],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005684055,"threshold_uncertainty_score":0.01901501,"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."}}