{"id":"W4385357590","doi":"10.1007/978-3-031-38906-1_22","title":"Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Computer science; Discrete mathematics; Graph; 1-planar graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446476,0.0009988543,0.001176518,0.001232948,0.0009626636,0.002672903,0.002872921,0.0009882913,0.00672958],"category_scores_gemma":[0.006719612,0.000900974,0.0009291596,0.00295783,0.0009327395,0.003611197,0.001789252,0.001592751,0.0008474091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002053757,"about_ca_system_score_gemma":0.0006634561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002607486,"about_ca_topic_score_gemma":0.004841411,"domain_scores_codex":[0.9992393,0.0001761645,0.0000395458,0.0001993659,0.0002214348,0.0001242315],"domain_scores_gemma":[0.9969529,0.001751425,0.0002620363,0.0005861529,0.0002719744,0.0001755175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002701714,0.0003511872,0.007188947,0.001448688,0.0002532912,0.0004518704,0.001174955,0.3850776,0.02894637,0.2417632,0.02833715,0.3023051],"study_design_scores_gemma":[0.0001082393,0.00007704506,0.002088463,0.00006376743,0.000082564,0.0004557168,0.0003922183,0.5450606,0.008867892,0.4360688,0.006705893,0.00002884039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4741368,0.00259325,0.4706868,0.001598949,0.0002653376,0.0002035011,0.002754392,0.002014714,0.04574617],"genre_scores_gemma":[0.7875366,0.000919014,0.1980158,0.0002527814,0.0001715698,0.0001405133,0.002998818,0.00055294,0.00941192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00672958,"threshold_uncertainty_score":0.02251267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02302543430245016,"score_gpt":0.2662281672661516,"score_spread":0.2432027329637015,"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."}}