{"id":"W4234417767","doi":"10.32920/ryerson.14653842","title":"Constraint Satisfaction Problems and Their Reduction to Directed Graphs","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; Backtracking; Constraint satisfaction; Complexity of constraint satisfaction; Homomorphism; Constraint satisfaction dual problem; Constraint graph; Local consistency; Constraint programming; Digraph; Constraint logic programming; Theoretical computer science; Mathematics; Computer science; Discrete mathematics; Mathematical optimization; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002126623,0.0002935729,0.0002903426,0.0003210217,0.000143138,0.0006799572,0.0001938053,0.000234177,0.0001405472],"category_scores_gemma":[0.00004530256,0.0002705411,0.00009344816,0.0004335976,0.00006864832,0.0003291457,0.000565937,0.0003781114,0.000007055326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009522016,"about_ca_system_score_gemma":0.0001734878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003840375,"about_ca_topic_score_gemma":0.0004155639,"domain_scores_codex":[0.9982427,0.000123825,0.0003609338,0.0008662029,0.0001887748,0.0002175009],"domain_scores_gemma":[0.9987973,0.00003938068,0.0001528707,0.0005576625,0.0002676949,0.0001850689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006223494,0.00004967621,0.001910032,0.0001260853,0.0001344709,0.000004740189,0.005576698,0.01278213,0.007778189,0.01825133,0.0006505192,0.9527299],"study_design_scores_gemma":[0.001965038,0.0003727495,0.3170053,0.001585158,0.0001174165,0.001650382,0.004820776,0.5962882,0.02076075,0.04767519,0.003075702,0.00468338],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07714057,0.0001085788,0.9148489,0.002299871,0.001738195,0.0007300994,0.000009122802,0.0009584284,0.002166274],"genre_scores_gemma":[0.8837913,0.0002311627,0.115484,0.0001817447,0.00004292432,0.00007884295,0.00003850435,0.0000136869,0.0001378392],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9480465,"threshold_uncertainty_score":0.9999747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01869424628804706,"score_gpt":0.229540997640066,"score_spread":0.2108467513520189,"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."}}