{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008916355,0.002296554,0.001995549,0.001445005,0.001526787,0.004255803,0.00361,0.002184951,0.01444671],"category_scores_gemma":[0.035817,0.001500717,0.002767094,0.002583709,0.002700693,0.01071922,0.004135702,0.01128429,0.001506747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003041167,"about_ca_system_score_gemma":0.001664688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002061889,"about_ca_topic_score_gemma":0.002463535,"domain_scores_codex":[0.9933442,0.002718012,0.0002533759,0.001201569,0.001420823,0.00106188],"domain_scores_gemma":[0.9678972,0.02462189,0.003006282,0.001972531,0.001343051,0.001159057],"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.0007733717,0.0004773692,0.001182232,0.0009084198,0.0002018197,0.0002915611,0.0004661429,0.2255869,0.003082702,0.7101344,0.01744288,0.03945224],"study_design_scores_gemma":[0.0001428797,0.000208445,0.0005816052,0.0001531373,0.00006070967,0.0002476025,0.0002023339,0.4401514,0.001404255,0.5446509,0.01213946,0.00005732034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06253669,0.004053279,0.8571429,0.007247103,0.000681143,0.0003283815,0.001466542,0.0005361635,0.06600771],"genre_scores_gemma":[0.6409577,0.00370383,0.3270589,0.00452986,0.002441143,0.0008435886,0.00242588,0.0006881972,0.01735088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01444671,"threshold_uncertainty_score":0.04832906,"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."}}