{"id":"W4379983127","doi":"10.32920/23459144","title":"Expressibility Of Constraint Satisfaction Problems In Extensions Of First-Order Logic","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Mathematics; Idempotence; Class (philosophy); Descriptive complexity theory; Order (exchange); Discrete mathematics; Time complexity; Polynomial; Constraint (computer-aided design); Constraint satisfaction; Algebra over a field; Pure mathematics; Computer science; 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.003804541,0.0007357909,0.0008910673,0.0009049157,0.0009826191,0.004010097,0.002307708,0.001162541,0.00355539],"category_scores_gemma":[0.009403977,0.0008396611,0.002975702,0.00176173,0.003806985,0.01025783,0.003197118,0.005996378,0.0003612521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003348026,"about_ca_system_score_gemma":0.001816177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002737905,"about_ca_topic_score_gemma":0.004223897,"domain_scores_codex":[0.9963309,0.001145203,0.0003006407,0.0007077269,0.001125757,0.0003898304],"domain_scores_gemma":[0.991085,0.006607175,0.0005472518,0.0009197774,0.0005033897,0.0003373725],"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.000107475,0.0001260589,0.0005711276,0.0001763555,0.00005747248,0.0002097696,0.0005735719,0.0337735,0.002492726,0.9425878,0.001519657,0.01780446],"study_design_scores_gemma":[0.00004054626,0.00003311831,0.0001140005,0.00002285899,0.00002375232,0.00008683169,0.0001053454,0.08743758,0.002201745,0.9071966,0.002718394,0.00001912621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1705499,0.0009168204,0.8031529,0.003855949,0.0001011859,0.0001949532,0.0006664573,0.001043231,0.01951865],"genre_scores_gemma":[0.7586294,0.0008931211,0.2295844,0.000758419,0.0002060939,0.0002490148,0.00110144,0.0001700185,0.008407958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004010097,"threshold_uncertainty_score":0.02429169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06515020277542678,"score_gpt":0.2905297792477522,"score_spread":0.2253795764723254,"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."}}