{"id":"W2961830567","doi":"10.1109/ismvl.2019.00037","title":"Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey","year":2019,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint (computer-aided design); Constraint satisfaction; Universal algebra; Computational complexity theory; Computer science; Domain (mathematical analysis); Mathematics; Theoretical computer science; Algebra over a field; Local consistency; Algorithm; Pure mathematics; 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.002726675,0.001015498,0.001943363,0.002813228,0.0008208905,0.004185544,0.001797187,0.001620561,0.003014676],"category_scores_gemma":[0.008596719,0.0008908857,0.001439535,0.004973555,0.003184133,0.01041111,0.002024167,0.003501639,0.0005888852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002317084,"about_ca_system_score_gemma":0.001629946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001456778,"about_ca_topic_score_gemma":0.0008708817,"domain_scores_codex":[0.9967558,0.0006622322,0.000284238,0.0009519021,0.001125522,0.0002203504],"domain_scores_gemma":[0.9905806,0.007501096,0.0003816685,0.0007630273,0.0005656187,0.00020797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009474598,0.0002022483,0.004636874,0.002718189,0.0001661726,0.0002109904,0.0004508437,0.05273946,0.001845549,0.6343311,0.007199424,0.2954044],"study_design_scores_gemma":[0.00002276657,0.0001186923,0.002929717,0.0004232666,0.00007646954,0.0007058191,0.0002398698,0.08660118,0.001438005,0.8579897,0.04937377,0.00008079235],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.09218518,0.2836385,0.5657085,0.01201873,0.0004652611,0.0001707461,0.001021757,0.0005086425,0.04428275],"genre_scores_gemma":[0.5202232,0.2794439,0.1859074,0.00152901,0.0032812,0.0003362942,0.002055068,0.0003138158,0.006910063],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004185544,"threshold_uncertainty_score":0.01681173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05076496366989229,"score_gpt":0.2614338862727408,"score_spread":0.2106689226028485,"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."}}