{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104549,0.001440085,0.0007262221,0.000953425,0.001735822,0.001559963,0.00198532,0.001183723,0.01694278],"category_scores_gemma":[0.008200396,0.0006948261,0.001350882,0.0009649948,0.001738228,0.004059482,0.002882913,0.002956598,0.003800266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002432952,"about_ca_system_score_gemma":0.003522829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004616771,"about_ca_topic_score_gemma":0.01005644,"domain_scores_codex":[0.9983846,0.0003596236,0.00008384324,0.0003898617,0.000470081,0.0003119745],"domain_scores_gemma":[0.9927204,0.003184658,0.0003975079,0.002409999,0.0008093345,0.0004781777],"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.001688612,0.0009391839,0.003361695,0.001004046,0.00009789768,0.0005037765,0.0007295607,0.199241,0.03440053,0.3430681,0.09309826,0.3218673],"study_design_scores_gemma":[0.0003416685,0.0002639028,0.0007305224,0.00009647122,0.00007095808,0.0002562989,0.0002495033,0.4497361,0.016458,0.4939426,0.03778226,0.00007164403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1005272,0.0003935421,0.8292027,0.003543722,0.0003116648,0.0009597215,0.001625759,0.01073137,0.05270432],"genre_scores_gemma":[0.3690912,0.0003215976,0.5995316,0.001972234,0.0001948439,0.000852767,0.003961415,0.002886862,0.02118746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01694278,"threshold_uncertainty_score":0.05667919,"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."}}