{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002181588,0.001521621,0.001684748,0.001772967,0.001562211,0.005609964,0.003023388,0.001978131,0.01520998],"category_scores_gemma":[0.009349895,0.001243948,0.001134741,0.001629195,0.002834921,0.00589854,0.002955604,0.005763989,0.002104748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219763,"about_ca_system_score_gemma":0.001121075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001242826,"about_ca_topic_score_gemma":0.001090804,"domain_scores_codex":[0.9982444,0.0006452551,0.00006045967,0.0002736925,0.0005174647,0.0002587826],"domain_scores_gemma":[0.9954363,0.002467084,0.0007574514,0.0003339924,0.0004822921,0.0005229675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007392558,0.0000456391,0.00007209535,0.00006325114,0.00001096452,0.00003946549,0.0001309073,0.02030196,0.0005367806,0.9684844,0.004785971,0.005454659],"study_design_scores_gemma":[0.00003585059,0.00003460482,0.0001017697,0.00001651263,0.000007873738,0.00006179121,0.00006534861,0.06889521,0.0003299498,0.9283201,0.002113352,0.00001772152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1762666,0.001176091,0.6918417,0.004122888,0.000289432,0.0002637556,0.001479667,0.0007912393,0.1237687],"genre_scores_gemma":[0.8172467,0.001624977,0.1197666,0.001295769,0.0008004088,0.0005822101,0.001859949,0.0008057919,0.05601757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01520998,"threshold_uncertainty_score":0.0508824,"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."}}