{"id":"W2358407808","doi":"","title":"New Algorithms for Graph Coloring Problem","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph coloring; Computer science; Heuristic; Algorithm; Graph; NP-complete; Time complexity; Theoretical computer science; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006890597,0.0001349559,0.0001920896,0.0002629213,0.0004838154,0.0003087776,0.0007701759,0.00007107069,0.00002589584],"category_scores_gemma":[0.00001114933,0.0001180165,0.0001824497,0.001148676,0.00004561964,0.0001554188,0.00009689254,0.0001064072,0.0005606994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005126595,"about_ca_system_score_gemma":0.0002072356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000684319,"about_ca_topic_score_gemma":0.00001579943,"domain_scores_codex":[0.9983095,0.00001641873,0.0004658482,0.0005602511,0.0003145057,0.0003334987],"domain_scores_gemma":[0.9985511,0.0003553763,0.0001351302,0.0004784163,0.0002959573,0.000183993],"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.000009665069,0.0002438292,0.0002433382,0.000008729849,0.00006531324,6.929391e-7,0.0007058613,0.02202039,0.004602368,0.1553011,0.02309288,0.7937058],"study_design_scores_gemma":[0.0006490158,0.00002791921,0.0003319566,0.000008137011,0.00001815504,0.00001699089,0.00003768996,0.0005300948,0.002394221,0.381189,0.6146392,0.0001576128],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008596136,0.0001577745,0.9942338,0.002700119,0.00005816768,0.000953422,0.0000250598,0.0001796962,0.0008322861],"genre_scores_gemma":[0.01154881,0.000004166748,0.985675,0.000280906,0.0004458103,0.0005972308,0.00001770168,0.00001638947,0.001413933],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7935482,"threshold_uncertainty_score":0.7206844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1018207318053253,"score_gpt":0.3821459175294481,"score_spread":0.2803251857241228,"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."}}