{"id":"W1485993952","doi":"10.1007/978-3-642-03685-9_10","title":"Optimal Sherali-Adams Gaps from Pairwise Independence","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pairwise independence; Pairwise comparison; Constraint satisfaction problem; Hierarchy; Generalization; Conjecture; Independence (probability theory); Mathematics; Partition (number theory); Combinatorics; Domain (mathematical analysis); Discrete mathematics; Computer science; Random variable; Statistics; Independent and identically distributed random variables; Sum of normally distributed random variables","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"],"consensus_categories":[],"category_scores_codex":[0.0005805214,0.000590026,0.000514205,0.0006975905,0.0002779444,0.0008674689,0.00278322,0.0004971815,0.0002210325],"category_scores_gemma":[0.00007306258,0.0005800187,0.0001561939,0.0005965362,0.0005141145,0.001111591,0.000737506,0.001082446,0.0001035477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003661183,"about_ca_system_score_gemma":0.0007365664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008500373,"about_ca_topic_score_gemma":0.0001852,"domain_scores_codex":[0.9955648,0.00004788558,0.0005961149,0.001787965,0.00137077,0.0006324353],"domain_scores_gemma":[0.9974443,0.0003070231,0.0003245614,0.00139167,0.0002762451,0.000256198],"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.000005136091,0.00001869255,0.00008317488,0.000005169767,0.000008320234,0.00009313778,0.0004378693,0.1312515,0.00006889603,0.005210399,0.00003526742,0.8627824],"study_design_scores_gemma":[0.0005026163,0.0001954406,0.001475536,0.0003828476,0.0000128089,0.00009013683,3.107272e-7,0.9072332,0.0009202861,0.08525107,0.002754052,0.001181676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000142224,0.0003249142,0.9915724,0.001260189,0.001650788,0.0003313,0.000010278,0.0003140499,0.004393894],"genre_scores_gemma":[0.1017682,0.0001407245,0.8933242,0.003379276,0.0005526787,0.000006946523,0.00002218833,0.00003611076,0.0007696853],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8616008,"threshold_uncertainty_score":0.9996651,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01271935356398458,"score_gpt":0.2300012135828534,"score_spread":0.2172818600188688,"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."}}