{"id":"W121999068","doi":"10.1007/11523468_95","title":"Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Communication complexity; Upper and lower bounds; Tree (set theory); Omega; Combinatorics; Set (abstract data type); Mathematics; Function (biology); Polynomial; Discrete mathematics; Degree (music); Computer science; Physics","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.005412824,0.003209057,0.005047014,0.00541437,0.006556751,0.01319461,0.00730086,0.007131186,0.03195556],"category_scores_gemma":[0.03238976,0.002188843,0.004066812,0.007703557,0.006677718,0.03663249,0.009538888,0.02461723,0.005953166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008373458,"about_ca_system_score_gemma":0.002766009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001446713,"about_ca_topic_score_gemma":0.001850585,"domain_scores_codex":[0.9939356,0.001418025,0.0002582578,0.001115212,0.001950421,0.00132244],"domain_scores_gemma":[0.9600412,0.03075956,0.001469089,0.004132491,0.002073061,0.001524461],"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.00003836139,0.00004591735,0.00009858979,0.0001119816,0.00001944196,0.00002069444,0.0001238294,0.003119257,0.0002707221,0.9847584,0.005717679,0.005675159],"study_design_scores_gemma":[0.000005919936,0.000004475033,0.00004148793,0.00002184714,0.000008670968,0.00001646723,0.00001934228,0.008857563,0.0001402092,0.9894652,0.001407748,0.00001102098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0559633,0.01411568,0.5506645,0.03017258,0.002047726,0.0004191734,0.002046528,0.001169274,0.3434011],"genre_scores_gemma":[0.7925718,0.01210092,0.09729433,0.005823941,0.004713042,0.001670483,0.002389911,0.002072185,0.08136352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03195556,"threshold_uncertainty_score":0.106902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03634676900953568,"score_gpt":0.2618878529731364,"score_spread":0.2255410839636007,"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."}}