{"id":"W1791050365","doi":"10.2168/lmcs-11(4:18)2015","title":"A finer reduction of constraint problems to digraphs","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Constraint satisfaction problem; Nondeterministic algorithm; Combinatorics; Mathematics; Complexity of constraint satisfaction; Discrete mathematics; Conjecture; Constraint (computer-aided design); Algebraic number; Local consistency","routes":{"ca_aff":true,"ca_fund":true,"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.001085731,0.00050326,0.0008167276,0.00111216,0.001201973,0.003836002,0.001508894,0.00101755,0.01231339],"category_scores_gemma":[0.00496232,0.0004867836,0.001730457,0.001956603,0.002367305,0.006022274,0.004097087,0.005221701,0.0009351157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001978209,"about_ca_system_score_gemma":0.00119876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003001919,"about_ca_topic_score_gemma":0.003415857,"domain_scores_codex":[0.9979864,0.0005540253,0.0001296253,0.0006201121,0.0004670756,0.0002426931],"domain_scores_gemma":[0.9971387,0.001713217,0.0001523422,0.000600884,0.0002013079,0.00019342],"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.0000164983,0.00004307749,0.0001075962,0.00005484835,0.000009238815,0.00006008789,0.0001394894,0.004748685,0.000704161,0.9830905,0.001370612,0.009655093],"study_design_scores_gemma":[0.00002078823,0.00001273291,0.0001232162,0.00001375472,0.000007458605,0.00005552666,0.00005008548,0.01901359,0.0004673039,0.97168,0.008547074,0.000008492695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08197344,0.0008979085,0.8431943,0.004475545,0.0002792972,0.0002279762,0.001126936,0.0007296969,0.06709495],"genre_scores_gemma":[0.6536421,0.001221584,0.306798,0.001741287,0.0005776305,0.0003407936,0.001942032,0.0004101752,0.0333265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01231339,"threshold_uncertainty_score":0.04119241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1612916454676848,"score_gpt":0.4418393829298686,"score_spread":0.2805477374621838,"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."}}