{"id":"W4307930562","doi":"10.32920/21482265","title":"A Finer Reduction of Constraint Problems to Digraphs","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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; Nondeterministic algorithm; Constraint satisfaction problem; Combinatorics; Mathematics; Conjecture; Constraint (computer-aided design); Discrete mathematics; Complexity of constraint satisfaction; Reduction (mathematics); 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.0009788801,0.0005262578,0.0007118959,0.001062661,0.00124632,0.003844072,0.00143553,0.00104482,0.01517654],"category_scores_gemma":[0.004661982,0.0005169304,0.001798541,0.001942994,0.002300643,0.006143933,0.004090995,0.005357136,0.001122201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001969449,"about_ca_system_score_gemma":0.001129579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003336387,"about_ca_topic_score_gemma":0.00379475,"domain_scores_codex":[0.9979956,0.0005541187,0.000119477,0.0006631733,0.0004510262,0.0002166523],"domain_scores_gemma":[0.9972407,0.001560002,0.0001510501,0.0006476336,0.0002173233,0.0001832283],"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.0000164247,0.0000418488,0.0001183989,0.0000595465,0.00001022774,0.00006766531,0.0001510151,0.004726534,0.0007100255,0.9805434,0.002040591,0.01151423],"study_design_scores_gemma":[0.00002057755,0.00001199294,0.0001288871,0.00001360726,0.000007932031,0.00006155897,0.00005521079,0.01835026,0.0004799599,0.9693606,0.01150104,0.000008403532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07156133,0.0008866023,0.8320409,0.005170369,0.0003271059,0.0002387715,0.001282681,0.0007909126,0.08770142],"genre_scores_gemma":[0.6305249,0.001159808,0.3181046,0.002017997,0.0006435739,0.0003728119,0.002311158,0.000505648,0.04435956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01517654,"threshold_uncertainty_score":0.05077058,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03845277788491487,"score_gpt":0.3161720023841867,"score_spread":0.2777192244992719,"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."}}