{"id":"W2046371296","doi":"10.1023/a:1014895808844","title":"Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Relaxation (psychology); Polytope; Theory of computation; Rank (graph theory); Matrix (chemical analysis); Dimension (graph theory); Semidefinite programming; Projection (relational algebra); Discrete mathematics; Algorithm; Mathematical optimization","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.0006015208,0.0001299748,0.0003182232,0.0005183535,0.0001282719,0.00009570929,0.000698634,0.0001137418,0.000139589],"category_scores_gemma":[0.0002785381,0.000125637,0.0001938076,0.001245489,0.00005928722,0.0009117833,0.0001063969,0.0002800595,0.000007965344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005967978,"about_ca_system_score_gemma":0.00004765871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004672504,"about_ca_topic_score_gemma":1.239331e-7,"domain_scores_codex":[0.9981608,0.0001209112,0.0007988405,0.0001414365,0.0005908859,0.0001871287],"domain_scores_gemma":[0.9976699,0.0002354119,0.001002499,0.0003176355,0.0006660821,0.0001084313],"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.0000697745,0.001015671,0.0005910762,0.00006099984,0.0001783245,0.00003901426,0.001094556,0.5723305,0.0003251404,0.4054894,0.00455826,0.01424734],"study_design_scores_gemma":[0.002699823,0.0005930211,0.0002000156,0.000101069,0.00005837443,0.0001689261,0.0000202479,0.9293103,0.001031439,0.06238912,0.003164234,0.0002633931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002437117,0.0005264325,0.990676,0.000523429,0.004819364,0.00009280912,0.000002643656,0.00003356956,0.0008885953],"genre_scores_gemma":[0.5081832,0.0005111666,0.4905804,0.0000608163,0.0004763396,0.000002105576,0.000003275479,0.00001805837,0.0001646069],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5057461,"threshold_uncertainty_score":0.5123326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01504170788102348,"score_gpt":0.2364874729956339,"score_spread":0.2214457651146104,"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."}}