{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007670918,0.000151038,0.0002913797,0.0006542836,0.00007627837,0.0001233678,0.00249739,0.00005791674,0.000004077735],"category_scores_gemma":[0.0008361515,0.0001169946,0.00005848421,0.005079174,0.001135909,0.0006430788,0.001381418,0.0002589816,0.000009550178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000871358,"about_ca_system_score_gemma":0.0002160477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000124567,"about_ca_topic_score_gemma":0.000001218662,"domain_scores_codex":[0.9968041,0.0005967683,0.0004235472,0.0008513865,0.0007569208,0.0005672693],"domain_scores_gemma":[0.9978698,0.0004008773,0.00009802249,0.0008223769,0.0003826788,0.0004262367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000149839,0.0001445272,0.0003376507,0.000009877818,0.000002516192,0.00001166812,0.001404606,0.01981887,0.02686399,0.2544238,0.00003325359,0.6969342],"study_design_scores_gemma":[0.0004507181,0.0009485235,0.002520626,0.00007193159,0.000001215793,0.000107326,0.00004121512,0.23791,0.02653867,0.7306441,0.0004411683,0.0003244889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01520986,0.00004365282,0.9822556,0.0006111681,0.0006336632,0.0003540181,5.765275e-7,0.000085592,0.0008058453],"genre_scores_gemma":[0.2216133,0.000001853993,0.7781966,0.0001200647,0.00003078628,0.00002330759,8.410139e-8,0.000003223937,0.00001081236],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6966097,"threshold_uncertainty_score":0.4770903,"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."}}