{"id":"W2185716868","doi":"10.4086/toc.2012.v008a012","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Predicate (mathematical logic); Constraint satisfaction problem; Pairwise independence; Discrete mathematics; Hierarchy; Pairwise comparison; Semidefinite programming; Random variable; Omega; Mathematical optimization; Multivariate random variable; Sum of normally distributed random variables; Probabilistic logic; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004401643,0.0002137957,0.0003624918,0.0002147283,0.0003476932,0.00006226054,0.001984305,0.00005371006,0.000005176398],"category_scores_gemma":[0.0001481218,0.0002075311,0.0001836848,0.0007710279,0.0002485085,0.001157687,0.001212742,0.00022045,0.000004676066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001944056,"about_ca_system_score_gemma":0.00002665162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009107299,"about_ca_topic_score_gemma":3.17208e-7,"domain_scores_codex":[0.9974366,0.00051027,0.0005368615,0.0002972402,0.0004073928,0.0008116148],"domain_scores_gemma":[0.9970782,0.001394025,0.0003089841,0.0008952204,0.0001075479,0.0002160008],"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.000008655316,0.0001492975,0.00529656,0.00002042463,0.00002452134,0.000001106271,0.009489251,0.0002801434,0.000967373,0.8290283,0.000004625688,0.1547297],"study_design_scores_gemma":[0.0008901054,0.0001877955,0.1439636,0.0001455156,0.00001849266,0.0001389476,0.0009780123,0.09245867,0.03266948,0.7277459,0.0001678265,0.0006356607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4510259,0.0002848426,0.547343,0.00008320751,0.0004432563,0.00006919655,3.58567e-7,0.0001958568,0.0005544663],"genre_scores_gemma":[0.7849762,0.000002010071,0.214584,0.0002176002,0.0002050198,0.000001031222,4.398199e-7,0.000007512942,0.00000616632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3339503,"threshold_uncertainty_score":0.8462874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03077153895836308,"score_gpt":0.2621209887200663,"score_spread":0.2313494497617032,"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."}}