{"id":"W2989790471","doi":"10.1145/3470867","title":"The Complexity of Promise SAT on Non-Boolean Domains","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Unary operation; Constraint satisfaction problem; Cover (algebra); Algebraic number; Constraint satisfaction; Fragment (logic); Theory of computation; Benchmark (surveying)","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":[],"consensus_categories":[],"category_scores_codex":[0.00200685,0.0006874652,0.001371708,0.0008599795,0.00123575,0.005960122,0.002780493,0.002180071,0.008784687],"category_scores_gemma":[0.01400124,0.0007607631,0.00189902,0.002329155,0.002742081,0.01257824,0.002882304,0.005275285,0.0008088413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003186164,"about_ca_system_score_gemma":0.001724278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003782653,"about_ca_topic_score_gemma":0.002984097,"domain_scores_codex":[0.996758,0.0009094524,0.00015569,0.0006171614,0.0009420492,0.0006177108],"domain_scores_gemma":[0.9783719,0.01860981,0.0009007876,0.001124825,0.0004830461,0.0005096204],"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.0008772913,0.0002799894,0.00478703,0.001097137,0.0001840736,0.0004334253,0.0008102038,0.1701284,0.004257324,0.761109,0.0144243,0.04161181],"study_design_scores_gemma":[0.0001098425,0.0000455209,0.001824442,0.00005149435,0.00004601516,0.0002235315,0.0002204393,0.2429675,0.001563464,0.74914,0.003775651,0.00003210195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6067284,0.004176442,0.2911071,0.03246455,0.0002478182,0.0002161744,0.006648987,0.0009475845,0.05746304],"genre_scores_gemma":[0.9462223,0.001949052,0.03956033,0.0006832537,0.0004799565,0.0002343506,0.002732523,0.0002080923,0.007930128],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008784687,"threshold_uncertainty_score":0.02938771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04378162892982987,"score_gpt":0.3176665229709127,"score_spread":0.2738848940410828,"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."}}