{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001093348,0.0006911274,0.0008375793,0.0005735988,0.0007934725,0.001437675,0.004026067,0.0004320747,0.00002212297],"category_scores_gemma":[0.00008525138,0.0006696984,0.0002234833,0.0004302266,0.001833081,0.001015509,0.002100992,0.0008624792,0.00001878187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000264268,"about_ca_system_score_gemma":0.0003066786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002178988,"about_ca_topic_score_gemma":0.000631957,"domain_scores_codex":[0.9956911,0.00007809484,0.0007559899,0.001807393,0.0009158669,0.000751546],"domain_scores_gemma":[0.9951031,0.001353084,0.0004364017,0.002472244,0.0003772658,0.0002578693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004650091,0.0001710065,0.0001375825,0.0001103875,0.00007421354,0.00002995515,0.001977833,0.009208247,0.00008097506,0.286441,0.0003971799,0.7013251],"study_design_scores_gemma":[0.0006771682,0.0001481674,0.0002006112,0.0002894618,0.00001771118,0.00002656201,6.089928e-7,0.6897103,0.00007657796,0.2891865,0.0189469,0.0007193793],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002965658,0.003361842,0.9895886,0.001063383,0.002518165,0.0009475443,0.0001120529,0.0002042482,0.001907611],"genre_scores_gemma":[0.1316449,0.0001865883,0.8653008,0.001494319,0.0007906288,0.0000478721,0.0000709185,0.0000541301,0.0004098007],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7006058,"threshold_uncertainty_score":0.9995989,"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."}}