{"id":"W3217648472","doi":"10.32920/ryerson.14653842.v1","title":"Constraint Satisfaction Problems and Their Reduction to Directed Graphs","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Constraint satisfaction problem; Complexity of constraint satisfaction; Constraint satisfaction; Backtracking; Constraint satisfaction dual problem; Homomorphism; Constraint graph; Local consistency; Constraint logic programming; Digraph; Constraint programming; Mathematics; Theoretical computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592015,0.0008527865,0.0007344686,0.001673145,0.001292548,0.003381562,0.001930977,0.001197142,0.006782071],"category_scores_gemma":[0.008299511,0.0007414207,0.002229052,0.00333122,0.003114089,0.004897003,0.003494301,0.005685665,0.001087251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002492769,"about_ca_system_score_gemma":0.00169394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00556307,"about_ca_topic_score_gemma":0.003322755,"domain_scores_codex":[0.9969108,0.0009371823,0.0002190963,0.0006916519,0.0009807728,0.0002605414],"domain_scores_gemma":[0.9960491,0.002774514,0.0002557886,0.0003614904,0.0004057728,0.0001534353],"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.00001621372,0.00004317005,0.0001355275,0.0001515045,0.00002686644,0.0001225341,0.0003108202,0.0149728,0.0005052096,0.9568849,0.004155586,0.02267493],"study_design_scores_gemma":[0.00001593076,0.000004892036,0.00005161679,0.00001745989,0.0000088337,0.00005263629,0.00006121718,0.01952411,0.0002934062,0.9700281,0.009934511,0.000007305724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01569841,0.001513571,0.9432132,0.002830212,0.0002542368,0.0002504048,0.000762662,0.000522098,0.03495525],"genre_scores_gemma":[0.2769935,0.00468782,0.6842303,0.001917067,0.0007940536,0.001002592,0.003813948,0.0005686357,0.02599212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006782071,"threshold_uncertainty_score":0.02268833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03139085037536413,"score_gpt":0.2835385388460185,"score_spread":0.2521476884706544,"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."}}