{"id":"W1480046334","doi":"10.5555/1496770.1496810","title":"Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures","year":2009,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Rank (graph theory); Combinatorics; Mathematics; Satisfiability; Upper and lower bounds; Argument (complex analysis); Discrete mathematics; Exponential function","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.0002268882,0.0001739541,0.0001820724,0.00009285125,0.000209852,0.000343094,0.0005577733,0.00006871157,0.00004056949],"category_scores_gemma":[0.00004003865,0.0001426555,0.0001163697,0.0002292343,0.0001012755,0.0005277253,0.000136042,0.0001108056,0.000007397787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001508053,"about_ca_system_score_gemma":0.00005999349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003217566,"about_ca_topic_score_gemma":0.0001125936,"domain_scores_codex":[0.9987509,0.00002393219,0.0002139448,0.0004717366,0.0002087838,0.0003307353],"domain_scores_gemma":[0.9992875,0.00006487159,0.00004881043,0.0003973876,0.00008222371,0.0001192498],"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.000108546,0.0005454486,0.0003322116,0.00006333194,0.00004199292,0.00001387599,0.000862446,0.000004628971,0.00143766,0.7008103,0.04016604,0.2556136],"study_design_scores_gemma":[0.003748301,0.002258735,0.03704308,0.0001318687,0.00004721032,0.0001499198,0.0001816828,0.08808558,0.008287612,0.6936134,0.1647977,0.001654994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05708116,0.0003373605,0.929888,0.003640677,0.0009820242,0.0004525408,0.000007551012,0.0003853521,0.007225405],"genre_scores_gemma":[0.871459,0.00002421262,0.1247613,0.001925427,0.0001672842,0.00001810922,0.000004512997,0.000006561081,0.001633606],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8143778,"threshold_uncertainty_score":0.5817322,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01715841394339383,"score_gpt":0.2630786820417941,"score_spread":0.2459202680984003,"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."}}