{"id":"W1995010312","doi":"10.1142/9781860947322_0033","title":"FASTER SOLUTION TO THE MAXIMUM QUARTET CONSISTENCY PROBLEM WITH CONSTRAINT PROGRAMMING","year":2005,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Constraint programming; Consistency (knowledge bases); Constraint (computer-aided design); Local consistency; Computer science; Constraint satisfaction; Constraint logic programming; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000211422,0.0001121381,0.00008469192,0.0000663718,0.0002052941,0.0002533927,0.0002389833,0.00003157156,0.0001200138],"category_scores_gemma":[0.000008768991,0.00006860145,0.00003129783,0.000300812,0.00007818162,0.0003743958,0.00005785011,0.00008847976,0.0001623079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004504058,"about_ca_system_score_gemma":0.00009712114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002594991,"about_ca_topic_score_gemma":0.0008670024,"domain_scores_codex":[0.999037,0.00004084039,0.0001939147,0.0002701267,0.0002127865,0.0002453208],"domain_scores_gemma":[0.999405,0.00003101557,0.00005663315,0.0003038737,0.0001101508,0.00009328492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000457519,0.00002975139,0.0003885236,0.000003469353,0.00001092654,0.000001566685,0.0009986768,0.00211284,0.00006570697,0.04880619,0.0009433008,0.9466345],"study_design_scores_gemma":[0.002577915,0.001189651,0.008576138,0.0001572886,0.00005209243,0.0009850389,0.003233823,0.4567541,0.001514129,0.00159495,0.5218745,0.001490349],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006008354,0.000008385527,0.9470983,0.03497647,0.0000753893,0.0005277385,8.09305e-7,0.0002295861,0.01648251],"genre_scores_gemma":[0.5588497,0.000001006461,0.4393165,0.001342669,0.00003565416,0.00003977978,0.000001494538,0.000004263485,0.0004089806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9451441,"threshold_uncertainty_score":0.2797486,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01222761297109648,"score_gpt":0.2221061175156424,"score_spread":0.2098785045445459,"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."}}