{"id":"W4415556772","doi":"10.61091/jcmcc128-08","title":"Small hard-to-color graphs for the Sl algorithm","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph; Vertex (graph theory); Graph coloring; Graph power; Graph algorithms; Efficient algorithm","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":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009922528,0.00078917,0.0018958,0.001073873,0.001727997,0.002610598,0.003738007,0.0004253001,0.00001468251],"category_scores_gemma":[0.00502228,0.0006211524,0.000743059,0.002707109,0.0003368882,0.0003728198,0.001880937,0.001365927,0.000007902365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002774993,"about_ca_system_score_gemma":0.001491103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000206732,"about_ca_topic_score_gemma":5.932768e-7,"domain_scores_codex":[0.992426,0.0005223706,0.003339679,0.0008000422,0.001749252,0.001162696],"domain_scores_gemma":[0.9828795,0.00841315,0.002185493,0.00114857,0.00471786,0.0006553917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001829957,0.001010281,0.00001811779,0.0005201242,0.0007970433,0.00002437006,0.001641792,0.001064387,0.00006928699,0.8974664,0.003105577,0.09409957],"study_design_scores_gemma":[0.005860405,0.001369214,0.00005485566,0.000750476,0.0004129049,0.00005681645,0.0002860579,0.5795718,0.0003274184,0.4027293,0.008142783,0.0004380234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003964722,0.001840027,0.9160365,0.003910018,0.07156549,0.002269744,0.00001471166,0.00004776576,0.0003509919],"genre_scores_gemma":[0.1526291,0.0008626363,0.8402283,0.000641995,0.004890713,0.00006888706,0.000002891381,0.0001511807,0.0005243048],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5785074,"threshold_uncertainty_score":0.999624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03372772032434005,"score_gpt":0.297906942643309,"score_spread":0.264179222318969,"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."}}