{"id":"W2073818615","doi":"10.1007/s10489-013-0429-5","title":"A hierarchical parallel genetic approach for the graph coloring problem","year":2013,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Crossover; Operator (biology); Constraint satisfaction problem; Graph coloring; Graph; Genetic algorithm; Mathematical optimization; Local consistency; Theoretical computer science; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001677815,0.0001695789,0.0002266882,0.0001448124,0.0005806421,0.0004119446,0.001384893,0.00008936977,0.0002362849],"category_scores_gemma":[0.0006832915,0.00009891683,0.0001599769,0.0009469416,0.0003202099,0.00009222441,0.0001443698,0.0002640843,0.0009524596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001709897,"about_ca_system_score_gemma":0.0000661117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007839876,"about_ca_topic_score_gemma":0.000004593486,"domain_scores_codex":[0.9975631,0.00005240765,0.0005923857,0.0005976345,0.0006888685,0.0005055673],"domain_scores_gemma":[0.9957431,0.002983554,0.0001419299,0.0007472396,0.0002434841,0.0001406975],"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.00006331847,0.0002403768,0.0007708362,0.00001493434,0.0001027598,4.971132e-7,0.001478244,0.1948697,0.0009190308,0.4231521,0.00960881,0.3687794],"study_design_scores_gemma":[0.0001481356,0.00006888848,0.002381256,0.000005889627,0.00003699199,0.00001012038,0.001482158,0.2745153,0.0009737658,0.7105296,0.009551469,0.0002963562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005798877,0.0003046169,0.9818675,0.0008086698,0.0001425275,0.001290795,0.000003297174,0.00007908534,0.00970463],"genre_scores_gemma":[0.6764706,0.00002889733,0.320985,0.0002515299,0.0001057337,0.001408884,0.000001952427,0.00001254494,0.0007348361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6706718,"threshold_uncertainty_score":0.9998254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1276837091283285,"score_gpt":0.3495534716594417,"score_spread":0.2218697625311132,"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."}}