{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001196095,0.0009930037,0.001232896,0.0004979769,0.001031296,0.001787702,0.001972131,0.00173414,0.01256013],"category_scores_gemma":[0.007977965,0.000386306,0.001226923,0.001367335,0.001261341,0.003755424,0.001823925,0.002059396,0.00107287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001646173,"about_ca_system_score_gemma":0.001313385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004974602,"about_ca_topic_score_gemma":0.005014201,"domain_scores_codex":[0.9984899,0.0004122643,0.00005390877,0.0005013078,0.0002667852,0.0002758325],"domain_scores_gemma":[0.9964857,0.002406619,0.000247447,0.0003427881,0.0002745877,0.0002427702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000409631,0.0001956336,0.001932725,0.0004384945,0.0001356435,0.0003656932,0.0001602616,0.6021985,0.001657654,0.3143403,0.01746082,0.06070461],"study_design_scores_gemma":[0.00004216989,0.00009514158,0.0002940453,0.0000294363,0.00003042718,0.0001759718,0.00009945605,0.6967682,0.0009548281,0.2914641,0.01003172,0.00001449922],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.07224768,0.001630128,0.895448,0.004657326,0.0003701384,0.0001250983,0.001186675,0.0006467418,0.0236882],"genre_scores_gemma":[0.6794428,0.001385835,0.299348,0.001374485,0.0004069988,0.0001973373,0.001891492,0.0003055184,0.01564757],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9874399,"threshold_uncertainty_score":0,"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."}}