{"id":"W2945389025","doi":"","title":"Stronger Linear Programming Relaxations of Max-Cut","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Linear programming; Maximum cut; Discrete mathematics; Inequality; Mathematical optimization; Graph; Mathematical analysis","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.00009038578,0.00006200233,0.00008354004,0.00007683129,0.00007937632,0.00003581087,0.0004369171,0.00002699294,0.0002489062],"category_scores_gemma":[0.00002218042,0.00005485872,0.0000601281,0.0003954939,0.00005332398,0.0002327926,0.000130933,0.00007824849,0.00006357586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006980951,"about_ca_system_score_gemma":0.000005876821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002223502,"about_ca_topic_score_gemma":0.00001222404,"domain_scores_codex":[0.9993339,0.00001800643,0.0001617087,0.0001647087,0.0001677558,0.0001539591],"domain_scores_gemma":[0.9994358,0.00004626107,0.00005569562,0.0003590748,0.00005874285,0.00004442762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.076184e-7,0.0002358841,0.0006822472,0.00001308749,0.00002109074,0.000004517991,0.0007987351,0.0001047471,0.000087904,0.5443381,0.001742973,0.4519701],"study_design_scores_gemma":[0.0004002727,0.0002098178,0.001801876,0.00002504509,0.000009353349,0.00002131252,0.0001033558,0.8948575,0.002738489,0.01154308,0.08797774,0.0003121809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004973757,0.0001067888,0.9715987,0.001042482,0.0001999341,0.0001262456,0.000001459132,0.0002177119,0.02173287],"genre_scores_gemma":[0.3633063,0.000008850026,0.6341847,0.00006534457,0.0000449731,0.000007839727,7.988773e-7,0.000004023801,0.002377226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8947527,"threshold_uncertainty_score":0.2725348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04279685047705614,"score_gpt":0.2500863312182562,"score_spread":0.2072894807412,"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."}}