{"id":"W4318953856","doi":"10.1016/j.disc.2023.113342","title":"The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Bounded function; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.001003099,0.0001574202,0.0001900571,0.00007200415,0.0003553886,0.0004544646,0.0004368256,0.00003682533,0.000003083954],"category_scores_gemma":[0.00008308776,0.0001001947,0.00002088322,0.0007462862,0.0001925837,0.0003413139,0.0005108803,0.0002109669,0.00001467659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002102251,"about_ca_system_score_gemma":0.00003025761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001461487,"about_ca_topic_score_gemma":0.00006438113,"domain_scores_codex":[0.9986157,0.00006826155,0.0002208611,0.0003049595,0.0003101389,0.0004801023],"domain_scores_gemma":[0.9984001,0.0009681928,0.00007129661,0.0004386629,0.00003581715,0.00008595776],"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.00003350975,0.00003310211,0.005183015,0.0004310941,0.00004938322,0.00007246144,0.01513287,0.0001458513,0.0006133898,0.9745823,0.0001035967,0.003619494],"study_design_scores_gemma":[0.0003787675,0.00004049342,0.001228878,0.0001275763,0.000004413744,0.00004720095,0.00218195,0.01320712,0.0001545843,0.9820791,0.0003643171,0.0001855602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9655237,0.0001042914,0.02817646,0.0008097119,0.0000435573,0.000623221,0.000005861585,0.0002174486,0.00449582],"genre_scores_gemma":[0.8334348,0.0002421677,0.1646449,0.00004540666,0.00001724448,0.0001646195,0.000002210875,0.00005109196,0.001397594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1364684,"threshold_uncertainty_score":0.4382412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01991825721515068,"score_gpt":0.2848979128020826,"score_spread":0.2649796555869319,"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."}}