{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819313,0.0001671922,0.0001867331,0.0001591371,0.0006952517,0.00009686829,0.001072324,0.00005526237,0.00003614458],"category_scores_gemma":[0.0001507274,0.0001342295,0.0001620654,0.0007961213,0.0005851983,0.0002283552,0.00004227322,0.0003569853,0.00009161579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006940599,"about_ca_system_score_gemma":0.000146245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002608762,"about_ca_topic_score_gemma":0.00001372324,"domain_scores_codex":[0.9977918,0.0006747392,0.0003224227,0.0004202286,0.0004960952,0.0002947067],"domain_scores_gemma":[0.9959033,0.002370699,0.000119054,0.001214336,0.0002909813,0.0001016274],"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.0002264374,0.0003517567,0.000006069066,0.00002018584,0.00007796696,0.00001410703,0.000780782,0.02925887,0.001399567,0.7008773,0.00003912235,0.2669478],"study_design_scores_gemma":[0.0006974584,0.0002396521,0.0008420419,0.00004077289,0.000009809805,0.00001578556,0.0002652961,0.01756349,0.0338545,0.9460585,0.0002527987,0.0001599583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01639549,0.00003886478,0.9794679,0.002101051,0.0003134787,0.0002901537,0.00001480693,0.0001148453,0.001263397],"genre_scores_gemma":[0.9595855,0.00002663054,0.03944494,0.0002656011,0.00002000219,0.00003541945,0.000006494564,0.00001765497,0.0005977005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.94319,"threshold_uncertainty_score":0.547372,"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."}}