{"id":"W2906226597","doi":"10.32920/ryerson.14649945","title":"Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Constraint satisfaction; Constraint satisfaction dual problem; Local consistency; Complexity of constraint satisfaction; Constraint logic programming; Constraint graph; Constraint (computer-aided design); Class (philosophy); Computer science; Mathematics; Theoretical computer science; Tree (set theory); Time complexity; Mathematical optimization; Discrete mathematics; Combinatorics; Artificial intelligence","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.0002341474,0.000290695,0.0004486938,0.0001944308,0.0000832412,0.0002834698,0.0003903121,0.0002148134,0.0006626194],"category_scores_gemma":[0.00002388536,0.0002674295,0.0001359757,0.0003439591,0.0003980783,0.0003133689,0.0004109464,0.0004578466,0.000006277307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001313627,"about_ca_system_score_gemma":0.0007179899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008433199,"about_ca_topic_score_gemma":0.001862568,"domain_scores_codex":[0.9979617,0.0001154826,0.0004998018,0.0007068072,0.0004807614,0.000235419],"domain_scores_gemma":[0.9980964,0.00005543668,0.0004521647,0.0008263094,0.0004489295,0.0001207477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002579014,0.000304528,0.06876218,0.001343421,0.0007009906,0.00005795721,0.004787731,0.09805588,0.001947501,0.5571166,0.0003913932,0.266506],"study_design_scores_gemma":[0.003638923,0.0005473352,0.6350235,0.00232965,0.0002374774,0.0007494648,0.002463217,0.3084603,0.007874134,0.03469151,0.0004525206,0.003531904],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01869321,0.00004426604,0.9667659,0.0006332701,0.0005629067,0.0005378628,0.00001579245,0.0002737224,0.012473],"genre_scores_gemma":[0.8873329,0.00005392349,0.1123233,0.0001052446,0.00001750449,0.00002330403,0.00005260237,0.00001248634,0.00007872128],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8686396,"threshold_uncertainty_score":0.9999778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.049607082559805,"score_gpt":0.2449211411669999,"score_spread":0.1953140586071949,"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."}}