{"id":"W4285464797","doi":"10.32920/ryerson.14649945.v1","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; Constraint logic programming; Complexity of constraint satisfaction; Constraint graph; Constraint (computer-aided design); Class (philosophy); Computer science; Mathematics; Theoretical computer science; Tree (set theory); Mathematical optimization; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008596117,0.0004931288,0.00111826,0.0006328995,0.0008432207,0.003951684,0.00168297,0.001248268,0.01746944],"category_scores_gemma":[0.008507618,0.0004858044,0.000978702,0.001282306,0.001255444,0.004837736,0.001391198,0.002323332,0.0008834995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002102999,"about_ca_system_score_gemma":0.001354353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003055542,"about_ca_topic_score_gemma":0.003687913,"domain_scores_codex":[0.9987269,0.0003242117,0.00005312834,0.0002795546,0.0003184437,0.000297793],"domain_scores_gemma":[0.9923854,0.00635935,0.0003336069,0.0004457409,0.0002301789,0.000245625],"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.0007977596,0.0003485563,0.005079991,0.0007168524,0.0001577536,0.0005288339,0.0004690653,0.3085731,0.00847477,0.5667145,0.01585849,0.09228034],"study_design_scores_gemma":[0.0001130182,0.00004362293,0.000884767,0.00002210541,0.00003628684,0.000183406,0.00008609955,0.380349,0.001602445,0.6141727,0.002491127,0.00001556914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6377085,0.001486265,0.2799203,0.008780298,0.0001381372,0.0002650867,0.003216319,0.0008620602,0.06762303],"genre_scores_gemma":[0.9406787,0.0007895992,0.042048,0.0006580075,0.0002303804,0.0002473569,0.00156856,0.0002866272,0.01349279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01746944,"threshold_uncertainty_score":0.0584411,"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."}}