{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001526561,0.0008681071,0.0007435714,0.001617238,0.001211171,0.00320899,0.001859472,0.001123254,0.006682652],"category_scores_gemma":[0.007661091,0.000717433,0.002086567,0.003462309,0.003013307,0.004482,0.003308729,0.005326692,0.001028272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002522775,"about_ca_system_score_gemma":0.00172207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005986456,"about_ca_topic_score_gemma":0.003660107,"domain_scores_codex":[0.9970316,0.0009048552,0.0002071846,0.0006429438,0.0009706948,0.0002427399],"domain_scores_gemma":[0.996563,0.00240501,0.0002301348,0.0003115395,0.0003584313,0.0001319426],"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.00001619823,0.00004243938,0.0001403087,0.0001571019,0.00002837975,0.0001132036,0.0002801547,0.01766378,0.0004908178,0.9520966,0.004609169,0.02436182],"study_design_scores_gemma":[0.00001627702,0.000004801073,0.00005639484,0.0000182979,0.000008917525,0.00004896852,0.0000584119,0.02336687,0.0003060961,0.9652398,0.01086743,0.000007604669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01366215,0.001588678,0.9464606,0.002692521,0.0002283108,0.0002284789,0.0007594895,0.0004659996,0.03391381],"genre_scores_gemma":[0.269917,0.005123355,0.6907431,0.001839938,0.0007683325,0.001019425,0.003823609,0.0005423866,0.02622278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006682652,"threshold_uncertainty_score":0.02235574,"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."}}